/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/mix044_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:28:30,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:28:30,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:28:30,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:28:30,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:28:30,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:28:30,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:28:30,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:28:30,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:28:30,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:28:30,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:28:30,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:28:30,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:28:30,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:28:30,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:28:30,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:28:30,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:28:30,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:28:30,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:28:30,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:28:30,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:28:30,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:28:30,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:28:30,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:28:30,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:28:30,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:28:30,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:28:30,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:28:30,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:28:30,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:28:30,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:28:30,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:28:30,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:28:30,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:28:30,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:28:30,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:28:30,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:28:30,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:28:30,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:28:30,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:28:30,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:28:30,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:28:30,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:28:30,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:28:30,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:28:30,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:28:30,525 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:28:30,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:28:30,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:28:30,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:28:30,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:28:30,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:28:30,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:28:30,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:28:30,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:28:30,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:28:30,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:28:30,527 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:28:30,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:28:30,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:28:30,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:28:30,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:28:30,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:28:30,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:28:30,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:28:30,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:28:30,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:28:30,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:28:30,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:28:30,529 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:28:30,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:28:30,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:28:30,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:28:30,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:28:30,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:28:30,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:28:30,891 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:28:30,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-18 21:28:30,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a4bf6ae/8f2446bec7264e80bef3ed2ee3164142/FLAG4e51b659e [2019-12-18 21:28:31,536 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:28:31,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-18 21:28:31,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a4bf6ae/8f2446bec7264e80bef3ed2ee3164142/FLAG4e51b659e [2019-12-18 21:28:31,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a4bf6ae/8f2446bec7264e80bef3ed2ee3164142 [2019-12-18 21:28:31,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:28:31,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:28:31,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:28:31,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:28:31,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:28:31,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:28:31" (1/1) ... [2019-12-18 21:28:31,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e73aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:31, skipping insertion in model container [2019-12-18 21:28:31,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:28:31" (1/1) ... [2019-12-18 21:28:31,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:28:31,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:28:32,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:28:32,538 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:28:32,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:28:32,681 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:28:32,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32 WrapperNode [2019-12-18 21:28:32,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:28:32,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:28:32,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:28:32,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:28:32,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:28:32,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:28:32,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:28:32,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:28:32,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... [2019-12-18 21:28:32,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:28:32,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:28:32,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:28:32,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:28:32,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:28:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:28:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:28:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:28:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:28:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:28:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:28:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:28:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:28:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:28:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:28:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:28:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:28:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:28:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:28:32,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:28:32,898 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:28:33,686 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:28:33,687 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:28:33,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:28:33 BoogieIcfgContainer [2019-12-18 21:28:33,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:28:33,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:28:33,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:28:33,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:28:33,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:28:31" (1/3) ... [2019-12-18 21:28:33,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87147e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:28:33, skipping insertion in model container [2019-12-18 21:28:33,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:28:32" (2/3) ... [2019-12-18 21:28:33,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87147e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:28:33, skipping insertion in model container [2019-12-18 21:28:33,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:28:33" (3/3) ... [2019-12-18 21:28:33,697 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2019-12-18 21:28:33,707 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:28:33,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:28:33,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:28:33,719 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:28:33,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,790 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,790 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,805 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,809 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,809 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,811 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,812 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,813 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:28:33,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:28:33,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:28:33,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:28:33,849 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:28:33,849 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:28:33,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:28:33,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:28:33,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:28:33,850 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:28:33,875 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 21:28:33,877 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:28:33,986 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:28:33,987 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:28:34,005 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:28:34,029 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:28:34,090 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:28:34,090 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:28:34,096 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:28:34,112 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:28:34,114 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:28:37,851 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:28:37,998 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:28:38,027 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-18 21:28:38,028 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:28:38,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-18 21:28:41,125 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-18 21:28:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-18 21:28:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:28:41,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:41,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:41,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-18 21:28:41,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:41,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136464656] [2019-12-18 21:28:41,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:41,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136464656] [2019-12-18 21:28:41,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:41,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:28:41,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550771840] [2019-12-18 21:28:41,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:28:41,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:28:41,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:41,500 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-18 21:28:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:42,379 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-18 21:28:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:28:42,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:28:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:42,711 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 21:28:42,711 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 21:28:42,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 21:28:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 21:28:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 21:28:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-18 21:28:46,162 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-18 21:28:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:46,164 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-18 21:28:46,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:28:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-18 21:28:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:28:46,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:46,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:46,172 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-18 21:28:46,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:46,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152629443] [2019-12-18 21:28:46,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:46,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152629443] [2019-12-18 21:28:46,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:46,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:28:46,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73366749] [2019-12-18 21:28:46,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:28:46,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:28:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:28:46,377 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-18 21:28:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:47,721 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-18 21:28:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:28:47,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:28:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:48,043 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 21:28:48,043 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 21:28:48,044 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-18 21:28:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 21:28:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-18 21:28:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-18 21:28:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-18 21:28:52,056 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-18 21:28:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:52,057 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-18 21:28:52,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:28:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-18 21:28:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:28:52,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:52,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:52,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:52,061 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-18 21:28:52,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:52,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628980015] [2019-12-18 21:28:52,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:52,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628980015] [2019-12-18 21:28:52,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:52,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:28:52,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882563692] [2019-12-18 21:28:52,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:28:52,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:28:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:52,108 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-18 21:28:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:52,295 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-18 21:28:52,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:28:52,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:28:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:52,433 INFO L225 Difference]: With dead ends: 39280 [2019-12-18 21:28:52,433 INFO L226 Difference]: Without dead ends: 39280 [2019-12-18 21:28:52,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-18 21:28:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-18 21:28:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-18 21:28:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-18 21:28:55,704 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-18 21:28:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:55,704 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-18 21:28:55,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:28:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-18 21:28:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:28:55,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:55,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:55,708 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-18 21:28:55,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:55,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338588031] [2019-12-18 21:28:55,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:55,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338588031] [2019-12-18 21:28:55,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:55,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:28:55,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911027972] [2019-12-18 21:28:55,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:28:55,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:55,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:28:55,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:28:55,782 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-18 21:28:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:55,866 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-18 21:28:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:28:55,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:28:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:55,891 INFO L225 Difference]: With dead ends: 16344 [2019-12-18 21:28:55,891 INFO L226 Difference]: Without dead ends: 16344 [2019-12-18 21:28:55,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:28:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-18 21:28:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-18 21:28:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-18 21:28:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-18 21:28:56,252 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-18 21:28:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:56,252 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-18 21:28:56,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:28:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-18 21:28:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:28:56,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:56,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:56,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-18 21:28:56,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:56,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871651566] [2019-12-18 21:28:56,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:56,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871651566] [2019-12-18 21:28:56,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:56,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:28:56,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746393474] [2019-12-18 21:28:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:28:56,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:28:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:28:56,329 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-18 21:28:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:56,377 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-18 21:28:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:28:56,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:28:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:56,382 INFO L225 Difference]: With dead ends: 2799 [2019-12-18 21:28:56,382 INFO L226 Difference]: Without dead ends: 2799 [2019-12-18 21:28:56,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:28:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-18 21:28:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-18 21:28:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-18 21:28:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-18 21:28:56,417 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-18 21:28:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:56,417 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-18 21:28:56,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:28:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-18 21:28:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:28:56,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:56,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:56,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-18 21:28:56,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:56,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950949822] [2019-12-18 21:28:56,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:56,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950949822] [2019-12-18 21:28:56,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:56,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:56,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836950322] [2019-12-18 21:28:56,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:56,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:56,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:56,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:56,502 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-18 21:28:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:56,554 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-18 21:28:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:56,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:28:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:56,558 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 21:28:56,558 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 21:28:56,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 21:28:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 21:28:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 21:28:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-18 21:28:56,580 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-18 21:28:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:56,581 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-18 21:28:56,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-18 21:28:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:28:56,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:56,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:56,588 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-18 21:28:56,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:56,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050706395] [2019-12-18 21:28:56,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:56,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050706395] [2019-12-18 21:28:56,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:56,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:28:56,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911625363] [2019-12-18 21:28:56,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:28:56,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:28:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:56,733 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-18 21:28:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:56,778 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-18 21:28:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:28:56,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:28:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:56,781 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 21:28:56,781 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 21:28:56,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 21:28:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 21:28:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 21:28:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-18 21:28:56,797 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-18 21:28:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:56,797 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-18 21:28:56,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:28:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-18 21:28:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:28:56,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:56,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:56,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-18 21:28:56,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:56,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208518937] [2019-12-18 21:28:56,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:56,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208518937] [2019-12-18 21:28:56,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:56,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:56,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188815294] [2019-12-18 21:28:56,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:28:56,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:28:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:28:56,913 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-18 21:28:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:57,154 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-18 21:28:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:57,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:28:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:57,158 INFO L225 Difference]: With dead ends: 1763 [2019-12-18 21:28:57,158 INFO L226 Difference]: Without dead ends: 1763 [2019-12-18 21:28:57,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-18 21:28:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-18 21:28:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-18 21:28:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-18 21:28:57,184 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-18 21:28:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:57,184 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-18 21:28:57,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:28:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-18 21:28:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:28:57,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:57,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:57,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-18 21:28:57,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:57,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650268011] [2019-12-18 21:28:57,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:57,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650268011] [2019-12-18 21:28:57,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:57,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:28:57,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909288852] [2019-12-18 21:28:57,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:57,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:57,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:57,595 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-18 21:28:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:58,038 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-18 21:28:58,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:28:58,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:28:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:58,043 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 21:28:58,043 INFO L226 Difference]: Without dead ends: 2369 [2019-12-18 21:28:58,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:28:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-18 21:28:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-18 21:28:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-18 21:28:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-18 21:28:58,078 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-18 21:28:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:58,078 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-18 21:28:58,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-18 21:28:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:28:58,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:58,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:58,083 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-18 21:28:58,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:58,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284184999] [2019-12-18 21:28:58,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:58,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284184999] [2019-12-18 21:28:58,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:58,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:28:58,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681938121] [2019-12-18 21:28:58,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:28:58,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:28:58,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:58,252 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 3 states. [2019-12-18 21:28:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:58,305 INFO L93 Difference]: Finished difference Result 1501 states and 4319 transitions. [2019-12-18 21:28:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:28:58,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:28:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:58,309 INFO L225 Difference]: With dead ends: 1501 [2019-12-18 21:28:58,309 INFO L226 Difference]: Without dead ends: 1501 [2019-12-18 21:28:58,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-12-18 21:28:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1080. [2019-12-18 21:28:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-12-18 21:28:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3133 transitions. [2019-12-18 21:28:58,330 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3133 transitions. Word has length 58 [2019-12-18 21:28:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:58,330 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 3133 transitions. [2019-12-18 21:28:58,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:28:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3133 transitions. [2019-12-18 21:28:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:28:58,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:58,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:58,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 226928645, now seen corresponding path program 1 times [2019-12-18 21:28:58,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:58,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656165752] [2019-12-18 21:28:58,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:58,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656165752] [2019-12-18 21:28:58,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:58,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:28:58,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623071395] [2019-12-18 21:28:58,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:28:58,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:28:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:28:58,510 INFO L87 Difference]: Start difference. First operand 1080 states and 3133 transitions. Second operand 7 states. [2019-12-18 21:28:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:58,644 INFO L93 Difference]: Finished difference Result 2114 states and 5772 transitions. [2019-12-18 21:28:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:28:58,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 21:28:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:58,647 INFO L225 Difference]: With dead ends: 2114 [2019-12-18 21:28:58,648 INFO L226 Difference]: Without dead ends: 1444 [2019-12-18 21:28:58,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:28:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2019-12-18 21:28:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 950. [2019-12-18 21:28:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 21:28:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2693 transitions. [2019-12-18 21:28:58,666 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2693 transitions. Word has length 59 [2019-12-18 21:28:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:58,666 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2693 transitions. [2019-12-18 21:28:58,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:28:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2693 transitions. [2019-12-18 21:28:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:28:58,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:58,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:58,669 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 2 times [2019-12-18 21:28:58,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:58,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250092521] [2019-12-18 21:28:58,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:58,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250092521] [2019-12-18 21:28:58,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:58,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:28:58,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013486000] [2019-12-18 21:28:58,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:28:58,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:28:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:58,735 INFO L87 Difference]: Start difference. First operand 950 states and 2693 transitions. Second operand 3 states. [2019-12-18 21:28:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:58,749 INFO L93 Difference]: Finished difference Result 894 states and 2465 transitions. [2019-12-18 21:28:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:28:58,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:28:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:58,751 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:28:58,751 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:28:58,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:28:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 830. [2019-12-18 21:28:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-18 21:28:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2281 transitions. [2019-12-18 21:28:58,765 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2281 transitions. Word has length 59 [2019-12-18 21:28:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:58,765 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 2281 transitions. [2019-12-18 21:28:58,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:28:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2281 transitions. [2019-12-18 21:28:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:58,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:58,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:58,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash -40355053, now seen corresponding path program 1 times [2019-12-18 21:28:58,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:58,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497154236] [2019-12-18 21:28:58,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:58,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497154236] [2019-12-18 21:28:58,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:58,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:58,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419429554] [2019-12-18 21:28:58,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:58,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:58,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:58,921 INFO L87 Difference]: Start difference. First operand 830 states and 2281 transitions. Second operand 6 states. [2019-12-18 21:28:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:59,011 INFO L93 Difference]: Finished difference Result 1159 states and 3005 transitions. [2019-12-18 21:28:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:59,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:28:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:59,013 INFO L225 Difference]: With dead ends: 1159 [2019-12-18 21:28:59,013 INFO L226 Difference]: Without dead ends: 676 [2019-12-18 21:28:59,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:28:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-18 21:28:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 604. [2019-12-18 21:28:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:28:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1458 transitions. [2019-12-18 21:28:59,024 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1458 transitions. Word has length 60 [2019-12-18 21:28:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:59,024 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1458 transitions. [2019-12-18 21:28:59,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1458 transitions. [2019-12-18 21:28:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:59,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:59,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:59,026 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash -528056523, now seen corresponding path program 2 times [2019-12-18 21:28:59,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:59,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724931658] [2019-12-18 21:28:59,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:59,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724931658] [2019-12-18 21:28:59,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:59,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:28:59,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883726507] [2019-12-18 21:28:59,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:28:59,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:28:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:28:59,166 INFO L87 Difference]: Start difference. First operand 604 states and 1458 transitions. Second operand 7 states. [2019-12-18 21:28:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:59,306 INFO L93 Difference]: Finished difference Result 993 states and 2351 transitions. [2019-12-18 21:28:59,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:28:59,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 21:28:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:59,307 INFO L225 Difference]: With dead ends: 993 [2019-12-18 21:28:59,307 INFO L226 Difference]: Without dead ends: 268 [2019-12-18 21:28:59,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:28:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-18 21:28:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2019-12-18 21:28:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 21:28:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-18 21:28:59,311 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 60 [2019-12-18 21:28:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:59,311 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-18 21:28:59,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:28:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-18 21:28:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:59,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:59,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:59,313 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:28:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 3 times [2019-12-18 21:28:59,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:59,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729874187] [2019-12-18 21:28:59,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:59,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729874187] [2019-12-18 21:28:59,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:59,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:28:59,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499975294] [2019-12-18 21:28:59,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:28:59,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:28:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:28:59,846 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 14 states. [2019-12-18 21:29:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:29:00,856 INFO L93 Difference]: Finished difference Result 385 states and 666 transitions. [2019-12-18 21:29:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:29:00,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:29:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:29:00,857 INFO L225 Difference]: With dead ends: 385 [2019-12-18 21:29:00,857 INFO L226 Difference]: Without dead ends: 354 [2019-12-18 21:29:00,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:29:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-18 21:29:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 344. [2019-12-18 21:29:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 21:29:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-18 21:29:00,861 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-18 21:29:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:29:00,862 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-18 21:29:00,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:29:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-18 21:29:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:29:00,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:29:00,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:29:00,863 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:29:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:29:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 4 times [2019-12-18 21:29:00,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:29:00,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592369343] [2019-12-18 21:29:00,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:29:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:29:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:29:00,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:29:00,988 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:29:00,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1181~0.base_19|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19|) |v_ULTIMATE.start_main_~#t1181~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$r_buff1_thd1~0_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19|) 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19| 1)) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1181~0.base_19| 4) |v_#length_29|) (= v_~b~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_25) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t1181~0.offset_16|) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_22|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_~#t1181~0.base=|v_ULTIMATE.start_main_~#t1181~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~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_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_21|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_9, ~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_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_~#t1181~0.offset=|v_ULTIMATE.start_main_~#t1181~0.offset_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~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, ULTIMATE.start_main_~#t1182~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1182~0.offset, ~__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, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t1184~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1181~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, ULTIMATE.start_main_~#t1183~0.offset, ~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_~#t1183~0.base, 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_#t~ite36, ULTIMATE.start_main_~#t1181~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-18 21:29:00,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1182~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13|) |v_ULTIMATE.start_main_~#t1182~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1182~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13| 1) |v_#valid_48|) (= 0 |v_ULTIMATE.start_main_~#t1182~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1182~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1182~0.base] because there is no mapped edge [2019-12-18 21:29:00,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1183~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1183~0.offset_10|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1183~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12|) |v_ULTIMATE.start_main_~#t1183~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1183~0.base_12| 4) |v_#length_21|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_12|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1183~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1183~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:29:00,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12|) |v_ULTIMATE.start_main_~#t1184~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1184~0.offset_10|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1184~0.base_12|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1184~0.base_12| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1184~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-18 21:29:00,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:29:00,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) 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_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, 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_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:29:00,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:29:01,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1144831540 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1144831540 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1144831540|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1144831540| ~z$w_buff0_used~0_In1144831540)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1144831540, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1144831540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1144831540, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1144831540, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1144831540|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:29:01,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1452617928 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1452617928 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1452617928 |P2Thread1of1ForFork2_#t~ite3_Out1452617928|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out1452617928| ~z$w_buff1~0_In1452617928)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1452617928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1452617928, ~z$w_buff1~0=~z$w_buff1~0_In1452617928, ~z~0=~z~0_In1452617928} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1452617928|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1452617928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1452617928, ~z$w_buff1~0=~z$w_buff1~0_In1452617928, ~z~0=~z~0_In1452617928} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:29:01,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-491150071 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-491150071 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-491150071 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-491150071 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-491150071| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-491150071 |P3Thread1of1ForFork3_#t~ite12_Out-491150071|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-491150071, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-491150071, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-491150071, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491150071} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-491150071, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-491150071, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-491150071, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491150071, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-491150071|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:29:01,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2053883892 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2053883892 256)))) (or (and (= ~z$r_buff0_thd4~0_Out2053883892 ~z$r_buff0_thd4~0_In2053883892) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out2053883892 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2053883892, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2053883892} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2053883892, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2053883892, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out2053883892|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:29:01,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1804951502 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1804951502 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1804951502 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1804951502 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1804951502|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-1804951502 |P3Thread1of1ForFork3_#t~ite14_Out-1804951502|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1804951502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1804951502, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1804951502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1804951502} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1804951502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1804951502, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1804951502|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1804951502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1804951502} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:29:01,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:29:01,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |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_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:29:01,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In588204902 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In588204902 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out588204902| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out588204902| ~z$w_buff0_used~0_In588204902) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In588204902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In588204902} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out588204902|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588204902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In588204902} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:29:01,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-272045059 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-272045059 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-272045059 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-272045059 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-272045059| ~z$w_buff1_used~0_In-272045059) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-272045059| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-272045059, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-272045059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-272045059, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-272045059} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-272045059|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-272045059, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-272045059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-272045059, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-272045059} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:29:01,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1850504420 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1850504420 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1850504420|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1850504420| ~z$r_buff0_thd3~0_In-1850504420) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850504420, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1850504420} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850504420, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1850504420, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1850504420|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:29:01,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-151551854 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-151551854 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-151551854 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-151551854 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite8_Out-151551854| ~z$r_buff1_thd3~0_In-151551854)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite8_Out-151551854| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-151551854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-151551854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151551854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-151551854} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-151551854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-151551854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151551854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-151551854, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-151551854|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:29:01,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:29:01,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:29:01,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2130870721 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In2130870721 256) 0))) (or (and (= ~z~0_In2130870721 |ULTIMATE.start_main_#t~ite19_Out2130870721|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out2130870721| ~z$w_buff1~0_In2130870721)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2130870721, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130870721, ~z$w_buff1~0=~z$w_buff1~0_In2130870721, ~z~0=~z~0_In2130870721} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2130870721|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2130870721, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130870721, ~z$w_buff1~0=~z$w_buff1~0_In2130870721, ~z~0=~z~0_In2130870721} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:29:01,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |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_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:29:01,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-275489209 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-275489209 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-275489209|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-275489209| ~z$w_buff0_used~0_In-275489209)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-275489209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-275489209} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-275489209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-275489209, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-275489209|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:29:01,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In692079876 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In692079876 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In692079876 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In692079876 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out692079876| ~z$w_buff1_used~0_In692079876)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite22_Out692079876| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In692079876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In692079876, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In692079876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In692079876} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In692079876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In692079876, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In692079876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In692079876, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out692079876|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:29:01,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In895918787 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In895918787 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out895918787|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In895918787 |ULTIMATE.start_main_#t~ite23_Out895918787|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In895918787, ~z$w_buff0_used~0=~z$w_buff0_used~0_In895918787} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In895918787, ~z$w_buff0_used~0=~z$w_buff0_used~0_In895918787, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out895918787|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:29:01,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1473678619 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1473678619 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1473678619 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1473678619 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out-1473678619| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-1473678619| ~z$r_buff1_thd0~0_In-1473678619) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1473678619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473678619, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1473678619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473678619} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1473678619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473678619, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1473678619, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1473678619|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473678619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:29:01,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In401671237 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out401671237| ~z$w_buff1_used~0_In401671237) (= |ULTIMATE.start_main_#t~ite39_In401671237| |ULTIMATE.start_main_#t~ite39_Out401671237|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out401671237| |ULTIMATE.start_main_#t~ite39_Out401671237|) (= ~z$w_buff1_used~0_In401671237 |ULTIMATE.start_main_#t~ite39_Out401671237|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In401671237 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In401671237 256))) (= (mod ~z$w_buff0_used~0_In401671237 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In401671237 256) 0))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In401671237, ~z$w_buff0_used~0=~z$w_buff0_used~0_In401671237, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In401671237|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In401671237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In401671237, ~weak$$choice2~0=~weak$$choice2~0_In401671237} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In401671237, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out401671237|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out401671237|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In401671237, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In401671237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In401671237, ~weak$$choice2~0=~weak$$choice2~0_In401671237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:29:01,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:29:01,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite46_Out-1978025145| |ULTIMATE.start_main_#t~ite45_Out-1978025145|)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1978025145 256) 0)) (.cse4 (= 0 (mod ~z$r_buff1_thd0~0_In-1978025145 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1978025145 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In-1978025145 256))) (.cse5 (= (mod ~weak$$choice2~0_In-1978025145 256) 0))) (or (let ((.cse2 (not .cse6))) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1978025145|) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out-1978025145| |ULTIMATE.start_main_#t~ite44_Out-1978025145|) (or (not .cse1) .cse2) (not .cse3) (or .cse2 (not .cse4)) .cse5)) (and (or (and (not .cse5) (= |ULTIMATE.start_main_#t~ite46_Out-1978025145| ~z$r_buff1_thd0~0_In-1978025145) (= |ULTIMATE.start_main_#t~ite45_Out-1978025145| |ULTIMATE.start_main_#t~ite45_In-1978025145|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1978025145| ~z$r_buff1_thd0~0_In-1978025145) .cse0 (or .cse3 (and .cse6 .cse4) (and .cse1 .cse6)) .cse5)) (= |ULTIMATE.start_main_#t~ite44_In-1978025145| |ULTIMATE.start_main_#t~ite44_Out-1978025145|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1978025145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1978025145, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1978025145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1978025145, ~weak$$choice2~0=~weak$$choice2~0_In-1978025145, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1978025145|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1978025145|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1978025145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1978025145, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1978025145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1978025145, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1978025145|, ~weak$$choice2~0=~weak$$choice2~0_In-1978025145, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1978025145|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1978025145|} 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-18 21:29:01,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 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_12} 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_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:29:01,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 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_8, 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-18 21:29:01,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:29:01 BasicIcfg [2019-12-18 21:29:01,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:29:01,129 INFO L168 Benchmark]: Toolchain (without parser) took 29304.22 ms. Allocated memory was 145.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 101.7 MB in the beginning and 916.0 MB in the end (delta: -814.4 MB). Peak memory consumption was 603.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:29:01,129 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:29:01,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.96 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 101.2 MB in the beginning and 152.7 MB in the end (delta: -51.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:29:01,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.24 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 149.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:29:01,132 INFO L168 Benchmark]: Boogie Preprocessor took 56.58 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 147.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:29:01,132 INFO L168 Benchmark]: RCFGBuilder took 854.68 ms. Allocated memory is still 201.9 MB. Free memory was 146.9 MB in the beginning and 98.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:29:01,133 INFO L168 Benchmark]: TraceAbstraction took 27437.72 ms. Allocated memory was 201.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 97.2 MB in the beginning and 916.0 MB in the end (delta: -818.8 MB). Peak memory consumption was 542.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:29:01,137 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.47 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 855.96 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 101.2 MB in the beginning and 152.7 MB in the end (delta: -51.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.24 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 149.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.58 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 147.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.68 ms. Allocated memory is still 201.9 MB. Free memory was 146.9 MB in the beginning and 98.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27437.72 ms. Allocated memory was 201.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 97.2 MB in the beginning and 916.0 MB in the end (delta: -818.8 MB). Peak memory consumption was 542.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L810] 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) [L774] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 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 [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 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 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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] [L856] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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] [L856] 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) [L857] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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] [L857] 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)) [L858] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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] [L858] 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)) [L859] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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] [L859] 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)) [L860] 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)) [L862] 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)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1632 SDtfs, 1810 SDslu, 3423 SDs, 0 SdLazy, 1255 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 8487 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 175482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...