/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:34:47,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:34:47,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:34:47,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:34:47,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:34:47,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:34:47,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:34:47,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:34:47,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:34:47,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:34:47,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:34:47,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:34:47,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:34:47,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:34:47,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:34:47,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:34:47,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:34:47,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:34:47,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:34:47,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:34:47,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:34:47,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:34:47,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:34:47,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:34:47,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:34:47,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:34:47,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:34:47,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:34:47,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:34:47,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:34:47,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:34:47,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:34:47,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:34:47,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:34:47,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:34:47,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:34:47,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:34:47,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:34:47,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:34:47,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:34:47,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:34:47,645 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-VariableLbe.epf [2019-12-18 21:34:47,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:34:47,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:34:47,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:34:47,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:34:47,662 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:34:47,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:34:47,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:34:47,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:34:47,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:34:47,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:34:47,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:34:47,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:34:47,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:34:47,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:34:47,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:34:47,664 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:34:47,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:34:47,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:34:47,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:34:47,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:34:47,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:34:47,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:34:47,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:34:47,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:34:47,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:34:47,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:34:47,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:34:47,666 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:34:47,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:34:47,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:34:47,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:34:47,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:34:47,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:34:47,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:34:47,965 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:34:47,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-18 21:34:48,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edc5ba86/1ce8d1f7856b495981051f92a79de660/FLAG93ba23938 [2019-12-18 21:34:48,674 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:34:48,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-18 21:34:48,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edc5ba86/1ce8d1f7856b495981051f92a79de660/FLAG93ba23938 [2019-12-18 21:34:48,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edc5ba86/1ce8d1f7856b495981051f92a79de660 [2019-12-18 21:34:48,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:34:48,964 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:34:48,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:34:48,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:34:48,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:34:48,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:34:48" (1/1) ... [2019-12-18 21:34:48,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5739cf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:48, skipping insertion in model container [2019-12-18 21:34:48,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:34:48" (1/1) ... [2019-12-18 21:34:48,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:34:49,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:34:49,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:34:49,589 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:34:49,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:34:49,759 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:34:49,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49 WrapperNode [2019-12-18 21:34:49,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:34:49,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:34:49,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:34:49,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:34:49,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:34:49,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:34:49,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:34:49,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:34:49,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (1/1) ... [2019-12-18 21:34:49,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:34:49,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:34:49,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:34:49,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:34:49,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (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 21:34:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:34:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:34:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:34:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:34:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:34:49,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:34:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:34:49,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:34:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:34:49,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:34:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:34:49,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:34:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:34:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:34:49,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:34:49,950 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 21:34:50,694 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:34:50,695 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:34:50,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:34:50 BoogieIcfgContainer [2019-12-18 21:34:50,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:34:50,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:34:50,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:34:50,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:34:50,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:34:48" (1/3) ... [2019-12-18 21:34:50,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a59d225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:34:50, skipping insertion in model container [2019-12-18 21:34:50,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:49" (2/3) ... [2019-12-18 21:34:50,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a59d225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:34:50, skipping insertion in model container [2019-12-18 21:34:50,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:34:50" (3/3) ... [2019-12-18 21:34:50,705 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2019-12-18 21:34:50,715 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:34:50,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:34:50,722 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:34:50,723 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:34:50,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,772 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,772 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,783 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,783 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,791 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,819 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,819 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,821 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:50,836 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:34:50,858 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:34:50,858 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:34:50,858 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:34:50,859 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:34:50,859 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:34:50,859 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:34:50,859 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:34:50,859 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:34:50,882 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 21:34:50,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:34:50,972 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:34:50,972 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:34:50,990 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:34:51,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:34:51,058 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:34:51,059 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:34:51,067 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:34:51,083 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:34:51,084 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:34:54,704 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:34:54,840 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:34:54,890 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-18 21:34:54,890 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:34:54,893 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-18 21:34:58,023 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-18 21:34:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-18 21:34:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:34:58,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:58,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:58,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-18 21:34:58,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:58,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521561103] [2019-12-18 21:34:58,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:58,337 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 21:34:58,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521561103] [2019-12-18 21:34:58,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:58,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:34:58,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634328417] [2019-12-18 21:34:58,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:58,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:58,358 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-18 21:34:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:59,211 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-18 21:34:59,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:59,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:34:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:59,615 INFO L225 Difference]: With dead ends: 36046 [2019-12-18 21:34:59,615 INFO L226 Difference]: Without dead ends: 35318 [2019-12-18 21:34:59,616 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 21:35:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-18 21:35:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-18 21:35:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-18 21:35:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-18 21:35:02,683 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-18 21:35:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:02,685 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-18 21:35:02,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:35:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-18 21:35:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:35:02,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:02,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:35:02,702 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-18 21:35:02,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:02,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112071947] [2019-12-18 21:35:02,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:02,824 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 21:35:02,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112071947] [2019-12-18 21:35:02,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:02,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:35:02,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481268318] [2019-12-18 21:35:02,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:35:02,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:35:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:35:02,829 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 4 states. [2019-12-18 21:35:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:05,218 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-18 21:35:05,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:35:05,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:35:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:05,567 INFO L225 Difference]: With dead ends: 54990 [2019-12-18 21:35:05,567 INFO L226 Difference]: Without dead ends: 54962 [2019-12-18 21:35:05,568 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 21:35:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-18 21:35:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-18 21:35:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-18 21:35:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-18 21:35:07,789 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-18 21:35:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:07,789 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-18 21:35:07,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:35:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-18 21:35:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:35:07,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:07,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:35:07,793 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-18 21:35:07,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:07,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170137883] [2019-12-18 21:35:07,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:07,848 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 21:35:07,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170137883] [2019-12-18 21:35:07,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:07,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:35:07,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579654666] [2019-12-18 21:35:07,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:35:07,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:35:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:35:07,853 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-18 21:35:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:08,018 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-18 21:35:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:35:08,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:35:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:08,195 INFO L225 Difference]: With dead ends: 39218 [2019-12-18 21:35:08,195 INFO L226 Difference]: Without dead ends: 39218 [2019-12-18 21:35:08,196 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 21:35:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-18 21:35:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-18 21:35:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-18 21:35:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-18 21:35:11,316 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-18 21:35:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:11,316 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-18 21:35:11,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:35:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-18 21:35:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:35:11,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:11,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:35:11,319 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-18 21:35:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750578135] [2019-12-18 21:35:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:11,372 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 21:35:11,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750578135] [2019-12-18 21:35:11,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:11,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:35:11,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754235199] [2019-12-18 21:35:11,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:35:11,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:35:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:35:11,374 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 4 states. [2019-12-18 21:35:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:11,461 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-18 21:35:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:35:11,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:35:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:11,509 INFO L225 Difference]: With dead ends: 16304 [2019-12-18 21:35:11,510 INFO L226 Difference]: Without dead ends: 16304 [2019-12-18 21:35:11,510 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 21:35:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-18 21:35:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-18 21:35:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-18 21:35:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-18 21:35:12,176 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-18 21:35:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:12,177 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-18 21:35:12,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:35:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-18 21:35:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:35:12,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:12,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:35:12,180 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-18 21:35:12,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:12,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165274455] [2019-12-18 21:35:12,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:12,246 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 21:35:12,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165274455] [2019-12-18 21:35:12,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:12,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:35:12,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516848094] [2019-12-18 21:35:12,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:35:12,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:35:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:35:12,248 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 5 states. [2019-12-18 21:35:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:12,301 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-18 21:35:12,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:35:12,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:35:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:12,307 INFO L225 Difference]: With dead ends: 2786 [2019-12-18 21:35:12,308 INFO L226 Difference]: Without dead ends: 2786 [2019-12-18 21:35:12,308 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 21:35:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-18 21:35:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-18 21:35:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-18 21:35:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-18 21:35:12,354 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-18 21:35:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:12,355 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-18 21:35:12,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:35:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-18 21:35:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:35:12,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:12,361 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] [2019-12-18 21:35:12,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-18 21:35:12,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:12,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874184429] [2019-12-18 21:35:12,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:12,474 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 21:35:12,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874184429] [2019-12-18 21:35:12,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:12,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:35:12,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163096314] [2019-12-18 21:35:12,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:35:12,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:35:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:12,478 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 6 states. [2019-12-18 21:35:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:12,526 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-18 21:35:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:35:12,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:35:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:12,530 INFO L225 Difference]: With dead ends: 1356 [2019-12-18 21:35:12,531 INFO L226 Difference]: Without dead ends: 1356 [2019-12-18 21:35:12,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-18 21:35:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-18 21:35:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-18 21:35:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-18 21:35:12,559 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-18 21:35:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:12,560 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-18 21:35:12,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:35:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-18 21:35:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:35:12,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:12,570 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, 1, 1] [2019-12-18 21:35:12,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-18 21:35:12,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:12,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505946603] [2019-12-18 21:35:12,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:12,690 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 21:35:12,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505946603] [2019-12-18 21:35:12,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:12,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:35:12,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866043947] [2019-12-18 21:35:12,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:35:12,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:35:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:35:12,693 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-18 21:35:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:12,737 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-18 21:35:12,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:35:12,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:35:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:12,741 INFO L225 Difference]: With dead ends: 1224 [2019-12-18 21:35:12,741 INFO L226 Difference]: Without dead ends: 1224 [2019-12-18 21:35:12,741 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 21:35:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-18 21:35:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-18 21:35:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-18 21:35:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-18 21:35:12,765 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-18 21:35:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:12,765 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-18 21:35:12,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:35:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-18 21:35:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:35:12,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:12,770 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, 1, 1] [2019-12-18 21:35:12,770 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-18 21:35:12,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:12,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561799670] [2019-12-18 21:35:12,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:12,895 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 21:35:12,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561799670] [2019-12-18 21:35:12,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:12,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:35:12,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563112066] [2019-12-18 21:35:12,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:35:12,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:12,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:35:12,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:35:12,897 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-18 21:35:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:13,097 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-18 21:35:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:35:13,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:35:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:13,101 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 21:35:13,101 INFO L226 Difference]: Without dead ends: 1760 [2019-12-18 21:35:13,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-18 21:35:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-18 21:35:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-18 21:35:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-18 21:35:13,125 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-18 21:35:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:13,125 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-18 21:35:13,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:35:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-18 21:35:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:35:13,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:13,130 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, 1, 1] [2019-12-18 21:35:13,130 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-18 21:35:13,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:13,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243134017] [2019-12-18 21:35:13,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:13,237 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 21:35:13,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243134017] [2019-12-18 21:35:13,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:13,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:35:13,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784693906] [2019-12-18 21:35:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:35:13,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:35:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:13,240 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 6 states. [2019-12-18 21:35:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:13,573 INFO L93 Difference]: Finished difference Result 2366 states and 6730 transitions. [2019-12-18 21:35:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:35:13,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:35:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:13,578 INFO L225 Difference]: With dead ends: 2366 [2019-12-18 21:35:13,579 INFO L226 Difference]: Without dead ends: 2366 [2019-12-18 21:35:13,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:35:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2019-12-18 21:35:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1499. [2019-12-18 21:35:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-18 21:35:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-18 21:35:13,604 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-18 21:35:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-18 21:35:13,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:35:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-18 21:35:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:35:13,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:13,609 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, 1, 1] [2019-12-18 21:35:13,609 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:13,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-18 21:35:13,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:13,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208452138] [2019-12-18 21:35:13,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:13,717 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 21:35:13,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208452138] [2019-12-18 21:35:13,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:13,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:35:13,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342870451] [2019-12-18 21:35:13,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:35:13,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:35:13,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:13,719 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 6 states. [2019-12-18 21:35:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:14,079 INFO L93 Difference]: Finished difference Result 2373 states and 6750 transitions. [2019-12-18 21:35:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:35:14,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:35:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:14,084 INFO L225 Difference]: With dead ends: 2373 [2019-12-18 21:35:14,084 INFO L226 Difference]: Without dead ends: 2373 [2019-12-18 21:35:14,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:35:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-12-18 21:35:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1687. [2019-12-18 21:35:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-18 21:35:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4858 transitions. [2019-12-18 21:35:14,304 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4858 transitions. Word has length 58 [2019-12-18 21:35:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:14,305 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 4858 transitions. [2019-12-18 21:35:14,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:35:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4858 transitions. [2019-12-18 21:35:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:35:14,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:14,309 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, 1, 1] [2019-12-18 21:35:14,309 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1959735343, now seen corresponding path program 4 times [2019-12-18 21:35:14,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:14,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810378582] [2019-12-18 21:35:14,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:14,464 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 21:35:14,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810378582] [2019-12-18 21:35:14,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:14,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:35:14,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212892916] [2019-12-18 21:35:14,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:35:14,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:14,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:35:14,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:35:14,467 INFO L87 Difference]: Start difference. First operand 1687 states and 4858 transitions. Second operand 8 states. [2019-12-18 21:35:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:14,895 INFO L93 Difference]: Finished difference Result 2630 states and 7482 transitions. [2019-12-18 21:35:14,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:35:14,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-18 21:35:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:14,901 INFO L225 Difference]: With dead ends: 2630 [2019-12-18 21:35:14,902 INFO L226 Difference]: Without dead ends: 2630 [2019-12-18 21:35:14,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:35:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2019-12-18 21:35:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1603. [2019-12-18 21:35:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-12-18 21:35:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 4610 transitions. [2019-12-18 21:35:14,925 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 4610 transitions. Word has length 58 [2019-12-18 21:35:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:14,926 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 4610 transitions. [2019-12-18 21:35:14,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:35:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 4610 transitions. [2019-12-18 21:35:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:35:14,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:14,930 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, 1, 1, 1] [2019-12-18 21:35:14,930 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1379010492, now seen corresponding path program 1 times [2019-12-18 21:35:14,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:14,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311641225] [2019-12-18 21:35:14,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:15,170 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 21:35:15,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311641225] [2019-12-18 21:35:15,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:15,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:35:15,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817690326] [2019-12-18 21:35:15,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:35:15,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:35:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:35:15,173 INFO L87 Difference]: Start difference. First operand 1603 states and 4610 transitions. Second operand 12 states. [2019-12-18 21:35:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:16,690 INFO L93 Difference]: Finished difference Result 4255 states and 11319 transitions. [2019-12-18 21:35:16,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 21:35:16,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 21:35:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:16,696 INFO L225 Difference]: With dead ends: 4255 [2019-12-18 21:35:16,696 INFO L226 Difference]: Without dead ends: 2558 [2019-12-18 21:35:16,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 21:35:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2019-12-18 21:35:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1473. [2019-12-18 21:35:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-12-18 21:35:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 4170 transitions. [2019-12-18 21:35:16,726 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 4170 transitions. Word has length 59 [2019-12-18 21:35:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:16,726 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 4170 transitions. [2019-12-18 21:35:16,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:35:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 4170 transitions. [2019-12-18 21:35:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:35:16,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:16,730 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, 1, 1, 1] [2019-12-18 21:35:16,730 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1795474320, now seen corresponding path program 2 times [2019-12-18 21:35:16,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:16,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501140788] [2019-12-18 21:35:16,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:16,804 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 21:35:16,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501140788] [2019-12-18 21:35:16,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:16,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:35:16,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465486597] [2019-12-18 21:35:16,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:35:16,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:35:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:35:16,807 INFO L87 Difference]: Start difference. First operand 1473 states and 4170 transitions. Second operand 3 states. [2019-12-18 21:35:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:16,853 INFO L93 Difference]: Finished difference Result 1473 states and 4169 transitions. [2019-12-18 21:35:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:35:16,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:35:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:16,856 INFO L225 Difference]: With dead ends: 1473 [2019-12-18 21:35:16,856 INFO L226 Difference]: Without dead ends: 1473 [2019-12-18 21:35:16,857 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 21:35:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-12-18 21:35:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 948. [2019-12-18 21:35:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-18 21:35:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2687 transitions. [2019-12-18 21:35:16,877 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2687 transitions. Word has length 59 [2019-12-18 21:35:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:16,878 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 2687 transitions. [2019-12-18 21:35:16,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:35:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2687 transitions. [2019-12-18 21:35:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:35:16,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:16,880 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, 1, 1, 1] [2019-12-18 21:35:16,881 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1719937123, now seen corresponding path program 1 times [2019-12-18 21:35:16,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:16,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963824390] [2019-12-18 21:35:16,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:17,068 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 21:35:17,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963824390] [2019-12-18 21:35:17,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:17,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:35:17,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378448716] [2019-12-18 21:35:17,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:35:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:35:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:17,070 INFO L87 Difference]: Start difference. First operand 948 states and 2687 transitions. Second operand 6 states. [2019-12-18 21:35:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:17,178 INFO L93 Difference]: Finished difference Result 1654 states and 4372 transitions. [2019-12-18 21:35:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:35:17,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:35:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:17,182 INFO L225 Difference]: With dead ends: 1654 [2019-12-18 21:35:17,182 INFO L226 Difference]: Without dead ends: 923 [2019-12-18 21:35:17,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:35:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-18 21:35:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 691. [2019-12-18 21:35:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-18 21:35:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1728 transitions. [2019-12-18 21:35:17,199 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1728 transitions. Word has length 59 [2019-12-18 21:35:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:17,200 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1728 transitions. [2019-12-18 21:35:17,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:35:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1728 transitions. [2019-12-18 21:35:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:35:17,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:17,208 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, 1, 1, 1] [2019-12-18 21:35:17,208 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash -5405835, now seen corresponding path program 2 times [2019-12-18 21:35:17,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:17,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089673747] [2019-12-18 21:35:17,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:17,304 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 21:35:17,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089673747] [2019-12-18 21:35:17,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:17,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:35:17,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438597020] [2019-12-18 21:35:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:35:17,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:35:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:35:17,306 INFO L87 Difference]: Start difference. First operand 691 states and 1728 transitions. Second operand 3 states. [2019-12-18 21:35:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:17,323 INFO L93 Difference]: Finished difference Result 650 states and 1574 transitions. [2019-12-18 21:35:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:35:17,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:35:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:17,324 INFO L225 Difference]: With dead ends: 650 [2019-12-18 21:35:17,325 INFO L226 Difference]: Without dead ends: 650 [2019-12-18 21:35:17,327 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 21:35:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-12-18 21:35:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 602. [2019-12-18 21:35:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-18 21:35:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1452 transitions. [2019-12-18 21:35:17,337 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1452 transitions. Word has length 59 [2019-12-18 21:35:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1452 transitions. [2019-12-18 21:35:17,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:35:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1452 transitions. [2019-12-18 21:35:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:35:17,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:17,339 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, 1, 1, 1, 1] [2019-12-18 21:35:17,339 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1587836330, now seen corresponding path program 1 times [2019-12-18 21:35:17,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:17,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322004248] [2019-12-18 21:35:17,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:17,508 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 21:35:17,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322004248] [2019-12-18 21:35:17,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:17,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:35:17,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528248120] [2019-12-18 21:35:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:35:17,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:35:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:35:17,512 INFO L87 Difference]: Start difference. First operand 602 states and 1452 transitions. Second operand 6 states. [2019-12-18 21:35:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:17,612 INFO L93 Difference]: Finished difference Result 989 states and 2339 transitions. [2019-12-18 21:35:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:35:17,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:35:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:17,613 INFO L225 Difference]: With dead ends: 989 [2019-12-18 21:35:17,613 INFO L226 Difference]: Without dead ends: 266 [2019-12-18 21:35:17,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:35:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-18 21:35:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2019-12-18 21:35:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-18 21:35:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-18 21:35:17,618 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 60 [2019-12-18 21:35:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:17,618 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-18 21:35:17,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:35:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-18 21:35:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:35:17,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:17,620 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, 1, 1, 1, 1] [2019-12-18 21:35:17,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 2 times [2019-12-18 21:35:17,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:17,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137916015] [2019-12-18 21:35:17,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:18,265 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 21:35:18,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137916015] [2019-12-18 21:35:18,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:18,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:35:18,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988839298] [2019-12-18 21:35:18,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:35:18,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:35:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:35:18,267 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 14 states. [2019-12-18 21:35:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:18,970 INFO L93 Difference]: Finished difference Result 406 states and 699 transitions. [2019-12-18 21:35:18,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:35:18,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:35:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:18,972 INFO L225 Difference]: With dead ends: 406 [2019-12-18 21:35:18,972 INFO L226 Difference]: Without dead ends: 376 [2019-12-18 21:35:18,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:35:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-18 21:35:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 330. [2019-12-18 21:35:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-18 21:35:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 577 transitions. [2019-12-18 21:35:18,976 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 577 transitions. Word has length 60 [2019-12-18 21:35:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:18,976 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 577 transitions. [2019-12-18 21:35:18,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:35:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 577 transitions. [2019-12-18 21:35:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:35:18,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:18,977 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, 1, 1, 1, 1] [2019-12-18 21:35:18,977 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2137491580, now seen corresponding path program 3 times [2019-12-18 21:35:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:18,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452330824] [2019-12-18 21:35:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:19,269 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 21:35:19,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452330824] [2019-12-18 21:35:19,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:19,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:35:19,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107305860] [2019-12-18 21:35:19,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:35:19,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:19,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:35:19,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:35:19,271 INFO L87 Difference]: Start difference. First operand 330 states and 577 transitions. Second operand 14 states. [2019-12-18 21:35:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:19,921 INFO L93 Difference]: Finished difference Result 462 states and 785 transitions. [2019-12-18 21:35:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:35:19,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:35:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:19,922 INFO L225 Difference]: With dead ends: 462 [2019-12-18 21:35:19,922 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 21:35:19,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:35:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 21:35:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 334. [2019-12-18 21:35:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-18 21:35:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 584 transitions. [2019-12-18 21:35:19,927 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 584 transitions. Word has length 60 [2019-12-18 21:35:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:19,927 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 584 transitions. [2019-12-18 21:35:19,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:35:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 584 transitions. [2019-12-18 21:35:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:35:19,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:19,929 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, 1, 1, 1, 1] [2019-12-18 21:35:19,929 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:19,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1148639144, now seen corresponding path program 4 times [2019-12-18 21:35:19,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:19,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047133274] [2019-12-18 21:35:19,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:35:20,157 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 21:35:20,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047133274] [2019-12-18 21:35:20,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:35:20,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:35:20,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244272572] [2019-12-18 21:35:20,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:35:20,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:35:20,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:35:20,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:35:20,161 INFO L87 Difference]: Start difference. First operand 334 states and 584 transitions. Second operand 12 states. [2019-12-18 21:35:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:35:20,549 INFO L93 Difference]: Finished difference Result 434 states and 734 transitions. [2019-12-18 21:35:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:35:20,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:35:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:35:20,550 INFO L225 Difference]: With dead ends: 434 [2019-12-18 21:35:20,550 INFO L226 Difference]: Without dead ends: 404 [2019-12-18 21:35:20,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:35:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-12-18 21:35:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 342. [2019-12-18 21:35:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-18 21:35:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-18 21:35:20,556 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-18 21:35:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:35:20,556 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-18 21:35:20,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:35:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-18 21:35:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:35:20,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:35:20,557 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, 1, 1, 1, 1] [2019-12-18 21:35:20,557 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:35:20,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:35:20,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 5 times [2019-12-18 21:35:20,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:35:20,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221867250] [2019-12-18 21:35:20,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:35:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:35:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:35:20,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:35:20,705 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:35:20,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21|) |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (= (store .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21| 1) |v_#valid_71|) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21|)) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= v_~z~0_27 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1269~0.base_21|) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0) (= 0 v_~z$w_buff1_used~0_66) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1269~0.base_21| 4) |v_#length_29|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_~#t1269~0.base=|v_ULTIMATE.start_main_~#t1269~0.base_21|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_18|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_~#t1269~0.offset=|v_ULTIMATE.start_main_~#t1269~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1270~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1270~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1269~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1272~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1272~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1269~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1271~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:35:20,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13| 1) |v_#valid_44|) (not (= |v_ULTIMATE.start_main_~#t1270~0.base_13| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1270~0.base_13|) (= |v_ULTIMATE.start_main_~#t1270~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13|) |v_ULTIMATE.start_main_~#t1270~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1270~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1270~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1270~0.base, #length] because there is no mapped edge [2019-12-18 21:35:20,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1271~0.offset_10| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1271~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11|) |v_ULTIMATE.start_main_~#t1271~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1271~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1271~0.offset] because there is no mapped edge [2019-12-18 21:35:20,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t1272~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1272~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1272~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13|) |v_ULTIMATE.start_main_~#t1272~0.offset_11| 3))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1272~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1272~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1272~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:35:20,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:35:20,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:35:20,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:35:20,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1206235189 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1206235189 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1206235189| ~z$w_buff0_used~0_In-1206235189) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1206235189| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1206235189, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1206235189} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1206235189, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1206235189, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1206235189|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:35:20,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1757905795 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1757905795 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1757905795 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1757905795 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1757905795|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1757905795 |P3Thread1of1ForFork3_#t~ite12_Out1757905795|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1757905795, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1757905795, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1757905795, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1757905795} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1757905795, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1757905795, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1757905795, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1757905795, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1757905795|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:35:20,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In939926019 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In939926019 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out939926019| ~z~0_In939926019) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out939926019| ~z$w_buff1~0_In939926019) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In939926019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In939926019, ~z$w_buff1~0=~z$w_buff1~0_In939926019, ~z~0=~z~0_In939926019} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out939926019|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In939926019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In939926019, ~z$w_buff1~0=~z$w_buff1~0_In939926019, ~z~0=~z~0_In939926019} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:35:20,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:35:20,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1399465077 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1399465077 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1399465077 |P2Thread1of1ForFork2_#t~ite5_Out-1399465077|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1399465077|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1399465077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1399465077} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1399465077|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1399465077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1399465077} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:35:20,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-696632486 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-696632486 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-696632486 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-696632486 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-696632486| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite6_Out-696632486| ~z$w_buff1_used~0_In-696632486)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-696632486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-696632486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-696632486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-696632486} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-696632486|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-696632486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-696632486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-696632486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-696632486} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:35:20,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1076832927 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1076832927 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1076832927|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In1076832927 |P2Thread1of1ForFork2_#t~ite7_Out1076832927|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1076832927, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1076832927} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1076832927, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1076832927, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1076832927|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:35:20,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1589985198 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1589985198 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1589985198 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1589985198 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1589985198 |P2Thread1of1ForFork2_#t~ite8_Out-1589985198|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1589985198|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1589985198, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1589985198, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1589985198, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1589985198} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1589985198, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1589985198, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1589985198, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1589985198, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1589985198|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:35:20,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:35:20,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1172291087 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1172291087 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1172291087 ~z$r_buff0_thd4~0_In1172291087)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1172291087)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1172291087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1172291087} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1172291087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1172291087, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1172291087|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:35:20,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-1192964326 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1192964326 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1192964326 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1192964326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-1192964326| 0)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-1192964326| ~z$r_buff1_thd4~0_In-1192964326) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1192964326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1192964326, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1192964326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1192964326} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1192964326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1192964326, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1192964326|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1192964326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1192964326} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:35:20,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:35:20,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:35:20,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1009018626 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1009018626 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite20_Out1009018626| |ULTIMATE.start_main_#t~ite19_Out1009018626|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In1009018626 |ULTIMATE.start_main_#t~ite19_Out1009018626|)) (and (= ~z~0_In1009018626 |ULTIMATE.start_main_#t~ite19_Out1009018626|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1009018626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009018626, ~z$w_buff1~0=~z$w_buff1~0_In1009018626, ~z~0=~z~0_In1009018626} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1009018626|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1009018626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009018626, ~z$w_buff1~0=~z$w_buff1~0_In1009018626, ~z~0=~z~0_In1009018626, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1009018626|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:35:20,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In77644708 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In77644708 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out77644708|)) (and (= ~z$w_buff0_used~0_In77644708 |ULTIMATE.start_main_#t~ite21_Out77644708|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In77644708, ~z$w_buff0_used~0=~z$w_buff0_used~0_In77644708} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In77644708, ~z$w_buff0_used~0=~z$w_buff0_used~0_In77644708, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out77644708|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:35:20,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2005438763 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2005438763 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2005438763 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2005438763 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-2005438763| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-2005438763 |ULTIMATE.start_main_#t~ite22_Out-2005438763|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2005438763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005438763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2005438763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2005438763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2005438763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005438763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2005438763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2005438763, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2005438763|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:35:20,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1430832958 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1430832958 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1430832958|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1430832958 |ULTIMATE.start_main_#t~ite23_Out-1430832958|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1430832958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1430832958} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1430832958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1430832958, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1430832958|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:35:20,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-207173768 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-207173768 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-207173768 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-207173768 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-207173768|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-207173768 |ULTIMATE.start_main_#t~ite24_Out-207173768|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-207173768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-207173768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207173768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207173768} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-207173768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-207173768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207173768, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-207173768|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207173768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:35:20,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1545635597 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out1545635597| |ULTIMATE.start_main_#t~ite30_Out1545635597|) (= |ULTIMATE.start_main_#t~ite30_Out1545635597| ~z$w_buff0~0_In1545635597) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1545635597 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1545635597 256)) (and (= (mod ~z$r_buff1_thd0~0_In1545635597 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1545635597 256) 0))))) (and (= |ULTIMATE.start_main_#t~ite30_In1545635597| |ULTIMATE.start_main_#t~ite30_Out1545635597|) (not .cse0) (= |ULTIMATE.start_main_#t~ite31_Out1545635597| ~z$w_buff0~0_In1545635597)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1545635597, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In1545635597|, ~z$w_buff0~0=~z$w_buff0~0_In1545635597, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1545635597, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1545635597, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1545635597, ~weak$$choice2~0=~weak$$choice2~0_In1545635597} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1545635597, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1545635597|, ~z$w_buff0~0=~z$w_buff0~0_In1545635597, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1545635597, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1545635597, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1545635597, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1545635597|, ~weak$$choice2~0=~weak$$choice2~0_In1545635597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 21:35:20,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1299318217 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out1299318217| |ULTIMATE.start_main_#t~ite33_Out1299318217|) (= ~z$w_buff1~0_In1299318217 |ULTIMATE.start_main_#t~ite33_Out1299318217|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1299318217 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1299318217 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In1299318217 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In1299318217 256) 0) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite33_In1299318217| |ULTIMATE.start_main_#t~ite33_Out1299318217|) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out1299318217| ~z$w_buff1~0_In1299318217)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1299318217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1299318217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1299318217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1299318217, ~z$w_buff1~0=~z$w_buff1~0_In1299318217, ~weak$$choice2~0=~weak$$choice2~0_In1299318217, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1299318217|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1299318217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1299318217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1299318217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1299318217, ~z$w_buff1~0=~z$w_buff1~0_In1299318217, ~weak$$choice2~0=~weak$$choice2~0_In1299318217, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1299318217|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1299318217|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:35:20,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:35:20,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1751553 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1751553| ~z$r_buff1_thd0~0_In-1751553) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-1751553| |ULTIMATE.start_main_#t~ite45_Out-1751553|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1751553 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1751553 256))) (= 0 (mod ~z$w_buff0_used~0_In-1751553 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1751553 256) 0)))) (= |ULTIMATE.start_main_#t~ite45_Out-1751553| ~z$r_buff1_thd0~0_In-1751553) (= |ULTIMATE.start_main_#t~ite46_Out-1751553| |ULTIMATE.start_main_#t~ite45_Out-1751553|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1751553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751553, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1751553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751553, ~weak$$choice2~0=~weak$$choice2~0_In-1751553, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1751553|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1751553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751553, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1751553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751553, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1751553|, ~weak$$choice2~0=~weak$$choice2~0_In-1751553, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1751553|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:35:20,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:35:20,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:35:20,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:35:20 BasicIcfg [2019-12-18 21:35:20,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:35:20,853 INFO L168 Benchmark]: Toolchain (without parser) took 31889.10 ms. Allocated memory was 144.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 100.4 MB in the beginning and 561.5 MB in the end (delta: -461.1 MB). Peak memory consumption was 952.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:35:20,853 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 144.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:35:20,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.66 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 154.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:35:20,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:35:20,855 INFO L168 Benchmark]: Boogie Preprocessor took 38.43 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 148.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:35:20,856 INFO L168 Benchmark]: RCFGBuilder took 827.10 ms. Allocated memory is still 201.3 MB. Free memory was 148.9 MB in the beginning and 100.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:35:20,856 INFO L168 Benchmark]: TraceAbstraction took 30152.89 ms. Allocated memory was 201.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.2 MB in the beginning and 561.5 MB in the end (delta: -462.3 MB). Peak memory consumption was 894.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:35:20,860 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.53 ms. Allocated memory is still 144.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.66 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 154.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.43 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 148.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.10 ms. Allocated memory is still 201.3 MB. Free memory was 148.9 MB in the beginning and 100.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30152.89 ms. Allocated memory was 201.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.2 MB in the beginning and 561.5 MB in the end (delta: -462.3 MB). Peak memory consumption was 894.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2079 SDtfs, 2350 SDslu, 6092 SDs, 0 SdLazy, 3508 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 37 SyntacticMatches, 17 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 10158 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 209329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...