/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/mix055_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:54:24,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:54:24,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:54:24,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:54:24,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:54:24,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:54:24,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:54:24,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:54:24,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:54:24,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:54:24,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:54:24,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:54:24,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:54:24,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:54:24,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:54:24,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:54:24,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:54:24,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:54:24,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:54:24,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:54:24,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:54:24,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:54:24,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:54:24,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:54:24,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:54:24,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:54:24,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:54:24,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:54:24,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:54:24,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:54:24,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:54:24,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:54:24,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:54:24,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:54:24,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:54:24,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:54:24,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:54:24,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:54:24,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:54:24,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:54:24,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:54:24,654 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-27 06:54:24,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:54:24,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:54:24,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:54:24,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:54:24,670 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:54:24,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:54:24,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:54:24,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:54:24,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:54:24,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:54:24,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:54:24,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:54:24,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:54:24,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:54:24,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:54:24,672 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:54:24,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:54:24,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:54:24,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:54:24,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:54:24,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:54:24,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:54:24,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:54:24,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:54:24,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:54:24,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:54:24,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:54:24,675 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:54:24,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:54:24,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:54:24,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:54:24,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:54:24,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:54:24,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:54:24,968 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:54:24,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-27 06:54:25,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ccdeb09/9f56372a34e748be9314150e8f174d11/FLAG927df7f98 [2019-12-27 06:54:25,612 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:54:25,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-27 06:54:25,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ccdeb09/9f56372a34e748be9314150e8f174d11/FLAG927df7f98 [2019-12-27 06:54:25,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ccdeb09/9f56372a34e748be9314150e8f174d11 [2019-12-27 06:54:25,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:54:25,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:54:25,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:25,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:54:25,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:54:25,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:25" (1/1) ... [2019-12-27 06:54:25,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e917af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:25, skipping insertion in model container [2019-12-27 06:54:25,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:25" (1/1) ... [2019-12-27 06:54:25,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:54:25,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:54:26,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:26,537 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:54:26,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:26,691 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:54:26,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26 WrapperNode [2019-12-27 06:54:26,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:26,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:26,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:54:26,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:54:26,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:26,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:54:26,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:54:26,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:54:26,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (1/1) ... [2019-12-27 06:54:26,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:54:26,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:54:26,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:54:26,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:54:26,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (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-27 06:54:26,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:54:26,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:54:26,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:54:26,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:54:26,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:54:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:54:26,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:54:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:54:26,870 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:54:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:54:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:54:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:54:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:54:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:54:26,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:54:26,873 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:54:27,565 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:54:27,566 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:54:27,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:27 BoogieIcfgContainer [2019-12-27 06:54:27,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:54:27,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:54:27,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:54:27,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:54:27,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:25" (1/3) ... [2019-12-27 06:54:27,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4473c92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:27, skipping insertion in model container [2019-12-27 06:54:27,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:26" (2/3) ... [2019-12-27 06:54:27,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4473c92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:27, skipping insertion in model container [2019-12-27 06:54:27,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:27" (3/3) ... [2019-12-27 06:54:27,577 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2019-12-27 06:54:27,587 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:54:27,588 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:54:27,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:54:27,597 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:54:27,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,659 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,659 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,659 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,660 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,660 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,696 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,696 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,701 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,701 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,703 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:27,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:54:27,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:54:27,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:54:27,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:54:27,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:54:27,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:54:27,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:54:27,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:54:27,741 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:54:27,756 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-27 06:54:27,757 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 06:54:27,855 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 06:54:27,855 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:27,870 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:54:27,891 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 06:54:27,967 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 06:54:27,968 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:27,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:54:27,995 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:54:27,996 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:54:31,481 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:54:31,628 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:54:31,646 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-27 06:54:31,646 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 06:54:31,649 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-27 06:54:33,777 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 06:54:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 06:54:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:54:33,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:33,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:33,787 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-27 06:54:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-27 06:54:33,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:33,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458932168] [2019-12-27 06:54:33,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:34,065 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-27 06:54:34,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458932168] [2019-12-27 06:54:34,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:34,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:34,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369487617] [2019-12-27 06:54:34,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:34,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:34,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:34,089 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 06:54:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:35,397 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-27 06:54:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:35,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:54:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:35,761 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 06:54:35,761 INFO L226 Difference]: Without dead ends: 33694 [2019-12-27 06:54:35,766 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-27 06:54:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-27 06:54:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-27 06:54:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-27 06:54:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-27 06:54:37,721 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-27 06:54:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:37,723 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-27 06:54:37,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-27 06:54:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:54:37,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:37,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:37,732 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-27 06:54:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-27 06:54:37,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:37,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624616521] [2019-12-27 06:54:37,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:37,893 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-27 06:54:37,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624616521] [2019-12-27 06:54:37,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:37,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:37,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778332742] [2019-12-27 06:54:37,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:37,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:37,897 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-27 06:54:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:40,326 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-27 06:54:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:40,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:54:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:40,611 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 06:54:40,611 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 06:54:40,612 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-27 06:54:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 06:54:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-27 06:54:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-27 06:54:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-27 06:54:42,839 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-27 06:54:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:42,839 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-27 06:54:42,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-27 06:54:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:54:42,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:42,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:42,844 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-27 06:54:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-27 06:54:42,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:42,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099120344] [2019-12-27 06:54:42,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:42,916 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-27 06:54:42,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099120344] [2019-12-27 06:54:42,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:42,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:42,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218260707] [2019-12-27 06:54:42,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:42,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:42,921 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-27 06:54:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:45,439 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-27 06:54:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:45,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:54:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:45,885 INFO L225 Difference]: With dead ends: 57862 [2019-12-27 06:54:45,886 INFO L226 Difference]: Without dead ends: 57862 [2019-12-27 06:54:45,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-27 06:54:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-27 06:54:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-27 06:54:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-27 06:54:47,507 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-27 06:54:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:47,508 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-27 06:54:47,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-27 06:54:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:54:47,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:47,905 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] [2019-12-27 06:54:47,905 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-27 06:54:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:47,906 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-27 06:54:47,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:47,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993803654] [2019-12-27 06:54:47,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:48,001 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-27 06:54:48,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993803654] [2019-12-27 06:54:48,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:48,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:48,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978424937] [2019-12-27 06:54:48,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:48,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:48,005 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 4 states. [2019-12-27 06:54:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:48,248 INFO L93 Difference]: Finished difference Result 41440 states and 157219 transitions. [2019-12-27 06:54:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:48,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 06:54:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:48,371 INFO L225 Difference]: With dead ends: 41440 [2019-12-27 06:54:48,371 INFO L226 Difference]: Without dead ends: 40332 [2019-12-27 06:54:48,372 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-27 06:54:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40332 states. [2019-12-27 06:54:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40332 to 40332. [2019-12-27 06:54:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40332 states. [2019-12-27 06:54:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40332 states to 40332 states and 153743 transitions. [2019-12-27 06:54:51,289 INFO L78 Accepts]: Start accepts. Automaton has 40332 states and 153743 transitions. Word has length 21 [2019-12-27 06:54:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:51,290 INFO L462 AbstractCegarLoop]: Abstraction has 40332 states and 153743 transitions. [2019-12-27 06:54:51,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 40332 states and 153743 transitions. [2019-12-27 06:54:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:54:51,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:51,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:51,299 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-27 06:54:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1960384026, now seen corresponding path program 1 times [2019-12-27 06:54:51,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:51,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532684455] [2019-12-27 06:54:51,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:51,412 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-27 06:54:51,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532684455] [2019-12-27 06:54:51,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:51,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:51,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369942204] [2019-12-27 06:54:51,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:51,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:51,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:51,414 INFO L87 Difference]: Start difference. First operand 40332 states and 153743 transitions. Second operand 5 states. [2019-12-27 06:54:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:52,102 INFO L93 Difference]: Finished difference Result 53868 states and 201666 transitions. [2019-12-27 06:54:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:54:52,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:54:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:52,639 INFO L225 Difference]: With dead ends: 53868 [2019-12-27 06:54:52,639 INFO L226 Difference]: Without dead ends: 53847 [2019-12-27 06:54:52,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:54:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53847 states. [2019-12-27 06:54:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53847 to 40578. [2019-12-27 06:54:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-12-27 06:54:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 154375 transitions. [2019-12-27 06:54:56,129 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 154375 transitions. Word has length 22 [2019-12-27 06:54:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:56,129 INFO L462 AbstractCegarLoop]: Abstraction has 40578 states and 154375 transitions. [2019-12-27 06:54:56,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 154375 transitions. [2019-12-27 06:54:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:54:56,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:56,161 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] [2019-12-27 06:54:56,161 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-27 06:54:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1903836691, now seen corresponding path program 1 times [2019-12-27 06:54:56,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:56,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086010892] [2019-12-27 06:54:56,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:56,255 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-27 06:54:56,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086010892] [2019-12-27 06:54:56,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:56,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:56,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945576000] [2019-12-27 06:54:56,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:56,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:56,259 INFO L87 Difference]: Start difference. First operand 40578 states and 154375 transitions. Second operand 3 states. [2019-12-27 06:54:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:56,504 INFO L93 Difference]: Finished difference Result 51158 states and 192741 transitions. [2019-12-27 06:54:56,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:56,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 06:54:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:56,618 INFO L225 Difference]: With dead ends: 51158 [2019-12-27 06:54:56,619 INFO L226 Difference]: Without dead ends: 51158 [2019-12-27 06:54:56,619 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-27 06:54:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2019-12-27 06:54:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 44232. [2019-12-27 06:54:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-27 06:54:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-27 06:54:57,720 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 30 [2019-12-27 06:54:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:57,720 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-27 06:54:57,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-27 06:54:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:54:57,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:57,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:57,748 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-27 06:54:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-27 06:54:57,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:57,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365194134] [2019-12-27 06:54:57,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:57,827 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-27 06:54:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365194134] [2019-12-27 06:54:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:57,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:54:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090066833] [2019-12-27 06:54:57,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:57,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:57,829 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-27 06:54:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:57,940 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-27 06:54:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:57,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 06:54:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:57,968 INFO L225 Difference]: With dead ends: 19345 [2019-12-27 06:54:57,968 INFO L226 Difference]: Without dead ends: 18469 [2019-12-27 06:54:57,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-27 06:54:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-27 06:54:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-27 06:54:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-27 06:54:58,247 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-27 06:54:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:58,247 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-27 06:54:58,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-27 06:54:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 06:54:58,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:58,258 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] [2019-12-27 06:54:58,258 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-27 06:54:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-27 06:54:58,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:58,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777330231] [2019-12-27 06:54:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:58,351 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-27 06:54:58,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777330231] [2019-12-27 06:54:58,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:58,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:58,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548271909] [2019-12-27 06:54:58,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:58,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:58,354 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-27 06:54:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:58,465 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-27 06:54:58,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:58,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 06:54:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:58,471 INFO L225 Difference]: With dead ends: 3432 [2019-12-27 06:54:58,471 INFO L226 Difference]: Without dead ends: 3063 [2019-12-27 06:54:58,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:54:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-27 06:54:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-27 06:54:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-27 06:54:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-27 06:54:58,506 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-27 06:54:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:58,506 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-27 06:54:58,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-27 06:54:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 06:54:58,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:58,510 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] [2019-12-27 06:54:58,510 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-27 06:54:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-27 06:54:58,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:58,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894419507] [2019-12-27 06:54:58,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:58,613 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-27 06:54:58,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894419507] [2019-12-27 06:54:58,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:58,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:58,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425875517] [2019-12-27 06:54:58,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:58,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:58,615 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-27 06:54:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:58,725 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-27 06:54:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:54:58,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 06:54:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:58,728 INFO L225 Difference]: With dead ends: 1341 [2019-12-27 06:54:58,729 INFO L226 Difference]: Without dead ends: 1292 [2019-12-27 06:54:58,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-27 06:54:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-27 06:54:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-27 06:54:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-27 06:54:58,742 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-27 06:54:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:58,742 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-27 06:54:58,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-27 06:54:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:58,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:58,745 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-27 06:54:58,745 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-27 06:54:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-27 06:54:58,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:58,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315221995] [2019-12-27 06:54:58,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:58,939 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-27 06:54:58,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315221995] [2019-12-27 06:54:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:58,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:54:58,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823519349] [2019-12-27 06:54:58,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:58,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:58,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:58,941 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 7 states. [2019-12-27 06:54:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:59,384 INFO L93 Difference]: Finished difference Result 1646 states and 4530 transitions. [2019-12-27 06:54:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:54:59,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 06:54:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:59,392 INFO L225 Difference]: With dead ends: 1646 [2019-12-27 06:54:59,392 INFO L226 Difference]: Without dead ends: 1646 [2019-12-27 06:54:59,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:54:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-27 06:54:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1509. [2019-12-27 06:54:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-12-27 06:54:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4178 transitions. [2019-12-27 06:54:59,409 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4178 transitions. Word has length 58 [2019-12-27 06:54:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:59,409 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 4178 transitions. [2019-12-27 06:54:59,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4178 transitions. [2019-12-27 06:54:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:59,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:59,413 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-27 06:54:59,413 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-27 06:54:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2143304257, now seen corresponding path program 2 times [2019-12-27 06:54:59,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:59,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652201647] [2019-12-27 06:54:59,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:59,538 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-27 06:54:59,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652201647] [2019-12-27 06:54:59,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:59,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:59,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351575919] [2019-12-27 06:54:59,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:59,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:59,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:59,541 INFO L87 Difference]: Start difference. First operand 1509 states and 4178 transitions. Second operand 5 states. [2019-12-27 06:54:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:59,753 INFO L93 Difference]: Finished difference Result 1998 states and 5544 transitions. [2019-12-27 06:54:59,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:54:59,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 06:54:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:59,758 INFO L225 Difference]: With dead ends: 1998 [2019-12-27 06:54:59,759 INFO L226 Difference]: Without dead ends: 1998 [2019-12-27 06:54:59,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-12-27 06:54:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1605. [2019-12-27 06:54:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-12-27 06:54:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4458 transitions. [2019-12-27 06:54:59,779 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 4458 transitions. Word has length 58 [2019-12-27 06:54:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:59,779 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 4458 transitions. [2019-12-27 06:54:59,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 4458 transitions. [2019-12-27 06:54:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:59,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:59,782 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-27 06:54:59,782 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-27 06:54:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1535525935, now seen corresponding path program 3 times [2019-12-27 06:54:59,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:59,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363413195] [2019-12-27 06:54:59,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:59,890 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-27 06:54:59,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363413195] [2019-12-27 06:54:59,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:59,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:59,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469998373] [2019-12-27 06:54:59,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:59,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:59,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:59,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:59,893 INFO L87 Difference]: Start difference. First operand 1605 states and 4458 transitions. Second operand 6 states. [2019-12-27 06:55:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:00,147 INFO L93 Difference]: Finished difference Result 2195 states and 6078 transitions. [2019-12-27 06:55:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:55:00,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:55:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:00,156 INFO L225 Difference]: With dead ends: 2195 [2019-12-27 06:55:00,156 INFO L226 Difference]: Without dead ends: 2195 [2019-12-27 06:55:00,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:55:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-27 06:55:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1549. [2019-12-27 06:55:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2019-12-27 06:55:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 4298 transitions. [2019-12-27 06:55:00,185 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 4298 transitions. Word has length 58 [2019-12-27 06:55:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:00,185 INFO L462 AbstractCegarLoop]: Abstraction has 1549 states and 4298 transitions. [2019-12-27 06:55:00,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:55:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 4298 transitions. [2019-12-27 06:55:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:55:00,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:00,189 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-27 06:55:00,189 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-27 06:55:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:00,190 INFO L82 PathProgramCache]: Analyzing trace with hash 900965748, now seen corresponding path program 1 times [2019-12-27 06:55:00,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:00,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155004163] [2019-12-27 06:55:00,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:55:00,358 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-27 06:55:00,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155004163] [2019-12-27 06:55:00,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:55:00,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:55:00,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598891619] [2019-12-27 06:55:00,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:55:00,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:55:00,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:55:00,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:55:00,361 INFO L87 Difference]: Start difference. First operand 1549 states and 4298 transitions. Second operand 10 states. [2019-12-27 06:55:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:00,705 INFO L93 Difference]: Finished difference Result 3028 states and 7766 transitions. [2019-12-27 06:55:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:55:00,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 06:55:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:00,709 INFO L225 Difference]: With dead ends: 3028 [2019-12-27 06:55:00,710 INFO L226 Difference]: Without dead ends: 2079 [2019-12-27 06:55:00,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:55:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-12-27 06:55:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1403. [2019-12-27 06:55:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2019-12-27 06:55:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 3804 transitions. [2019-12-27 06:55:00,741 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 3804 transitions. Word has length 59 [2019-12-27 06:55:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:00,741 INFO L462 AbstractCegarLoop]: Abstraction has 1403 states and 3804 transitions. [2019-12-27 06:55:00,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:55:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 3804 transitions. [2019-12-27 06:55:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:55:00,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:00,745 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-27 06:55:00,746 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-27 06:55:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -746332050, now seen corresponding path program 2 times [2019-12-27 06:55:00,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:00,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836521309] [2019-12-27 06:55:00,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:55:00,973 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-27 06:55:00,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836521309] [2019-12-27 06:55:00,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:55:00,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:55:00,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177796083] [2019-12-27 06:55:00,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:55:00,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:55:00,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:55:00,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:55:00,975 INFO L87 Difference]: Start difference. First operand 1403 states and 3804 transitions. Second operand 12 states. [2019-12-27 06:55:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:01,745 INFO L93 Difference]: Finished difference Result 3345 states and 8394 transitions. [2019-12-27 06:55:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:55:01,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 06:55:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:01,748 INFO L225 Difference]: With dead ends: 3345 [2019-12-27 06:55:01,748 INFO L226 Difference]: Without dead ends: 1099 [2019-12-27 06:55:01,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-27 06:55:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-12-27 06:55:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 763. [2019-12-27 06:55:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-12-27 06:55:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1672 transitions. [2019-12-27 06:55:01,759 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1672 transitions. Word has length 59 [2019-12-27 06:55:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:01,759 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1672 transitions. [2019-12-27 06:55:01,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:55:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1672 transitions. [2019-12-27 06:55:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:55:01,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:01,761 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-27 06:55:01,761 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-27 06:55:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1701575344, now seen corresponding path program 3 times [2019-12-27 06:55:01,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:01,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684487739] [2019-12-27 06:55:01,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:55:01,834 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-27 06:55:01,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684487739] [2019-12-27 06:55:01,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:55:01,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:55:01,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108741903] [2019-12-27 06:55:01,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:55:01,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:55:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:55:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:55:01,836 INFO L87 Difference]: Start difference. First operand 763 states and 1672 transitions. Second operand 3 states. [2019-12-27 06:55:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:01,876 INFO L93 Difference]: Finished difference Result 762 states and 1670 transitions. [2019-12-27 06:55:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:55:01,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:55:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:01,878 INFO L225 Difference]: With dead ends: 762 [2019-12-27 06:55:01,878 INFO L226 Difference]: Without dead ends: 762 [2019-12-27 06:55:01,878 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-27 06:55:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-12-27 06:55:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 597. [2019-12-27 06:55:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 06:55:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1294 transitions. [2019-12-27 06:55:01,890 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1294 transitions. Word has length 59 [2019-12-27 06:55:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:01,890 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1294 transitions. [2019-12-27 06:55:01,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:55:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1294 transitions. [2019-12-27 06:55:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:55:01,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:01,892 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-27 06:55:01,892 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-27 06:55:01,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash 138522323, now seen corresponding path program 1 times [2019-12-27 06:55:01,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:01,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368027337] [2019-12-27 06:55:01,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:55:02,037 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-27 06:55:02,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368027337] [2019-12-27 06:55:02,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:55:02,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:55:02,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727519258] [2019-12-27 06:55:02,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:55:02,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:55:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:55:02,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:55:02,039 INFO L87 Difference]: Start difference. First operand 597 states and 1294 transitions. Second operand 6 states. [2019-12-27 06:55:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:02,117 INFO L93 Difference]: Finished difference Result 871 states and 1829 transitions. [2019-12-27 06:55:02,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:55:02,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 06:55:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:02,118 INFO L225 Difference]: With dead ends: 871 [2019-12-27 06:55:02,119 INFO L226 Difference]: Without dead ends: 265 [2019-12-27 06:55:02,119 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-27 06:55:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-27 06:55:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 233. [2019-12-27 06:55:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-27 06:55:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 402 transitions. [2019-12-27 06:55:02,123 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 402 transitions. Word has length 59 [2019-12-27 06:55:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:02,123 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 402 transitions. [2019-12-27 06:55:02,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:55:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 402 transitions. [2019-12-27 06:55:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:55:02,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:02,124 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-27 06:55:02,124 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-27 06:55:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash -911728955, now seen corresponding path program 2 times [2019-12-27 06:55:02,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:02,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434762342] [2019-12-27 06:55:02,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:55:02,195 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-27 06:55:02,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434762342] [2019-12-27 06:55:02,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:55:02,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:55:02,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231921689] [2019-12-27 06:55:02,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:55:02,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:55:02,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:55:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:55:02,197 INFO L87 Difference]: Start difference. First operand 233 states and 402 transitions. Second operand 3 states. [2019-12-27 06:55:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:02,206 INFO L93 Difference]: Finished difference Result 214 states and 362 transitions. [2019-12-27 06:55:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:55:02,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:55:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:02,207 INFO L225 Difference]: With dead ends: 214 [2019-12-27 06:55:02,207 INFO L226 Difference]: Without dead ends: 214 [2019-12-27 06:55:02,208 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-27 06:55:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-27 06:55:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-12-27 06:55:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-27 06:55:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 362 transitions. [2019-12-27 06:55:02,210 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 362 transitions. Word has length 59 [2019-12-27 06:55:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:02,211 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 362 transitions. [2019-12-27 06:55:02,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:55:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 362 transitions. [2019-12-27 06:55:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:55:02,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:02,212 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-27 06:55:02,212 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-27 06:55:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 1 times [2019-12-27 06:55:02,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:02,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808073019] [2019-12-27 06:55:02,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:55:02,520 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-27 06:55:02,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808073019] [2019-12-27 06:55:02,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:55:02,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:55:02,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860690404] [2019-12-27 06:55:02,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:55:02,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:55:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:55:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:55:02,523 INFO L87 Difference]: Start difference. First operand 214 states and 362 transitions. Second operand 15 states. [2019-12-27 06:55:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:55:03,079 INFO L93 Difference]: Finished difference Result 372 states and 620 transitions. [2019-12-27 06:55:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:55:03,080 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 06:55:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:55:03,081 INFO L225 Difference]: With dead ends: 372 [2019-12-27 06:55:03,081 INFO L226 Difference]: Without dead ends: 340 [2019-12-27 06:55:03,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:55:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-27 06:55:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2019-12-27 06:55:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:55:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 547 transitions. [2019-12-27 06:55:03,087 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 547 transitions. Word has length 60 [2019-12-27 06:55:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:55:03,087 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 547 transitions. [2019-12-27 06:55:03,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:55:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2019-12-27 06:55:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:55:03,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:55:03,088 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-27 06:55:03,088 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-27 06:55:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:55:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 2 times [2019-12-27 06:55:03,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:55:03,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542739127] [2019-12-27 06:55:03,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:55:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:55:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:55:03,277 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:55:03,278 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:55:03,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= (select .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1469~0.base_22| 4)) (= 0 |v_ULTIMATE.start_main_~#t1469~0.offset_17|) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1469~0.base_22|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22| 1)) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1469~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1469~0.base_22|) |v_ULTIMATE.start_main_~#t1469~0.offset_17| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1470~0.offset=|v_ULTIMATE.start_main_~#t1470~0.offset_18|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1470~0.base=|v_ULTIMATE.start_main_~#t1470~0.base_23|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_~#t1472~0.base=|v_ULTIMATE.start_main_~#t1472~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, 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_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_~#t1469~0.base=|v_ULTIMATE.start_main_~#t1469~0.base_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_~#t1472~0.offset=|v_ULTIMATE.start_main_~#t1472~0.offset_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_~#t1471~0.offset=|v_ULTIMATE.start_main_~#t1471~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1469~0.offset=|v_ULTIMATE.start_main_~#t1469~0.offset_17|, 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_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1470~0.offset, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1470~0.base, ~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, ~__unbuffered_p1_EAX~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_#t~ite37, ULTIMATE.start_main_~#t1471~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1472~0.base, ~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_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~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_~#t1469~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1472~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1471~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1469~0.offset, 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-27 06:55:03,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1470~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1470~0.offset_11| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1470~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1470~0.base_13|) |v_ULTIMATE.start_main_~#t1470~0.offset_11| 1)) |v_#memory_int_19|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1470~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1470~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1470~0.base_13| 0)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1470~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1470~0.offset=|v_ULTIMATE.start_main_~#t1470~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1470~0.base=|v_ULTIMATE.start_main_~#t1470~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1470~0.offset, ULTIMATE.start_main_~#t1470~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:55:03,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1471~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1471~0.base_10|) |v_ULTIMATE.start_main_~#t1471~0.offset_10| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1471~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1471~0.base_10|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1471~0.base_10| 1) |v_#valid_40|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1471~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1471~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1471~0.base_10| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1471~0.offset=|v_ULTIMATE.start_main_~#t1471~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1471~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1471~0.base] because there is no mapped edge [2019-12-27 06:55:03,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1472~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1472~0.offset_10| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1472~0.base_11| 1) |v_#valid_44|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1472~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1472~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1472~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1472~0.base_11|) |v_ULTIMATE.start_main_~#t1472~0.offset_10| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1472~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1472~0.base=|v_ULTIMATE.start_main_~#t1472~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1472~0.offset=|v_ULTIMATE.start_main_~#t1472~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1472~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1472~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 06:55:03,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (= ~z$r_buff0_thd1~0_In2035886476 ~z$r_buff1_thd1~0_Out2035886476) (= ~z$r_buff0_thd4~0_In2035886476 ~z$r_buff1_thd4~0_Out2035886476) (= 1 ~z$r_buff0_thd4~0_Out2035886476) (= ~z$r_buff0_thd2~0_In2035886476 ~z$r_buff1_thd2~0_Out2035886476) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In2035886476)) (= ~z$r_buff1_thd3~0_Out2035886476 ~z$r_buff0_thd3~0_In2035886476) (= ~__unbuffered_p3_EAX~0_Out2035886476 ~a~0_In2035886476) (= ~z$r_buff1_thd0~0_Out2035886476 ~z$r_buff0_thd0~0_In2035886476)) InVars {~a~0=~a~0_In2035886476, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In2035886476, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2035886476, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2035886476, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2035886476, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2035886476, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2035886476} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In2035886476, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out2035886476, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out2035886476, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out2035886476, ~a~0=~a~0_In2035886476, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2035886476, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2035886476, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out2035886476, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out2035886476, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2035886476, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2035886476, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2035886476, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2035886476} AuxVars[] AssignedVars[~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] because there is no mapped edge [2019-12-27 06:55:03,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= 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_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, 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_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:55:03,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:55:03,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1863774295 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1863774295 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1863774295| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1863774295| ~z$w_buff0_used~0_In-1863774295)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1863774295, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1863774295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1863774295, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1863774295, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1863774295|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:55:03,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1655698024 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1655698024 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out1655698024| ~z$w_buff1~0_In1655698024) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out1655698024| ~z~0_In1655698024) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1655698024, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1655698024, ~z$w_buff1~0=~z$w_buff1~0_In1655698024, ~z~0=~z~0_In1655698024} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1655698024|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1655698024, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1655698024, ~z$w_buff1~0=~z$w_buff1~0_In1655698024, ~z~0=~z~0_In1655698024} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:55:03,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |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_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:55:03,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-672379213 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-672379213 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-672379213 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-672379213 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-672379213|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-672379213 |P3Thread1of1ForFork3_#t~ite12_Out-672379213|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-672379213, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-672379213, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-672379213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-672379213} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-672379213, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-672379213, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-672379213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-672379213, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-672379213|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:55:03,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1736792597 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1736792597 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out1736792597 ~z$r_buff0_thd4~0_In1736792597) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out1736792597 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1736792597, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1736792597} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1736792597, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1736792597, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1736792597|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:55:03,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-234279052 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-234279052 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-234279052 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-234279052 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-234279052| ~z$r_buff1_thd4~0_In-234279052)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-234279052| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-234279052, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-234279052, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-234279052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-234279052} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-234279052, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-234279052, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-234279052|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-234279052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-234279052} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:55:03,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) 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_16, 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-27 06:55:03,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1926123860 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1926123860 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1926123860|)) (and (= ~z$w_buff0_used~0_In-1926123860 |P2Thread1of1ForFork2_#t~ite5_Out-1926123860|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1926123860, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1926123860} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1926123860|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1926123860, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1926123860} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:55:03,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In710098733 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In710098733 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In710098733 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In710098733 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In710098733 |P2Thread1of1ForFork2_#t~ite6_Out710098733|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out710098733|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In710098733, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In710098733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710098733, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In710098733} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out710098733|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710098733, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In710098733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710098733, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In710098733} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:55:03,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2097289717 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2097289717 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-2097289717| ~z$r_buff0_thd3~0_In-2097289717)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-2097289717| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2097289717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2097289717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2097289717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2097289717, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-2097289717|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:55:03,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1847602390 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1847602390 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1847602390 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1847602390 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out1847602390|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1847602390 |P2Thread1of1ForFork2_#t~ite8_Out1847602390|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1847602390, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1847602390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1847602390, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1847602390} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1847602390, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1847602390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1847602390, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1847602390, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1847602390|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:55:03,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, 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-27 06:55:03,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:55:03,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In397185241 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In397185241 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out397185241| ~z$w_buff1~0_In397185241) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out397185241| ~z~0_In397185241) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In397185241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In397185241, ~z$w_buff1~0=~z$w_buff1~0_In397185241, ~z~0=~z~0_In397185241} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out397185241|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In397185241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In397185241, ~z$w_buff1~0=~z$w_buff1~0_In397185241, ~z~0=~z~0_In397185241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:55:03,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:55:03,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-802282926 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-802282926 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-802282926|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-802282926| ~z$w_buff0_used~0_In-802282926)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-802282926, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-802282926} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-802282926, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-802282926, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-802282926|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:55:03,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-291441873 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-291441873 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-291441873 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-291441873 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-291441873| 0)) (and (= ~z$w_buff1_used~0_In-291441873 |ULTIMATE.start_main_#t~ite22_Out-291441873|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-291441873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-291441873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-291441873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-291441873} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-291441873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-291441873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-291441873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-291441873, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-291441873|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:55:03,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-16333189 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-16333189 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-16333189| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite23_Out-16333189| ~z$r_buff0_thd0~0_In-16333189) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-16333189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-16333189} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-16333189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-16333189, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-16333189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:55:03,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1399937583 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1399937583 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1399937583 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1399937583 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1399937583|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-1399937583 |ULTIMATE.start_main_#t~ite24_Out-1399937583|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1399937583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1399937583, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1399937583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1399937583} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1399937583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1399937583, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1399937583, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1399937583|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1399937583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:55:03,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1884227495 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out1884227495| ~z$w_buff1~0_In1884227495) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In1884227495| |ULTIMATE.start_main_#t~ite33_Out1884227495|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1884227495 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1884227495 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In1884227495 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1884227495 256) 0))) (= |ULTIMATE.start_main_#t~ite33_Out1884227495| ~z$w_buff1~0_In1884227495) (= |ULTIMATE.start_main_#t~ite33_Out1884227495| |ULTIMATE.start_main_#t~ite34_Out1884227495|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1884227495, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1884227495, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1884227495, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1884227495, ~z$w_buff1~0=~z$w_buff1~0_In1884227495, ~weak$$choice2~0=~weak$$choice2~0_In1884227495, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1884227495|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1884227495, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1884227495, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1884227495, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1884227495, ~z$w_buff1~0=~z$w_buff1~0_In1884227495, ~weak$$choice2~0=~weak$$choice2~0_In1884227495, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1884227495|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1884227495|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 06:55:03,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In756329126 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_In756329126| |ULTIMATE.start_main_#t~ite39_Out756329126|) (= ~z$w_buff1_used~0_In756329126 |ULTIMATE.start_main_#t~ite40_Out756329126|) (not .cse0)) (and (= ~z$w_buff1_used~0_In756329126 |ULTIMATE.start_main_#t~ite39_Out756329126|) (= |ULTIMATE.start_main_#t~ite39_Out756329126| |ULTIMATE.start_main_#t~ite40_Out756329126|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In756329126 256) 0))) (or (= (mod ~z$w_buff0_used~0_In756329126 256) 0) (and (= (mod ~z$w_buff1_used~0_In756329126 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd0~0_In756329126 256)) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In756329126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In756329126, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In756329126|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In756329126, ~z$w_buff1_used~0=~z$w_buff1_used~0_In756329126, ~weak$$choice2~0=~weak$$choice2~0_In756329126} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In756329126, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out756329126|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out756329126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In756329126, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In756329126, ~z$w_buff1_used~0=~z$w_buff1_used~0_In756329126, ~weak$$choice2~0=~weak$$choice2~0_In756329126} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:55:03,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} 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-27 06:55:03,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite45_Out-145712594| |ULTIMATE.start_main_#t~ite46_Out-145712594|)) (.cse3 (= (mod ~z$w_buff1_used~0_In-145712594 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-145712594 256) 0)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-145712594 256))) (.cse5 (= (mod ~z$r_buff1_thd0~0_In-145712594 256) 0)) (.cse4 (= 0 (mod ~z$r_buff0_thd0~0_In-145712594 256)))) (or (and (or (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out-145712594| ~z$r_buff1_thd0~0_In-145712594) .cse1 (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4))) (and (= |ULTIMATE.start_main_#t~ite46_Out-145712594| ~z$r_buff1_thd0~0_In-145712594) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_In-145712594| |ULTIMATE.start_main_#t~ite45_Out-145712594|))) (= |ULTIMATE.start_main_#t~ite44_In-145712594| |ULTIMATE.start_main_#t~ite44_Out-145712594|)) (let ((.cse6 (not .cse4))) (and .cse0 (or .cse6 (not .cse3)) (not .cse2) .cse1 (= 0 |ULTIMATE.start_main_#t~ite44_Out-145712594|) (or .cse6 (not .cse5)) (= |ULTIMATE.start_main_#t~ite45_Out-145712594| |ULTIMATE.start_main_#t~ite44_Out-145712594|))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-145712594, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-145712594, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-145712594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-145712594, ~weak$$choice2~0=~weak$$choice2~0_In-145712594, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-145712594|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-145712594|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-145712594, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-145712594, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-145712594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-145712594, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-145712594|, ~weak$$choice2~0=~weak$$choice2~0_In-145712594, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-145712594|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-145712594|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:55:03,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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-27 06:55:03,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:55:03,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:55:03 BasicIcfg [2019-12-27 06:55:03,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:55:03,456 INFO L168 Benchmark]: Toolchain (without parser) took 37553.54 ms. Allocated memory was 145.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 572.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:55:03,458 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:55:03,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.56 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:55:03,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:55:03,460 INFO L168 Benchmark]: Boogie Preprocessor took 38.53 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:55:03,462 INFO L168 Benchmark]: RCFGBuilder took 769.40 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 101.7 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:55:03,463 INFO L168 Benchmark]: TraceAbstraction took 35883.86 ms. Allocated memory was 202.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 101.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 514.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:55:03,471 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.49 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.56 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.2 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.53 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.40 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 101.7 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35883.86 ms. Allocated memory was 202.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 101.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 514.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L825] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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] [L827] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L829] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L800] 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) [L770] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 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 [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 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 [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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] [L846] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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] [L846] 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) [L847] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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] [L847] 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)) [L848] 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)) [L849] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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] [L849] 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)) [L850] 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)) [L852] 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)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2134 SDtfs, 2783 SDslu, 5192 SDs, 0 SdLazy, 2292 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 31 SyntacticMatches, 15 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51558occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 34494 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 727 ConstructedInterpolants, 0 QuantifiedInterpolants, 159621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...