/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:19:26,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:19:26,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:19:26,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:19:26,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:19:26,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:19:26,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:19:26,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:19:26,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:19:26,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:19:26,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:19:26,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:19:26,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:19:26,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:19:26,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:19:26,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:19:26,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:19:26,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:19:26,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:19:26,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:19:26,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:19:26,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:19:26,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:19:26,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:19:26,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:19:26,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:19:26,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:19:26,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:19:26,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:19:26,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:19:26,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:19:26,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:19:26,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:19:26,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:19:26,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:19:26,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:19:26,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:19:26,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:19:26,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:19:26,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:19:26,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:19:26,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:19:26,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:19:26,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:19:26,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:19:26,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:19:26,587 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:19:26,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:19:26,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:19:26,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:19:26,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:19:26,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:19:26,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:19:26,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:19:26,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:19:26,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:19:26,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:19:26,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:19:26,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:19:26,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:19:26,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:19:26,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:19:26,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:19:26,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:19:26,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:19:26,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:19:26,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:19:26,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:19:26,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:19:26,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:19:26,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:19:26,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:19:26,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:19:26,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:19:26,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:19:26,909 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:19:26,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i [2019-12-18 18:19:26,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b0a8182/4f59c2772ea2400fbd3866fe0d157b6e/FLAG46eb471e5 [2019-12-18 18:19:27,507 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:19:27,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i [2019-12-18 18:19:27,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b0a8182/4f59c2772ea2400fbd3866fe0d157b6e/FLAG46eb471e5 [2019-12-18 18:19:27,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b0a8182/4f59c2772ea2400fbd3866fe0d157b6e [2019-12-18 18:19:27,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:19:27,822 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:19:27,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:19:27,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:19:27,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:19:27,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:19:27" (1/1) ... [2019-12-18 18:19:27,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49494e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:27, skipping insertion in model container [2019-12-18 18:19:27,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:19:27" (1/1) ... [2019-12-18 18:19:27,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:19:27,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:19:28,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:19:28,515 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:19:28,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:19:28,678 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:19:28,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28 WrapperNode [2019-12-18 18:19:28,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:19:28,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:19:28,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:19:28,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:19:28,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:19:28,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:19:28,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:19:28,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:19:28,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... [2019-12-18 18:19:28,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:19:28,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:19:28,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:19:28,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:19:28,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:19:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:19:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:19:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:19:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:19:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:19:28,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:19:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:19:28,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:19:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:19:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:19:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:19:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:19:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:19:28,874 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:19:29,593 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:19:29,594 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:19:29,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:19:29 BoogieIcfgContainer [2019-12-18 18:19:29,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:19:29,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:19:29,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:19:29,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:19:29,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:19:27" (1/3) ... [2019-12-18 18:19:29,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b07ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:19:29, skipping insertion in model container [2019-12-18 18:19:29,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:28" (2/3) ... [2019-12-18 18:19:29,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b07ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:19:29, skipping insertion in model container [2019-12-18 18:19:29,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:19:29" (3/3) ... [2019-12-18 18:19:29,605 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.oepc.i [2019-12-18 18:19:29,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:19:29,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:19:29,625 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:19:29,626 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:19:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,722 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,722 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,732 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,732 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,738 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,738 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,742 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:29,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:19:29,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:19:29,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:19:29,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:19:29,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:19:29,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:19:29,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:19:29,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:19:29,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:19:29,804 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 18:19:29,806 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:19:29,886 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:19:29,886 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:19:29,905 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:19:29,937 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:19:29,980 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:19:29,980 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:19:29,990 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:19:30,016 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:19:30,017 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:19:35,583 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:19:35,694 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:19:35,710 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-18 18:19:35,710 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 18:19:35,714 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 18:19:45,842 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-18 18:19:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-18 18:19:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:19:45,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:19:45,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:19:45,852 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:19:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:19:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-18 18:19:45,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:19:45,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056980775] [2019-12-18 18:19:45,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:19:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:19:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:19:46,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056980775] [2019-12-18 18:19:46,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:19:46,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:19:46,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933484613] [2019-12-18 18:19:46,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:19:46,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:19:46,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:19:46,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:19:46,178 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-18 18:19:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:19:48,993 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-18 18:19:48,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:19:48,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:19:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:19:49,564 INFO L225 Difference]: With dead ends: 79498 [2019-12-18 18:19:49,564 INFO L226 Difference]: Without dead ends: 74626 [2019-12-18 18:19:49,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:19:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-18 18:19:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-18 18:19:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-18 18:19:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-18 18:19:56,905 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-18 18:19:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:19:56,906 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-18 18:19:56,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:19:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-18 18:19:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:19:56,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:19:56,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:19:56,924 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:19:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:19:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-18 18:19:56,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:19:56,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141735951] [2019-12-18 18:19:56,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:19:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:19:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:19:57,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141735951] [2019-12-18 18:19:57,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:19:57,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:19:57,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003840353] [2019-12-18 18:19:57,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:19:57,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:19:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:19:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:19:57,032 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-18 18:19:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:19:59,929 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-18 18:19:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:19:59,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:19:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:00,051 INFO L225 Difference]: With dead ends: 19918 [2019-12-18 18:20:00,051 INFO L226 Difference]: Without dead ends: 19918 [2019-12-18 18:20:00,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-18 18:20:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-18 18:20:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-18 18:20:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-18 18:20:00,606 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-18 18:20:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:00,606 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-18 18:20:00,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-18 18:20:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:20:00,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:00,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:00,609 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-18 18:20:00,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:00,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496809746] [2019-12-18 18:20:00,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:00,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496809746] [2019-12-18 18:20:00,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:00,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:00,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417174576] [2019-12-18 18:20:00,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:00,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:00,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:00,735 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-18 18:20:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:01,096 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-18 18:20:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:20:01,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:20:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:01,285 INFO L225 Difference]: With dead ends: 29603 [2019-12-18 18:20:01,285 INFO L226 Difference]: Without dead ends: 29589 [2019-12-18 18:20:01,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-18 18:20:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-18 18:20:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-18 18:20:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-18 18:20:02,255 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-18 18:20:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:02,256 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-18 18:20:02,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-18 18:20:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:20:02,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:02,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:02,259 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-18 18:20:02,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:02,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625222911] [2019-12-18 18:20:02,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:02,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625222911] [2019-12-18 18:20:02,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:02,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:02,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721662243] [2019-12-18 18:20:02,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:20:02,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:20:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:02,348 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-18 18:20:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:02,876 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-18 18:20:02,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:20:02,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:20:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:02,991 INFO L225 Difference]: With dead ends: 40028 [2019-12-18 18:20:02,991 INFO L226 Difference]: Without dead ends: 40010 [2019-12-18 18:20:02,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-18 18:20:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-18 18:20:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-18 18:20:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-18 18:20:04,246 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-18 18:20:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:04,247 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-18 18:20:04,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:20:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-18 18:20:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:20:04,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:04,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:04,260 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-18 18:20:04,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:04,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501540025] [2019-12-18 18:20:04,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:04,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501540025] [2019-12-18 18:20:04,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:04,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:20:04,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847570060] [2019-12-18 18:20:04,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:20:04,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:04,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:20:04,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:20:04,433 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-18 18:20:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:05,355 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-18 18:20:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:20:05,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:20:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:05,489 INFO L225 Difference]: With dead ends: 54414 [2019-12-18 18:20:05,489 INFO L226 Difference]: Without dead ends: 54384 [2019-12-18 18:20:05,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:20:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-18 18:20:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-18 18:20:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-18 18:20:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-18 18:20:06,737 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-18 18:20:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:06,737 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-18 18:20:06,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:20:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-18 18:20:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:20:06,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:06,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:06,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-18 18:20:06,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:06,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310027093] [2019-12-18 18:20:06,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:06,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310027093] [2019-12-18 18:20:06,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:06,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:20:06,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184049817] [2019-12-18 18:20:06,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:06,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:06,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:06,876 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-18 18:20:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:07,914 INFO L93 Difference]: Finished difference Result 54885 states and 178707 transitions. [2019-12-18 18:20:07,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:20:07,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 18:20:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:08,060 INFO L225 Difference]: With dead ends: 54885 [2019-12-18 18:20:08,060 INFO L226 Difference]: Without dead ends: 54843 [2019-12-18 18:20:08,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:20:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54843 states. [2019-12-18 18:20:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54843 to 31795. [2019-12-18 18:20:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-12-18 18:20:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 106002 transitions. [2019-12-18 18:20:09,215 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 106002 transitions. Word has length 22 [2019-12-18 18:20:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:09,215 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 106002 transitions. [2019-12-18 18:20:09,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 106002 transitions. [2019-12-18 18:20:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:20:09,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:09,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:09,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-18 18:20:09,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:09,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337358511] [2019-12-18 18:20:09,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:09,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337358511] [2019-12-18 18:20:09,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:09,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:09,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93015853] [2019-12-18 18:20:09,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:09,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:09,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:09,284 INFO L87 Difference]: Start difference. First operand 31795 states and 106002 transitions. Second operand 4 states. [2019-12-18 18:20:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:09,351 INFO L93 Difference]: Finished difference Result 12400 states and 38387 transitions. [2019-12-18 18:20:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:20:09,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:20:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:09,369 INFO L225 Difference]: With dead ends: 12400 [2019-12-18 18:20:09,369 INFO L226 Difference]: Without dead ends: 12400 [2019-12-18 18:20:09,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2019-12-18 18:20:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 12304. [2019-12-18 18:20:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12304 states. [2019-12-18 18:20:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12304 states to 12304 states and 38107 transitions. [2019-12-18 18:20:09,561 INFO L78 Accepts]: Start accepts. Automaton has 12304 states and 38107 transitions. Word has length 25 [2019-12-18 18:20:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:09,562 INFO L462 AbstractCegarLoop]: Abstraction has 12304 states and 38107 transitions. [2019-12-18 18:20:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 12304 states and 38107 transitions. [2019-12-18 18:20:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:20:09,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:09,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:09,580 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-18 18:20:09,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:09,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687020574] [2019-12-18 18:20:09,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:09,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687020574] [2019-12-18 18:20:09,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:09,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:20:09,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713087448] [2019-12-18 18:20:09,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:09,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:09,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:09,649 INFO L87 Difference]: Start difference. First operand 12304 states and 38107 transitions. Second operand 3 states. [2019-12-18 18:20:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:09,693 INFO L93 Difference]: Finished difference Result 12303 states and 38105 transitions. [2019-12-18 18:20:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:09,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 18:20:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:09,713 INFO L225 Difference]: With dead ends: 12303 [2019-12-18 18:20:09,713 INFO L226 Difference]: Without dead ends: 12303 [2019-12-18 18:20:09,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12303 states. [2019-12-18 18:20:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12303 to 12303. [2019-12-18 18:20:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-12-18 18:20:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 38105 transitions. [2019-12-18 18:20:09,907 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 38105 transitions. Word has length 39 [2019-12-18 18:20:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:09,907 INFO L462 AbstractCegarLoop]: Abstraction has 12303 states and 38105 transitions. [2019-12-18 18:20:09,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 38105 transitions. [2019-12-18 18:20:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:20:09,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:09,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:09,928 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-18 18:20:09,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:09,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128882713] [2019-12-18 18:20:09,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:09,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128882713] [2019-12-18 18:20:09,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:09,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:20:09,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427518872] [2019-12-18 18:20:09,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:20:09,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:09,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:20:09,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:09,997 INFO L87 Difference]: Start difference. First operand 12303 states and 38105 transitions. Second operand 5 states. [2019-12-18 18:20:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:10,071 INFO L93 Difference]: Finished difference Result 11071 states and 34927 transitions. [2019-12-18 18:20:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:20:10,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:20:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:10,095 INFO L225 Difference]: With dead ends: 11071 [2019-12-18 18:20:10,095 INFO L226 Difference]: Without dead ends: 11071 [2019-12-18 18:20:10,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2019-12-18 18:20:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 10759. [2019-12-18 18:20:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10759 states. [2019-12-18 18:20:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10759 states to 10759 states and 34051 transitions. [2019-12-18 18:20:10,369 INFO L78 Accepts]: Start accepts. Automaton has 10759 states and 34051 transitions. Word has length 40 [2019-12-18 18:20:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:10,369 INFO L462 AbstractCegarLoop]: Abstraction has 10759 states and 34051 transitions. [2019-12-18 18:20:10,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:20:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10759 states and 34051 transitions. [2019-12-18 18:20:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:10,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:10,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:10,393 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-18 18:20:10,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:10,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669872462] [2019-12-18 18:20:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:10,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669872462] [2019-12-18 18:20:10,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:10,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:10,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812826259] [2019-12-18 18:20:10,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:10,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:10,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:10,463 INFO L87 Difference]: Start difference. First operand 10759 states and 34051 transitions. Second operand 3 states. [2019-12-18 18:20:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:10,540 INFO L93 Difference]: Finished difference Result 14663 states and 46512 transitions. [2019-12-18 18:20:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:10,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:20:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:10,679 INFO L225 Difference]: With dead ends: 14663 [2019-12-18 18:20:10,680 INFO L226 Difference]: Without dead ends: 14663 [2019-12-18 18:20:10,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14663 states. [2019-12-18 18:20:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14663 to 12155. [2019-12-18 18:20:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12155 states. [2019-12-18 18:20:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12155 states to 12155 states and 39013 transitions. [2019-12-18 18:20:10,883 INFO L78 Accepts]: Start accepts. Automaton has 12155 states and 39013 transitions. Word has length 54 [2019-12-18 18:20:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:10,883 INFO L462 AbstractCegarLoop]: Abstraction has 12155 states and 39013 transitions. [2019-12-18 18:20:10,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12155 states and 39013 transitions. [2019-12-18 18:20:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:10,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:10,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:10,904 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-18 18:20:10,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:10,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673309238] [2019-12-18 18:20:10,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:10,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673309238] [2019-12-18 18:20:10,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:10,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:10,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49088673] [2019-12-18 18:20:10,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:10,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:10,991 INFO L87 Difference]: Start difference. First operand 12155 states and 39013 transitions. Second operand 4 states. [2019-12-18 18:20:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:11,107 INFO L93 Difference]: Finished difference Result 23229 states and 74774 transitions. [2019-12-18 18:20:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:20:11,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 18:20:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:11,133 INFO L225 Difference]: With dead ends: 23229 [2019-12-18 18:20:11,133 INFO L226 Difference]: Without dead ends: 11383 [2019-12-18 18:20:11,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2019-12-18 18:20:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 11383. [2019-12-18 18:20:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11383 states. [2019-12-18 18:20:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 36651 transitions. [2019-12-18 18:20:11,320 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 36651 transitions. Word has length 54 [2019-12-18 18:20:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:11,320 INFO L462 AbstractCegarLoop]: Abstraction has 11383 states and 36651 transitions. [2019-12-18 18:20:11,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 36651 transitions. [2019-12-18 18:20:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:11,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:11,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:11,335 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-18 18:20:11,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:11,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087428075] [2019-12-18 18:20:11,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:11,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087428075] [2019-12-18 18:20:11,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:11,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:11,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367493338] [2019-12-18 18:20:11,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:11,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:11,409 INFO L87 Difference]: Start difference. First operand 11383 states and 36651 transitions. Second operand 4 states. [2019-12-18 18:20:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:11,547 INFO L93 Difference]: Finished difference Result 29018 states and 95263 transitions. [2019-12-18 18:20:11,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:20:11,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 18:20:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:11,559 INFO L225 Difference]: With dead ends: 29018 [2019-12-18 18:20:11,559 INFO L226 Difference]: Without dead ends: 5072 [2019-12-18 18:20:11,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-12-18 18:20:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2019-12-18 18:20:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-12-18 18:20:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 17135 transitions. [2019-12-18 18:20:11,654 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 17135 transitions. Word has length 54 [2019-12-18 18:20:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:11,654 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 17135 transitions. [2019-12-18 18:20:11,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 17135 transitions. [2019-12-18 18:20:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:11,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:11,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:11,661 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-18 18:20:11,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:11,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538761078] [2019-12-18 18:20:11,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:11,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538761078] [2019-12-18 18:20:11,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:11,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:20:11,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413645017] [2019-12-18 18:20:11,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:11,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:11,774 INFO L87 Difference]: Start difference. First operand 5072 states and 17135 transitions. Second operand 7 states. [2019-12-18 18:20:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:12,030 INFO L93 Difference]: Finished difference Result 9562 states and 31657 transitions. [2019-12-18 18:20:12,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:20:12,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:20:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:12,044 INFO L225 Difference]: With dead ends: 9562 [2019-12-18 18:20:12,044 INFO L226 Difference]: Without dead ends: 6984 [2019-12-18 18:20:12,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:20:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2019-12-18 18:20:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6241. [2019-12-18 18:20:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-12-18 18:20:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 21010 transitions. [2019-12-18 18:20:12,158 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 21010 transitions. Word has length 54 [2019-12-18 18:20:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:12,159 INFO L462 AbstractCegarLoop]: Abstraction has 6241 states and 21010 transitions. [2019-12-18 18:20:12,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 21010 transitions. [2019-12-18 18:20:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:12,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:12,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:12,167 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-18 18:20:12,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:12,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292457512] [2019-12-18 18:20:12,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:12,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292457512] [2019-12-18 18:20:12,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:12,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:20:12,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310635570] [2019-12-18 18:20:12,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:12,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:12,249 INFO L87 Difference]: Start difference. First operand 6241 states and 21010 transitions. Second operand 7 states. [2019-12-18 18:20:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:12,536 INFO L93 Difference]: Finished difference Result 11586 states and 38057 transitions. [2019-12-18 18:20:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:20:12,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:20:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:12,556 INFO L225 Difference]: With dead ends: 11586 [2019-12-18 18:20:12,557 INFO L226 Difference]: Without dead ends: 8529 [2019-12-18 18:20:12,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:20:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2019-12-18 18:20:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 7599. [2019-12-18 18:20:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2019-12-18 18:20:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 25347 transitions. [2019-12-18 18:20:12,821 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 25347 transitions. Word has length 54 [2019-12-18 18:20:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:12,821 INFO L462 AbstractCegarLoop]: Abstraction has 7599 states and 25347 transitions. [2019-12-18 18:20:12,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 25347 transitions. [2019-12-18 18:20:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:12,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:12,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:12,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:12,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-18 18:20:12,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:12,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070569884] [2019-12-18 18:20:12,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:12,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070569884] [2019-12-18 18:20:12,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:12,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:20:12,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494735596] [2019-12-18 18:20:12,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:12,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:12,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:12,916 INFO L87 Difference]: Start difference. First operand 7599 states and 25347 transitions. Second operand 7 states. [2019-12-18 18:20:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:13,283 INFO L93 Difference]: Finished difference Result 16599 states and 53966 transitions. [2019-12-18 18:20:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:20:13,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:20:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:13,313 INFO L225 Difference]: With dead ends: 16599 [2019-12-18 18:20:13,313 INFO L226 Difference]: Without dead ends: 14168 [2019-12-18 18:20:13,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:20:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14168 states. [2019-12-18 18:20:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14168 to 7739. [2019-12-18 18:20:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-18 18:20:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 25816 transitions. [2019-12-18 18:20:13,579 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 25816 transitions. Word has length 54 [2019-12-18 18:20:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:13,579 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 25816 transitions. [2019-12-18 18:20:13,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 25816 transitions. [2019-12-18 18:20:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:13,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:13,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:13,588 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-18 18:20:13,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:13,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570965713] [2019-12-18 18:20:13,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570965713] [2019-12-18 18:20:13,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:13,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:13,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307599912] [2019-12-18 18:20:13,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:13,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:13,660 INFO L87 Difference]: Start difference. First operand 7739 states and 25816 transitions. Second operand 3 states. [2019-12-18 18:20:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:13,698 INFO L93 Difference]: Finished difference Result 6206 states and 20080 transitions. [2019-12-18 18:20:13,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:13,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:20:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:13,708 INFO L225 Difference]: With dead ends: 6206 [2019-12-18 18:20:13,708 INFO L226 Difference]: Without dead ends: 6206 [2019-12-18 18:20:13,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-18 18:20:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5926. [2019-12-18 18:20:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 18:20:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19190 transitions. [2019-12-18 18:20:13,809 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19190 transitions. Word has length 54 [2019-12-18 18:20:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:13,810 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19190 transitions. [2019-12-18 18:20:13,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19190 transitions. [2019-12-18 18:20:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:20:13,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:13,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:13,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-18 18:20:13,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:13,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305548507] [2019-12-18 18:20:13,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:13,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305548507] [2019-12-18 18:20:13,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:13,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:13,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468816568] [2019-12-18 18:20:13,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:13,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:13,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:13,981 INFO L87 Difference]: Start difference. First operand 5926 states and 19190 transitions. Second operand 3 states. [2019-12-18 18:20:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:14,018 INFO L93 Difference]: Finished difference Result 5926 states and 19188 transitions. [2019-12-18 18:20:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:14,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 18:20:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:14,030 INFO L225 Difference]: With dead ends: 5926 [2019-12-18 18:20:14,030 INFO L226 Difference]: Without dead ends: 5926 [2019-12-18 18:20:14,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-18 18:20:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2019-12-18 18:20:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 18:20:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19188 transitions. [2019-12-18 18:20:14,180 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19188 transitions. Word has length 55 [2019-12-18 18:20:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:14,180 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19188 transitions. [2019-12-18 18:20:14,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19188 transitions. [2019-12-18 18:20:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:14,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:14,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:14,190 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-18 18:20:14,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:14,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016215302] [2019-12-18 18:20:14,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:14,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016215302] [2019-12-18 18:20:14,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:14,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:20:14,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351709642] [2019-12-18 18:20:14,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:20:14,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:14,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:20:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:20:14,893 INFO L87 Difference]: Start difference. First operand 5926 states and 19188 transitions. Second operand 17 states. [2019-12-18 18:20:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:20,123 INFO L93 Difference]: Finished difference Result 11221 states and 35242 transitions. [2019-12-18 18:20:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:20:20,124 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 18:20:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:20,137 INFO L225 Difference]: With dead ends: 11221 [2019-12-18 18:20:20,138 INFO L226 Difference]: Without dead ends: 8387 [2019-12-18 18:20:20,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 18:20:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8387 states. [2019-12-18 18:20:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8387 to 6834. [2019-12-18 18:20:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6834 states. [2019-12-18 18:20:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 21634 transitions. [2019-12-18 18:20:20,261 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 21634 transitions. Word has length 56 [2019-12-18 18:20:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:20,262 INFO L462 AbstractCegarLoop]: Abstraction has 6834 states and 21634 transitions. [2019-12-18 18:20:20,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:20:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 21634 transitions. [2019-12-18 18:20:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:20,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:20,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:20,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash 290005151, now seen corresponding path program 2 times [2019-12-18 18:20:20,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:20,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668047622] [2019-12-18 18:20:20,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:20,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668047622] [2019-12-18 18:20:20,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:20,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:20:20,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862351140] [2019-12-18 18:20:20,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:20:20,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:20:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:20:20,915 INFO L87 Difference]: Start difference. First operand 6834 states and 21634 transitions. Second operand 17 states. [2019-12-18 18:20:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:25,433 INFO L93 Difference]: Finished difference Result 9607 states and 30014 transitions. [2019-12-18 18:20:25,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:20:25,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 18:20:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:25,447 INFO L225 Difference]: With dead ends: 9607 [2019-12-18 18:20:25,447 INFO L226 Difference]: Without dead ends: 8125 [2019-12-18 18:20:25,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 18:20:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8125 states. [2019-12-18 18:20:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8125 to 6786. [2019-12-18 18:20:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6786 states. [2019-12-18 18:20:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6786 states to 6786 states and 21506 transitions. [2019-12-18 18:20:25,590 INFO L78 Accepts]: Start accepts. Automaton has 6786 states and 21506 transitions. Word has length 56 [2019-12-18 18:20:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:25,590 INFO L462 AbstractCegarLoop]: Abstraction has 6786 states and 21506 transitions. [2019-12-18 18:20:25,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:20:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6786 states and 21506 transitions. [2019-12-18 18:20:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:25,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:25,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:25,599 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1327897071, now seen corresponding path program 3 times [2019-12-18 18:20:25,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:25,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982455478] [2019-12-18 18:20:25,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:25,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982455478] [2019-12-18 18:20:25,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:25,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:20:25,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64176598] [2019-12-18 18:20:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:20:25,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:25,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:20:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:20:25,881 INFO L87 Difference]: Start difference. First operand 6786 states and 21506 transitions. Second operand 11 states. [2019-12-18 18:20:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:28,083 INFO L93 Difference]: Finished difference Result 13993 states and 43761 transitions. [2019-12-18 18:20:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:20:28,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 18:20:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:28,099 INFO L225 Difference]: With dead ends: 13993 [2019-12-18 18:20:28,100 INFO L226 Difference]: Without dead ends: 9201 [2019-12-18 18:20:28,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:20:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-12-18 18:20:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 7082. [2019-12-18 18:20:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2019-12-18 18:20:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 22155 transitions. [2019-12-18 18:20:28,229 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 22155 transitions. Word has length 56 [2019-12-18 18:20:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:28,229 INFO L462 AbstractCegarLoop]: Abstraction has 7082 states and 22155 transitions. [2019-12-18 18:20:28,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:20:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 22155 transitions. [2019-12-18 18:20:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:28,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:28,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:28,237 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 736614263, now seen corresponding path program 4 times [2019-12-18 18:20:28,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:28,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679681389] [2019-12-18 18:20:28,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:28,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679681389] [2019-12-18 18:20:28,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:28,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:20:28,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701620637] [2019-12-18 18:20:28,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:20:28,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:20:28,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:20:28,537 INFO L87 Difference]: Start difference. First operand 7082 states and 22155 transitions. Second operand 12 states. [2019-12-18 18:20:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:30,667 INFO L93 Difference]: Finished difference Result 12888 states and 39935 transitions. [2019-12-18 18:20:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:20:30,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 18:20:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:30,682 INFO L225 Difference]: With dead ends: 12888 [2019-12-18 18:20:30,683 INFO L226 Difference]: Without dead ends: 9025 [2019-12-18 18:20:30,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2019-12-18 18:20:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9025 states. [2019-12-18 18:20:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9025 to 6910. [2019-12-18 18:20:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6910 states. [2019-12-18 18:20:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6910 states to 6910 states and 21571 transitions. [2019-12-18 18:20:30,808 INFO L78 Accepts]: Start accepts. Automaton has 6910 states and 21571 transitions. Word has length 56 [2019-12-18 18:20:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:30,808 INFO L462 AbstractCegarLoop]: Abstraction has 6910 states and 21571 transitions. [2019-12-18 18:20:30,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:20:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6910 states and 21571 transitions. [2019-12-18 18:20:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:30,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:30,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:30,816 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash -207244209, now seen corresponding path program 5 times [2019-12-18 18:20:30,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:30,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61706874] [2019-12-18 18:20:30,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:31,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61706874] [2019-12-18 18:20:31,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:31,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:20:31,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484486790] [2019-12-18 18:20:31,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:20:31,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:20:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:20:31,451 INFO L87 Difference]: Start difference. First operand 6910 states and 21571 transitions. Second operand 15 states. [2019-12-18 18:20:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:34,947 INFO L93 Difference]: Finished difference Result 10454 states and 31790 transitions. [2019-12-18 18:20:34,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 18:20:34,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 18:20:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:34,963 INFO L225 Difference]: With dead ends: 10454 [2019-12-18 18:20:34,964 INFO L226 Difference]: Without dead ends: 10120 [2019-12-18 18:20:34,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 18:20:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10120 states. [2019-12-18 18:20:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10120 to 8005. [2019-12-18 18:20:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8005 states. [2019-12-18 18:20:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8005 states to 8005 states and 24819 transitions. [2019-12-18 18:20:35,200 INFO L78 Accepts]: Start accepts. Automaton has 8005 states and 24819 transitions. Word has length 56 [2019-12-18 18:20:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:35,200 INFO L462 AbstractCegarLoop]: Abstraction has 8005 states and 24819 transitions. [2019-12-18 18:20:35,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:20:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8005 states and 24819 transitions. [2019-12-18 18:20:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:35,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:35,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:35,209 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash -392165105, now seen corresponding path program 6 times [2019-12-18 18:20:35,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:35,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504915741] [2019-12-18 18:20:35,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:35,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504915741] [2019-12-18 18:20:35,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:35,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:20:35,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773719610] [2019-12-18 18:20:35,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:20:35,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:20:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:20:35,755 INFO L87 Difference]: Start difference. First operand 8005 states and 24819 transitions. Second operand 15 states. [2019-12-18 18:20:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:38,846 INFO L93 Difference]: Finished difference Result 10148 states and 30676 transitions. [2019-12-18 18:20:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 18:20:38,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 18:20:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:38,860 INFO L225 Difference]: With dead ends: 10148 [2019-12-18 18:20:38,860 INFO L226 Difference]: Without dead ends: 8670 [2019-12-18 18:20:38,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=428, Invalid=2022, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 18:20:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2019-12-18 18:20:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 6846. [2019-12-18 18:20:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6846 states. [2019-12-18 18:20:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6846 states to 6846 states and 21360 transitions. [2019-12-18 18:20:38,982 INFO L78 Accepts]: Start accepts. Automaton has 6846 states and 21360 transitions. Word has length 56 [2019-12-18 18:20:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:38,982 INFO L462 AbstractCegarLoop]: Abstraction has 6846 states and 21360 transitions. [2019-12-18 18:20:38,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:20:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6846 states and 21360 transitions. [2019-12-18 18:20:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:38,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:38,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:38,990 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:38,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:38,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1234081509, now seen corresponding path program 7 times [2019-12-18 18:20:38,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:38,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116212329] [2019-12-18 18:20:38,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:39,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116212329] [2019-12-18 18:20:39,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:39,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:20:39,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658189210] [2019-12-18 18:20:39,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:20:39,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:20:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:20:39,534 INFO L87 Difference]: Start difference. First operand 6846 states and 21360 transitions. Second operand 17 states. [2019-12-18 18:20:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:43,539 INFO L93 Difference]: Finished difference Result 9844 states and 29934 transitions. [2019-12-18 18:20:43,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 18:20:43,540 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 18:20:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:43,554 INFO L225 Difference]: With dead ends: 9844 [2019-12-18 18:20:43,554 INFO L226 Difference]: Without dead ends: 8502 [2019-12-18 18:20:43,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 18:20:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8502 states. [2019-12-18 18:20:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8502 to 7655. [2019-12-18 18:20:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-12-18 18:20:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 23731 transitions. [2019-12-18 18:20:43,682 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 23731 transitions. Word has length 56 [2019-12-18 18:20:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:43,683 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 23731 transitions. [2019-12-18 18:20:43,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:20:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 23731 transitions. [2019-12-18 18:20:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:43,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:43,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:43,691 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -561710121, now seen corresponding path program 8 times [2019-12-18 18:20:43,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:43,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74415962] [2019-12-18 18:20:43,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:44,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74415962] [2019-12-18 18:20:44,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:44,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:20:44,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538675936] [2019-12-18 18:20:44,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:20:44,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:20:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:20:44,497 INFO L87 Difference]: Start difference. First operand 7655 states and 23731 transitions. Second operand 20 states. [2019-12-18 18:20:48,614 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-12-18 18:20:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:49,059 INFO L93 Difference]: Finished difference Result 10682 states and 32819 transitions. [2019-12-18 18:20:49,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 18:20:49,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 18:20:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:49,074 INFO L225 Difference]: With dead ends: 10682 [2019-12-18 18:20:49,075 INFO L226 Difference]: Without dead ends: 9894 [2019-12-18 18:20:49,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=431, Invalid=3229, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 18:20:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2019-12-18 18:20:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9211. [2019-12-18 18:20:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-18 18:20:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 28493 transitions. [2019-12-18 18:20:49,215 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 28493 transitions. Word has length 56 [2019-12-18 18:20:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:49,215 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 28493 transitions. [2019-12-18 18:20:49,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 18:20:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 28493 transitions. [2019-12-18 18:20:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:49,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:49,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:49,225 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash -746631017, now seen corresponding path program 9 times [2019-12-18 18:20:49,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:49,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295649473] [2019-12-18 18:20:49,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:49,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295649473] [2019-12-18 18:20:49,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:49,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:20:49,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308483076] [2019-12-18 18:20:49,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:20:49,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:20:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:20:49,989 INFO L87 Difference]: Start difference. First operand 9211 states and 28493 transitions. Second operand 20 states. [2019-12-18 18:20:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:53,550 INFO L93 Difference]: Finished difference Result 10354 states and 31370 transitions. [2019-12-18 18:20:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 18:20:53,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 18:20:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:53,566 INFO L225 Difference]: With dead ends: 10354 [2019-12-18 18:20:53,566 INFO L226 Difference]: Without dead ends: 9276 [2019-12-18 18:20:53,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=328, Invalid=2222, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 18:20:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-12-18 18:20:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 8319. [2019-12-18 18:20:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8319 states. [2019-12-18 18:20:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8319 states to 8319 states and 25770 transitions. [2019-12-18 18:20:53,704 INFO L78 Accepts]: Start accepts. Automaton has 8319 states and 25770 transitions. Word has length 56 [2019-12-18 18:20:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:53,704 INFO L462 AbstractCegarLoop]: Abstraction has 8319 states and 25770 transitions. [2019-12-18 18:20:53,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 18:20:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8319 states and 25770 transitions. [2019-12-18 18:20:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:53,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:53,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:53,713 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash -165275111, now seen corresponding path program 10 times [2019-12-18 18:20:53,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:53,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085517211] [2019-12-18 18:20:53,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:54,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085517211] [2019-12-18 18:20:54,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:54,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:20:54,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609660757] [2019-12-18 18:20:54,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:20:54,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:54,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:20:54,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:20:54,243 INFO L87 Difference]: Start difference. First operand 8319 states and 25770 transitions. Second operand 16 states. [2019-12-18 18:20:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:57,052 INFO L93 Difference]: Finished difference Result 14142 states and 42155 transitions. [2019-12-18 18:20:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 18:20:57,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 18:20:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:57,070 INFO L225 Difference]: With dead ends: 14142 [2019-12-18 18:20:57,070 INFO L226 Difference]: Without dead ends: 11663 [2019-12-18 18:20:57,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 18:20:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11663 states. [2019-12-18 18:20:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11663 to 9429. [2019-12-18 18:20:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9429 states. [2019-12-18 18:20:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9429 states to 9429 states and 28889 transitions. [2019-12-18 18:20:57,232 INFO L78 Accepts]: Start accepts. Automaton has 9429 states and 28889 transitions. Word has length 56 [2019-12-18 18:20:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:57,233 INFO L462 AbstractCegarLoop]: Abstraction has 9429 states and 28889 transitions. [2019-12-18 18:20:57,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:20:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9429 states and 28889 transitions. [2019-12-18 18:20:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:57,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:57,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:57,243 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -852564793, now seen corresponding path program 11 times [2019-12-18 18:20:57,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:57,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988900441] [2019-12-18 18:20:57,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988900441] [2019-12-18 18:20:57,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:57,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:20:57,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311118629] [2019-12-18 18:20:57,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:20:57,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:57,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:20:57,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:20:57,432 INFO L87 Difference]: Start difference. First operand 9429 states and 28889 transitions. Second operand 10 states. [2019-12-18 18:20:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:58,478 INFO L93 Difference]: Finished difference Result 12435 states and 37597 transitions. [2019-12-18 18:20:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:20:58,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 18:20:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:58,495 INFO L225 Difference]: With dead ends: 12435 [2019-12-18 18:20:58,495 INFO L226 Difference]: Without dead ends: 9849 [2019-12-18 18:20:58,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:20:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9849 states. [2019-12-18 18:20:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9849 to 8109. [2019-12-18 18:20:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2019-12-18 18:20:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 24926 transitions. [2019-12-18 18:20:58,641 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 24926 transitions. Word has length 56 [2019-12-18 18:20:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:58,642 INFO L462 AbstractCegarLoop]: Abstraction has 8109 states and 24926 transitions. [2019-12-18 18:20:58,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:20:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 24926 transitions. [2019-12-18 18:20:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:58,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:58,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:58,651 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:58,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1725890453, now seen corresponding path program 12 times [2019-12-18 18:20:58,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:58,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293168429] [2019-12-18 18:20:58,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:58,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293168429] [2019-12-18 18:20:58,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:58,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:20:58,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656579935] [2019-12-18 18:20:58,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:20:58,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:20:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:20:58,950 INFO L87 Difference]: Start difference. First operand 8109 states and 24926 transitions. Second operand 11 states. [2019-12-18 18:20:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:59,726 INFO L93 Difference]: Finished difference Result 9611 states and 29458 transitions. [2019-12-18 18:20:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:20:59,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 18:20:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:59,741 INFO L225 Difference]: With dead ends: 9611 [2019-12-18 18:20:59,742 INFO L226 Difference]: Without dead ends: 9301 [2019-12-18 18:20:59,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:20:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9301 states. [2019-12-18 18:20:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9301 to 8613. [2019-12-18 18:20:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8613 states. [2019-12-18 18:20:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 26519 transitions. [2019-12-18 18:20:59,888 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 26519 transitions. Word has length 56 [2019-12-18 18:20:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:59,888 INFO L462 AbstractCegarLoop]: Abstraction has 8613 states and 26519 transitions. [2019-12-18 18:20:59,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:20:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 26519 transitions. [2019-12-18 18:20:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:59,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:59,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:59,898 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1540969557, now seen corresponding path program 13 times [2019-12-18 18:20:59,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:59,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405692374] [2019-12-18 18:20:59,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:21:00,202 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-12-18 18:21:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:21:00,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405692374] [2019-12-18 18:21:00,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:21:00,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:21:00,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469791324] [2019-12-18 18:21:00,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:21:00,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:21:00,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:21:00,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:21:00,276 INFO L87 Difference]: Start difference. First operand 8613 states and 26519 transitions. Second operand 11 states. [2019-12-18 18:21:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:21:00,955 INFO L93 Difference]: Finished difference Result 9489 states and 28877 transitions. [2019-12-18 18:21:00,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:21:00,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 18:21:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:21:00,969 INFO L225 Difference]: With dead ends: 9489 [2019-12-18 18:21:00,969 INFO L226 Difference]: Without dead ends: 8127 [2019-12-18 18:21:00,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:21:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states. [2019-12-18 18:21:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 7349. [2019-12-18 18:21:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7349 states. [2019-12-18 18:21:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7349 states to 7349 states and 22798 transitions. [2019-12-18 18:21:01,101 INFO L78 Accepts]: Start accepts. Automaton has 7349 states and 22798 transitions. Word has length 56 [2019-12-18 18:21:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:21:01,101 INFO L462 AbstractCegarLoop]: Abstraction has 7349 states and 22798 transitions. [2019-12-18 18:21:01,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:21:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 7349 states and 22798 transitions. [2019-12-18 18:21:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:21:01,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:21:01,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:21:01,109 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:21:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:21:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 14 times [2019-12-18 18:21:01,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:21:01,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707918516] [2019-12-18 18:21:01,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:21:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:21:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:21:01,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:21:01,242 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:21:01,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_39|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1831~0.base_39| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1831~0.base_39|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_ULTIMATE.start_main_~#t1831~0.offset_25| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_39|) |v_ULTIMATE.start_main_~#t1831~0.offset_25| 0))) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_39| 1)) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_37|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1831~0.offset=|v_ULTIMATE.start_main_~#t1831~0.offset_25|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ULTIMATE.start_main_~#t1831~0.base=|v_ULTIMATE.start_main_~#t1831~0.base_39|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1831~0.offset, ULTIMATE.start_main_~#t1833~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1832~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1832~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1833~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1831~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:21:01,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1832~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1832~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10|) |v_ULTIMATE.start_main_~#t1832~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1832~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1832~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_10|, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1832~0.offset, ULTIMATE.start_main_~#t1832~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 18:21:01,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10|) |v_ULTIMATE.start_main_~#t1833~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1833~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1833~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1833~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1833~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1833~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 18:21:01,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:21:01,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In263914806 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In263914806 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out263914806| ~x$w_buff1~0_In263914806) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out263914806| ~x~0_In263914806) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In263914806, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263914806, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In263914806, ~x~0=~x~0_In263914806} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out263914806|, ~x$w_buff1~0=~x$w_buff1~0_In263914806, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263914806, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In263914806, ~x~0=~x~0_In263914806} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:21:01,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2122487552 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In2122487552 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out2122487552|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2122487552 |P1Thread1of1ForFork0_#t~ite28_Out2122487552|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2122487552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122487552} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2122487552, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2122487552|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122487552} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:21:01,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:21:01,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-676976616 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-676976616 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-676976616 |P2Thread1of1ForFork1_#t~ite34_Out-676976616|)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-676976616| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-676976616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-676976616} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-676976616|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-676976616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-676976616} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:21:01,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1901637063 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1901637063 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1901637063 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1901637063 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1901637063| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1901637063| ~x$w_buff1_used~0_In-1901637063) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1901637063, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1901637063, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1901637063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1901637063} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1901637063, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1901637063, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1901637063, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1901637063|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1901637063} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:21:01,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2024047874 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2024047874 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In2024047874 ~x$r_buff0_thd2~0_Out2024047874) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out2024047874) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2024047874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2024047874} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2024047874|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2024047874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2024047874} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:21:01,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In343700991 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In343700991 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In343700991 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In343700991 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out343700991| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out343700991| ~x$r_buff1_thd2~0_In343700991)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In343700991, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In343700991, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In343700991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343700991} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out343700991|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In343700991, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In343700991, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In343700991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343700991} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:21:01,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 18:21:01,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-885449975 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-885449975 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-885449975 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-885449975 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-885449975|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-885449975 |P2Thread1of1ForFork1_#t~ite35_Out-885449975|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-885449975, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-885449975, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-885449975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885449975} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-885449975|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-885449975, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-885449975, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-885449975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885449975} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:21:01,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2134859135 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-2134859135 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-2134859135| ~x$r_buff0_thd3~0_In-2134859135)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-2134859135| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2134859135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134859135} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2134859135|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2134859135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134859135} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:21:01,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1306888513 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1306888513 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1306888513 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1306888513 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1306888513 256)))) (= ~x$w_buff1~0_In-1306888513 |P0Thread1of1ForFork2_#t~ite11_Out-1306888513|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1306888513| |P0Thread1of1ForFork2_#t~ite11_Out-1306888513|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-1306888513| |P0Thread1of1ForFork2_#t~ite11_Out-1306888513|) (= ~x$w_buff1~0_In-1306888513 |P0Thread1of1ForFork2_#t~ite12_Out-1306888513|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1306888513, ~x$w_buff1~0=~x$w_buff1~0_In-1306888513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1306888513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1306888513, ~weak$$choice2~0=~weak$$choice2~0_In-1306888513, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1306888513|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1306888513} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1306888513, ~x$w_buff1~0=~x$w_buff1~0_In-1306888513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1306888513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1306888513, ~weak$$choice2~0=~weak$$choice2~0_In-1306888513, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1306888513|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1306888513|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1306888513} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:21:01,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1059153923 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_Out-1059153923| |P0Thread1of1ForFork2_#t~ite15_Out-1059153923|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1059153923 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-1059153923 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1059153923 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1059153923 256)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out-1059153923| ~x$w_buff0_used~0_In-1059153923)) (and (= ~x$w_buff0_used~0_In-1059153923 |P0Thread1of1ForFork2_#t~ite15_Out-1059153923|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In-1059153923| |P0Thread1of1ForFork2_#t~ite14_Out-1059153923|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1059153923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059153923, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1059153923, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1059153923|, ~weak$$choice2~0=~weak$$choice2~0_In-1059153923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059153923} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1059153923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059153923, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1059153923|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1059153923, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1059153923|, ~weak$$choice2~0=~weak$$choice2~0_In-1059153923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059153923} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:21:01,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:21:01,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1099538416 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out1099538416| ~x$r_buff1_thd1~0_In1099538416) (= |P0Thread1of1ForFork2_#t~ite23_In1099538416| |P0Thread1of1ForFork2_#t~ite23_Out1099538416|) (not .cse0)) (and (= ~x$r_buff1_thd1~0_In1099538416 |P0Thread1of1ForFork2_#t~ite23_Out1099538416|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1099538416 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In1099538416 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1099538416 256)) (and (= (mod ~x$w_buff1_used~0_In1099538416 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite24_Out1099538416| |P0Thread1of1ForFork2_#t~ite23_Out1099538416|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1099538416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1099538416, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1099538416, ~weak$$choice2~0=~weak$$choice2~0_In1099538416, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1099538416|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1099538416} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1099538416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1099538416, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1099538416, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1099538416|, ~weak$$choice2~0=~weak$$choice2~0_In1099538416, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1099538416|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1099538416} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 18:21:01,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:21:01,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1175916679 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1175916679 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1175916679 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1175916679 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out1175916679| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1175916679| ~x$r_buff1_thd3~0_In1175916679)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1175916679, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1175916679, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1175916679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175916679} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1175916679|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1175916679, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1175916679, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1175916679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175916679} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:21:01,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:21:01,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:21:01,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1472595339 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite41_Out1472595339| |ULTIMATE.start_main_#t~ite42_Out1472595339|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1472595339 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1472595339| ~x~0_In1472595339) .cse0 (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite41_Out1472595339| ~x$w_buff1~0_In1472595339) (not .cse1) .cse0 (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1472595339, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1472595339, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1472595339, ~x~0=~x~0_In1472595339} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1472595339|, ~x$w_buff1~0=~x$w_buff1~0_In1472595339, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1472595339, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1472595339, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1472595339|, ~x~0=~x~0_In1472595339} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:21:01,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-610454571 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-610454571 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-610454571| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-610454571| ~x$w_buff0_used~0_In-610454571) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-610454571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-610454571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-610454571, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-610454571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-610454571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:21:01,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In2133099230 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In2133099230 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2133099230 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2133099230 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2133099230 |ULTIMATE.start_main_#t~ite44_Out2133099230|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out2133099230|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133099230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133099230, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2133099230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133099230} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133099230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133099230, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2133099230, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2133099230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133099230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:21:01,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In684878334 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In684878334 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out684878334|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In684878334 |ULTIMATE.start_main_#t~ite45_Out684878334|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In684878334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684878334} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In684878334, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out684878334|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684878334} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:21:01,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1143296955 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1143296955 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1143296955 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1143296955 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1143296955| ~x$r_buff1_thd0~0_In-1143296955) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out-1143296955| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1143296955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1143296955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1143296955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1143296955} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1143296955, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1143296955|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1143296955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1143296955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1143296955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:21:01,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:21:01,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:21:01 BasicIcfg [2019-12-18 18:21:01,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:21:01,381 INFO L168 Benchmark]: Toolchain (without parser) took 93559.74 ms. Allocated memory was 138.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 101.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 857.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:21:01,385 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 18:21:01,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.11 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 154.0 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:21:01,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.33 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 151.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:21:01,386 INFO L168 Benchmark]: Boogie Preprocessor took 42.30 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:21:01,386 INFO L168 Benchmark]: RCFGBuilder took 804.14 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 102.8 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:21:01,387 INFO L168 Benchmark]: TraceAbstraction took 91782.82 ms. Allocated memory was 202.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 793.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:21:01,390 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.66 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 855.11 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 154.0 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.33 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 151.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.30 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 804.14 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 102.8 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91782.82 ms. Allocated memory was 202.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 793.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1831, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1832, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1833, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 91.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 50.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5397 SDtfs, 9614 SDslu, 25374 SDs, 0 SdLazy, 30724 SolverSat, 674 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 29 SyntacticMatches, 29 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 82769 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1410 NumberOfCodeBlocks, 1410 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 493681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...