/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/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:27,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:27,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:27,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:27,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:27,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:27,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:27,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:27,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:27,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:27,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:27,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:27,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:27,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:27,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:27,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:27,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:27,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:27,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:27,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:27,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:27,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:27,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:27,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:27,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:27,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:27,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:27,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:27,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:27,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:27,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:27,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:27,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:27,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:27,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:27,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:27,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:27,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:27,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:27,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:27,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:27,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:03:27,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:27,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:27,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:27,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:27,676 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:27,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:27,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:27,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:27,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:27,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:27,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:27,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:27,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:27,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:27,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:27,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:27,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:27,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:27,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:27,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:27,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:27,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:27,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:27,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:27,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:27,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:27,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:27,682 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:27,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:27,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:27,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:27,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:27,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:27,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:27,974 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:27,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-18 23:03:28,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f4fbdbf/726fdb6eb1184719bdebb219bf0f3018/FLAG452ef259b [2019-12-18 23:03:28,562 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:28,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-18 23:03:28,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f4fbdbf/726fdb6eb1184719bdebb219bf0f3018/FLAG452ef259b [2019-12-18 23:03:28,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f4fbdbf/726fdb6eb1184719bdebb219bf0f3018 [2019-12-18 23:03:28,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:28,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:28,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:28,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:28,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:28,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:28" (1/1) ... [2019-12-18 23:03:28,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cbb9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:28, skipping insertion in model container [2019-12-18 23:03:28,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:28" (1/1) ... [2019-12-18 23:03:28,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:28,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:29,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:29,516 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:29,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:29,682 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:29,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29 WrapperNode [2019-12-18 23:03:29,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:29,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:29,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:29,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:29,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:29,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:29,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:29,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:29,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:29,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:29,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:29,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:29,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (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 23:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:29,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:29,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:03:29,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:03:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:29,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:29,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:29,885 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 23:03:30,590 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:30,591 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:30,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:30 BoogieIcfgContainer [2019-12-18 23:03:30,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:30,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:30,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:30,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:28" (1/3) ... [2019-12-18 23:03:30,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c35ac82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:30, skipping insertion in model container [2019-12-18 23:03:30,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (2/3) ... [2019-12-18 23:03:30,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c35ac82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:30, skipping insertion in model container [2019-12-18 23:03:30,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:30" (3/3) ... [2019-12-18 23:03:30,602 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2019-12-18 23:03:30,613 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:30,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:30,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:30,624 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:30,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,673 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,673 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,685 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,686 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:03:30,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:30,745 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:30,745 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:30,745 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:30,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:30,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:30,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:30,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:30,763 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-18 23:03:30,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 23:03:30,857 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 23:03:30,857 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:30,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:03:30,894 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 23:03:30,971 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 23:03:30,971 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:30,980 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:03:30,996 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 23:03:30,998 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:03:34,241 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 23:03:34,357 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47769 [2019-12-18 23:03:34,358 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 23:03:34,361 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-18 23:03:35,232 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16048 states. [2019-12-18 23:03:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 16048 states. [2019-12-18 23:03:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 23:03:35,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:35,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:35,242 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2062442641, now seen corresponding path program 1 times [2019-12-18 23:03:35,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:35,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987434950] [2019-12-18 23:03:35,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:35,483 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 23:03:35,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987434950] [2019-12-18 23:03:35,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:35,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:03:35,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713389845] [2019-12-18 23:03:35,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:35,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:35,509 INFO L87 Difference]: Start difference. First operand 16048 states. Second operand 3 states. [2019-12-18 23:03:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:36,013 INFO L93 Difference]: Finished difference Result 15976 states and 59309 transitions. [2019-12-18 23:03:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:36,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 23:03:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:36,259 INFO L225 Difference]: With dead ends: 15976 [2019-12-18 23:03:36,259 INFO L226 Difference]: Without dead ends: 15638 [2019-12-18 23:03:36,261 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 23:03:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15638 states. [2019-12-18 23:03:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15638 to 15638. [2019-12-18 23:03:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15638 states. [2019-12-18 23:03:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15638 states to 15638 states and 58100 transitions. [2019-12-18 23:03:37,092 INFO L78 Accepts]: Start accepts. Automaton has 15638 states and 58100 transitions. Word has length 7 [2019-12-18 23:03:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:37,094 INFO L462 AbstractCegarLoop]: Abstraction has 15638 states and 58100 transitions. [2019-12-18 23:03:37,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15638 states and 58100 transitions. [2019-12-18 23:03:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:03:37,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:37,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:37,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1739907337, now seen corresponding path program 1 times [2019-12-18 23:03:37,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:37,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173539205] [2019-12-18 23:03:37,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:37,199 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 23:03:37,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173539205] [2019-12-18 23:03:37,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:37,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:37,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4431219] [2019-12-18 23:03:37,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:37,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:37,203 INFO L87 Difference]: Start difference. First operand 15638 states and 58100 transitions. Second operand 4 states. [2019-12-18 23:03:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:38,622 INFO L93 Difference]: Finished difference Result 24994 states and 89270 transitions. [2019-12-18 23:03:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:38,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:03:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:38,728 INFO L225 Difference]: With dead ends: 24994 [2019-12-18 23:03:38,728 INFO L226 Difference]: Without dead ends: 24980 [2019-12-18 23:03:38,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24980 states. [2019-12-18 23:03:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24980 to 22308. [2019-12-18 23:03:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22308 states. [2019-12-18 23:03:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22308 states to 22308 states and 80649 transitions. [2019-12-18 23:03:39,621 INFO L78 Accepts]: Start accepts. Automaton has 22308 states and 80649 transitions. Word has length 13 [2019-12-18 23:03:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:39,622 INFO L462 AbstractCegarLoop]: Abstraction has 22308 states and 80649 transitions. [2019-12-18 23:03:39,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22308 states and 80649 transitions. [2019-12-18 23:03:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:03:39,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:39,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:39,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1595374669, now seen corresponding path program 1 times [2019-12-18 23:03:39,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:39,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735917833] [2019-12-18 23:03:39,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:39,693 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 23:03:39,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735917833] [2019-12-18 23:03:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:39,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707355531] [2019-12-18 23:03:39,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:39,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:39,696 INFO L87 Difference]: Start difference. First operand 22308 states and 80649 transitions. Second operand 3 states. [2019-12-18 23:03:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:39,759 INFO L93 Difference]: Finished difference Result 12738 states and 39797 transitions. [2019-12-18 23:03:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:39,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 23:03:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:39,807 INFO L225 Difference]: With dead ends: 12738 [2019-12-18 23:03:39,807 INFO L226 Difference]: Without dead ends: 12738 [2019-12-18 23:03:39,807 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 23:03:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-12-18 23:03:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 12738. [2019-12-18 23:03:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12738 states. [2019-12-18 23:03:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12738 states to 12738 states and 39797 transitions. [2019-12-18 23:03:40,337 INFO L78 Accepts]: Start accepts. Automaton has 12738 states and 39797 transitions. Word has length 13 [2019-12-18 23:03:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:40,340 INFO L462 AbstractCegarLoop]: Abstraction has 12738 states and 39797 transitions. [2019-12-18 23:03:40,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 12738 states and 39797 transitions. [2019-12-18 23:03:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:03:40,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:40,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:40,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1225120988, now seen corresponding path program 1 times [2019-12-18 23:03:40,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:40,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77358247] [2019-12-18 23:03:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:40,438 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 23:03:40,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77358247] [2019-12-18 23:03:40,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:40,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:40,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875094674] [2019-12-18 23:03:40,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:40,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:40,443 INFO L87 Difference]: Start difference. First operand 12738 states and 39797 transitions. Second operand 4 states. [2019-12-18 23:03:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:40,478 INFO L93 Difference]: Finished difference Result 1939 states and 4475 transitions. [2019-12-18 23:03:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:03:40,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 23:03:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:40,484 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 23:03:40,484 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 23:03:40,485 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 23:03:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 23:03:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-18 23:03:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-18 23:03:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4475 transitions. [2019-12-18 23:03:40,519 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4475 transitions. Word has length 14 [2019-12-18 23:03:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:40,519 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4475 transitions. [2019-12-18 23:03:40,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4475 transitions. [2019-12-18 23:03:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 23:03:40,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:40,523 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] [2019-12-18 23:03:40,523 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:40,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash 509934292, now seen corresponding path program 1 times [2019-12-18 23:03:40,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:40,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327089742] [2019-12-18 23:03:40,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:40,650 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 23:03:40,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327089742] [2019-12-18 23:03:40,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:40,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:40,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536217795] [2019-12-18 23:03:40,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:40,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:40,653 INFO L87 Difference]: Start difference. First operand 1939 states and 4475 transitions. Second operand 5 states. [2019-12-18 23:03:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:40,681 INFO L93 Difference]: Finished difference Result 670 states and 1573 transitions. [2019-12-18 23:03:40,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:40,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 23:03:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:40,684 INFO L225 Difference]: With dead ends: 670 [2019-12-18 23:03:40,684 INFO L226 Difference]: Without dead ends: 670 [2019-12-18 23:03:40,684 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 23:03:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-18 23:03:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 600. [2019-12-18 23:03:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-18 23:03:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1408 transitions. [2019-12-18 23:03:40,695 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1408 transitions. Word has length 26 [2019-12-18 23:03:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:40,695 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1408 transitions. [2019-12-18 23:03:40,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1408 transitions. [2019-12-18 23:03:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:03:40,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:40,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:40,701 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1992668075, now seen corresponding path program 1 times [2019-12-18 23:03:40,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:40,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975292163] [2019-12-18 23:03:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:40,862 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 23:03:40,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975292163] [2019-12-18 23:03:40,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:40,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:40,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216658170] [2019-12-18 23:03:40,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:40,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:40,868 INFO L87 Difference]: Start difference. First operand 600 states and 1408 transitions. Second operand 3 states. [2019-12-18 23:03:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:40,918 INFO L93 Difference]: Finished difference Result 612 states and 1424 transitions. [2019-12-18 23:03:40,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:40,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:03:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:40,920 INFO L225 Difference]: With dead ends: 612 [2019-12-18 23:03:40,920 INFO L226 Difference]: Without dead ends: 612 [2019-12-18 23:03:40,921 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 23:03:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-18 23:03:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 606. [2019-12-18 23:03:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 23:03:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1418 transitions. [2019-12-18 23:03:40,931 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1418 transitions. Word has length 55 [2019-12-18 23:03:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:40,931 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1418 transitions. [2019-12-18 23:03:40,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1418 transitions. [2019-12-18 23:03:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:03:40,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:40,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:40,934 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 411437521, now seen corresponding path program 1 times [2019-12-18 23:03:40,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:40,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943886502] [2019-12-18 23:03:40,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:41,118 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 23:03:41,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943886502] [2019-12-18 23:03:41,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:41,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:03:41,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145025869] [2019-12-18 23:03:41,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:41,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:41,127 INFO L87 Difference]: Start difference. First operand 606 states and 1418 transitions. Second operand 6 states. [2019-12-18 23:03:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:41,446 INFO L93 Difference]: Finished difference Result 959 states and 2236 transitions. [2019-12-18 23:03:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:03:41,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:03:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:41,452 INFO L225 Difference]: With dead ends: 959 [2019-12-18 23:03:41,452 INFO L226 Difference]: Without dead ends: 959 [2019-12-18 23:03:41,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:03:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-12-18 23:03:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 764. [2019-12-18 23:03:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-12-18 23:03:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1797 transitions. [2019-12-18 23:03:41,470 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1797 transitions. Word has length 55 [2019-12-18 23:03:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:41,471 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1797 transitions. [2019-12-18 23:03:41,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1797 transitions. [2019-12-18 23:03:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:03:41,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:41,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:41,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:41,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1705593493, now seen corresponding path program 2 times [2019-12-18 23:03:41,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:41,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271370705] [2019-12-18 23:03:41,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:41,618 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 23:03:41,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271370705] [2019-12-18 23:03:41,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:41,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:03:41,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54879528] [2019-12-18 23:03:41,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:41,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:41,620 INFO L87 Difference]: Start difference. First operand 764 states and 1797 transitions. Second operand 6 states. [2019-12-18 23:03:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:42,107 INFO L93 Difference]: Finished difference Result 1309 states and 3052 transitions. [2019-12-18 23:03:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:42,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:03:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:42,109 INFO L225 Difference]: With dead ends: 1309 [2019-12-18 23:03:42,109 INFO L226 Difference]: Without dead ends: 1309 [2019-12-18 23:03:42,110 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 23:03:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2019-12-18 23:03:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 842. [2019-12-18 23:03:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-12-18 23:03:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1994 transitions. [2019-12-18 23:03:42,128 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1994 transitions. Word has length 55 [2019-12-18 23:03:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:42,128 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1994 transitions. [2019-12-18 23:03:42,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1994 transitions. [2019-12-18 23:03:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:03:42,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:42,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:42,131 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1720718779, now seen corresponding path program 3 times [2019-12-18 23:03:42,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:42,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667869873] [2019-12-18 23:03:42,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:42,260 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 23:03:42,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667869873] [2019-12-18 23:03:42,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:42,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:42,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310589822] [2019-12-18 23:03:42,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:42,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:42,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:42,262 INFO L87 Difference]: Start difference. First operand 842 states and 1994 transitions. Second operand 6 states. [2019-12-18 23:03:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:42,331 INFO L93 Difference]: Finished difference Result 1549 states and 3324 transitions. [2019-12-18 23:03:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:03:42,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:03:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:42,333 INFO L225 Difference]: With dead ends: 1549 [2019-12-18 23:03:42,334 INFO L226 Difference]: Without dead ends: 1054 [2019-12-18 23:03:42,334 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 23:03:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-12-18 23:03:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 770. [2019-12-18 23:03:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-18 23:03:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1785 transitions. [2019-12-18 23:03:42,350 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1785 transitions. Word has length 55 [2019-12-18 23:03:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:42,350 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1785 transitions. [2019-12-18 23:03:42,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1785 transitions. [2019-12-18 23:03:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:03:42,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:42,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:42,353 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash 57133329, now seen corresponding path program 4 times [2019-12-18 23:03:42,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:42,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936455636] [2019-12-18 23:03:42,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:42,409 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 23:03:42,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936455636] [2019-12-18 23:03:42,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:42,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:42,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635717275] [2019-12-18 23:03:42,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:42,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:42,412 INFO L87 Difference]: Start difference. First operand 770 states and 1785 transitions. Second operand 3 states. [2019-12-18 23:03:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:42,425 INFO L93 Difference]: Finished difference Result 702 states and 1588 transitions. [2019-12-18 23:03:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:42,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:03:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:42,426 INFO L225 Difference]: With dead ends: 702 [2019-12-18 23:03:42,426 INFO L226 Difference]: Without dead ends: 702 [2019-12-18 23:03:42,427 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 23:03:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-18 23:03:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2019-12-18 23:03:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-12-18 23:03:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1588 transitions. [2019-12-18 23:03:42,438 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1588 transitions. Word has length 55 [2019-12-18 23:03:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:42,438 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 1588 transitions. [2019-12-18 23:03:42,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1588 transitions. [2019-12-18 23:03:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:03:42,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:42,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:42,441 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 281240766, now seen corresponding path program 1 times [2019-12-18 23:03:42,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:42,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172212873] [2019-12-18 23:03:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:42,504 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 23:03:42,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172212873] [2019-12-18 23:03:42,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:42,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:42,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587706494] [2019-12-18 23:03:42,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:42,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:42,507 INFO L87 Difference]: Start difference. First operand 702 states and 1588 transitions. Second operand 3 states. [2019-12-18 23:03:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:42,548 INFO L93 Difference]: Finished difference Result 702 states and 1587 transitions. [2019-12-18 23:03:42,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:42,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 23:03:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:42,550 INFO L225 Difference]: With dead ends: 702 [2019-12-18 23:03:42,550 INFO L226 Difference]: Without dead ends: 702 [2019-12-18 23:03:42,551 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 23:03:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-18 23:03:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 437. [2019-12-18 23:03:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-18 23:03:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 973 transitions. [2019-12-18 23:03:42,560 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 973 transitions. Word has length 56 [2019-12-18 23:03:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:42,560 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 973 transitions. [2019-12-18 23:03:42,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 973 transitions. [2019-12-18 23:03:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:03:42,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:42,562 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] [2019-12-18 23:03:42,562 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash -265184758, now seen corresponding path program 1 times [2019-12-18 23:03:42,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:42,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820239978] [2019-12-18 23:03:42,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:42,667 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 23:03:42,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820239978] [2019-12-18 23:03:42,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:42,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:42,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842939521] [2019-12-18 23:03:42,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:42,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:42,670 INFO L87 Difference]: Start difference. First operand 437 states and 973 transitions. Second operand 5 states. [2019-12-18 23:03:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:42,711 INFO L93 Difference]: Finished difference Result 625 states and 1306 transitions. [2019-12-18 23:03:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:42,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 23:03:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:42,712 INFO L225 Difference]: With dead ends: 625 [2019-12-18 23:03:42,713 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 23:03:42,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:03:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 23:03:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-12-18 23:03:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-18 23:03:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 390 transitions. [2019-12-18 23:03:42,717 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 390 transitions. Word has length 57 [2019-12-18 23:03:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:42,718 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 390 transitions. [2019-12-18 23:03:42,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 390 transitions. [2019-12-18 23:03:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:03:42,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:42,719 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] [2019-12-18 23:03:42,719 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1560317592, now seen corresponding path program 2 times [2019-12-18 23:03:42,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:42,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955548812] [2019-12-18 23:03:42,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:43,525 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 23:03:43,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955548812] [2019-12-18 23:03:43,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:43,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 23:03:43,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044945010] [2019-12-18 23:03:43,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 23:03:43,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 23:03:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:03:43,527 INFO L87 Difference]: Start difference. First operand 221 states and 390 transitions. Second operand 21 states. [2019-12-18 23:03:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:45,297 INFO L93 Difference]: Finished difference Result 485 states and 842 transitions. [2019-12-18 23:03:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:03:45,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-12-18 23:03:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:45,299 INFO L225 Difference]: With dead ends: 485 [2019-12-18 23:03:45,299 INFO L226 Difference]: Without dead ends: 454 [2019-12-18 23:03:45,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 23:03:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-18 23:03:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 306. [2019-12-18 23:03:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-18 23:03:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 533 transitions. [2019-12-18 23:03:45,307 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 533 transitions. Word has length 57 [2019-12-18 23:03:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:45,307 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 533 transitions. [2019-12-18 23:03:45,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 23:03:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 533 transitions. [2019-12-18 23:03:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:03:45,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:45,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:45,309 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1476502012, now seen corresponding path program 3 times [2019-12-18 23:03:45,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:45,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433820110] [2019-12-18 23:03:45,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:45,598 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 23:03:45,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433820110] [2019-12-18 23:03:45,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:45,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:03:45,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918772064] [2019-12-18 23:03:45,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:03:45,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:03:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:03:45,601 INFO L87 Difference]: Start difference. First operand 306 states and 533 transitions. Second operand 13 states. [2019-12-18 23:03:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:46,160 INFO L93 Difference]: Finished difference Result 471 states and 806 transitions. [2019-12-18 23:03:46,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:03:46,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 23:03:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:46,161 INFO L225 Difference]: With dead ends: 471 [2019-12-18 23:03:46,162 INFO L226 Difference]: Without dead ends: 440 [2019-12-18 23:03:46,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:03:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-18 23:03:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 321. [2019-12-18 23:03:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 23:03:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 561 transitions. [2019-12-18 23:03:46,171 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 561 transitions. Word has length 57 [2019-12-18 23:03:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:46,172 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 561 transitions. [2019-12-18 23:03:46,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:03:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 561 transitions. [2019-12-18 23:03:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:03:46,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:46,173 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] [2019-12-18 23:03:46,173 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -438640254, now seen corresponding path program 4 times [2019-12-18 23:03:46,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:46,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849406280] [2019-12-18 23:03:46,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:46,435 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 23:03:46,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849406280] [2019-12-18 23:03:46,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:46,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:03:46,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183185116] [2019-12-18 23:03:46,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:03:46,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:46,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:03:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:03:46,438 INFO L87 Difference]: Start difference. First operand 321 states and 561 transitions. Second operand 12 states. [2019-12-18 23:03:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:46,704 INFO L93 Difference]: Finished difference Result 422 states and 714 transitions. [2019-12-18 23:03:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:03:46,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 23:03:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:46,705 INFO L225 Difference]: With dead ends: 422 [2019-12-18 23:03:46,706 INFO L226 Difference]: Without dead ends: 391 [2019-12-18 23:03:46,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:03:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-18 23:03:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 329. [2019-12-18 23:03:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-18 23:03:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 575 transitions. [2019-12-18 23:03:46,714 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 575 transitions. Word has length 57 [2019-12-18 23:03:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:46,715 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 575 transitions. [2019-12-18 23:03:46,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:03:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 575 transitions. [2019-12-18 23:03:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:03:46,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:46,717 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] [2019-12-18 23:03:46,717 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1131378088, now seen corresponding path program 5 times [2019-12-18 23:03:46,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:46,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396328930] [2019-12-18 23:03:46,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:46,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:03:46,916 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:03:46,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_7 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_15) (= v_~y~0_25 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2492~0.base_27|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_23 0) (= 0 v_~weak$$choice2~0_34) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_18|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27| 1) |v_#valid_59|) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd0~0_50) (= v_~y$r_buff0_thd0~0_77 0) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27|)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_18 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2492~0.base_27| 4) |v_#length_25|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 |v_ULTIMATE.start_main_~#t2492~0.offset_20|) (= v_~main$tmp_guard1~0_10 0) (= v_~z~0_12 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27|) |v_ULTIMATE.start_main_~#t2492~0.offset_20| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_16|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_17|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_18, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_~#t2492~0.offset=|v_ULTIMATE.start_main_~#t2492~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_20|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t2492~0.base=|v_ULTIMATE.start_main_~#t2492~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2494~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2494~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2492~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t2493~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2492~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:03:46,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2493~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t2493~0.offset_9| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9|) |v_ULTIMATE.start_main_~#t2493~0.offset_9| 1))) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2493~0.base_9| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2493~0.base] because there is no mapped edge [2019-12-18 23:03:46,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10|) |v_ULTIMATE.start_main_~#t2494~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10| 1) |v_#valid_31|) (not (= 0 |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2494~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2494~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2494~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2494~0.offset] because there is no mapped edge [2019-12-18 23:03:46,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] P2ENTRY-->L4-3: Formula: (and (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out955859779|) (= ~y$w_buff0_used~0_Out955859779 1) (= 2 ~y$w_buff0~0_Out955859779) (= ~y$w_buff1~0_Out955859779 ~y$w_buff0~0_In955859779) (= ~y$w_buff1_used~0_Out955859779 ~y$w_buff0_used~0_In955859779) (= |P2Thread1of1ForFork0_#in~arg.offset_In955859779| P2Thread1of1ForFork0_~arg.offset_Out955859779) (= |P2Thread1of1ForFork0_#in~arg.base_In955859779| P2Thread1of1ForFork0_~arg.base_Out955859779) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out955859779 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out955859779|) (= 0 (mod ~y$w_buff1_used~0_Out955859779 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In955859779|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955859779, ~y$w_buff0~0=~y$w_buff0~0_In955859779, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In955859779|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out955859779, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out955859779|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In955859779|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out955859779, ~y$w_buff1~0=~y$w_buff1~0_Out955859779, ~y$w_buff0~0=~y$w_buff0~0_Out955859779, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out955859779, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In955859779|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out955859779, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out955859779} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:03:46,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 2 v_~z~0_8) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z~0=v_~z~0_8, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 23:03:46,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In33340187 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In33340187 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out33340187| ~y$w_buff0_used~0_In33340187) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out33340187|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In33340187, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In33340187} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In33340187, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out33340187|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In33340187} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 23:03:46,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1695487575 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1695487575 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out-1695487575| |P1Thread1of1ForFork2_#t~ite3_Out-1695487575|))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1695487575| ~y$w_buff1~0_In-1695487575) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= ~y~0_In-1695487575 |P1Thread1of1ForFork2_#t~ite3_Out-1695487575|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1695487575, ~y$w_buff1~0=~y$w_buff1~0_In-1695487575, ~y~0=~y~0_In-1695487575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1695487575} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1695487575, ~y$w_buff1~0=~y$w_buff1~0_In-1695487575, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1695487575|, ~y~0=~y~0_In-1695487575, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1695487575|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1695487575} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 23:03:46,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1146345556 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1146345556 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1146345556 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1146345556 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out1146345556| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1146345556 |P2Thread1of1ForFork0_#t~ite12_Out1146345556|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1146345556, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1146345556, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1146345556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1146345556} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1146345556, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1146345556, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1146345556|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1146345556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1146345556} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 23:03:46,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1716436397 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1716436397 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out1716436397| 0)) (and (= ~y$w_buff0_used~0_In1716436397 |P1Thread1of1ForFork2_#t~ite5_Out1716436397|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1716436397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1716436397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1716436397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1716436397, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1716436397|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 23:03:46,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1908536069 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1908536069 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1908536069 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1908536069 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out-1908536069| ~y$w_buff1_used~0_In-1908536069)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out-1908536069| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1908536069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908536069, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1908536069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1908536069} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1908536069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908536069, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1908536069, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1908536069|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1908536069} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 23:03:46,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In753682537 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In753682537 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out753682537|)) (and (= ~y$r_buff0_thd2~0_In753682537 |P1Thread1of1ForFork2_#t~ite7_Out753682537|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In753682537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In753682537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In753682537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In753682537, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out753682537|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 23:03:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1556894998 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1556894998 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1556894998 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1556894998 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1556894998|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1556894998 |P1Thread1of1ForFork2_#t~ite8_Out1556894998|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1556894998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556894998, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1556894998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556894998} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1556894998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556894998, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1556894998|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1556894998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556894998} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 23:03:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 23:03:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1997315586 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1997315586 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out1997315586)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In1997315586 ~y$r_buff0_thd3~0_Out1997315586)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1997315586, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1997315586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1997315586, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1997315586, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1997315586|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 23:03:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In-537307077 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-537307077 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-537307077 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-537307077 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out-537307077| ~y$r_buff1_thd3~0_In-537307077)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-537307077| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-537307077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537307077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-537307077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537307077} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-537307077|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-537307077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537307077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-537307077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537307077} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 23:03:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 23:03:46,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:03:46,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In560655379 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In560655379 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out560655379| |ULTIMATE.start_main_#t~ite18_Out560655379|))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In560655379 |ULTIMATE.start_main_#t~ite18_Out560655379|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In560655379 |ULTIMATE.start_main_#t~ite18_Out560655379|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In560655379, ~y~0=~y~0_In560655379, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In560655379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In560655379} OutVars{~y$w_buff1~0=~y$w_buff1~0_In560655379, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out560655379|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out560655379|, ~y~0=~y~0_In560655379, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In560655379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In560655379} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 23:03:46,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-38856217 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-38856217 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-38856217| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-38856217| ~y$w_buff0_used~0_In-38856217) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-38856217, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-38856217} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-38856217, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-38856217, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-38856217|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 23:03:46,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2074367458 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2074367458 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2074367458 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2074367458 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-2074367458 |ULTIMATE.start_main_#t~ite21_Out-2074367458|)) (and (= |ULTIMATE.start_main_#t~ite21_Out-2074367458| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074367458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2074367458, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2074367458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2074367458} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074367458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2074367458, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2074367458|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2074367458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2074367458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 23:03:46,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-196838104 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-196838104 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-196838104| ~y$r_buff0_thd0~0_In-196838104) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-196838104|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-196838104, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-196838104} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-196838104, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-196838104, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-196838104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 23:03:46,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1654312677 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1654312677 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1654312677 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1654312677 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1654312677 |ULTIMATE.start_main_#t~ite23_Out-1654312677|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1654312677|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654312677, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1654312677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1654312677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654312677} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654312677, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1654312677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1654312677, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1654312677|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654312677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 23:03:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L820-->L820-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1673842751 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out1673842751| ~y$w_buff0~0_In1673842751) (= |ULTIMATE.start_main_#t~ite29_In1673842751| |ULTIMATE.start_main_#t~ite29_Out1673842751|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out1673842751| |ULTIMATE.start_main_#t~ite29_Out1673842751|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1673842751 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1673842751 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1673842751 256))) (= 0 (mod ~y$w_buff0_used~0_In1673842751 256)))) (= ~y$w_buff0~0_In1673842751 |ULTIMATE.start_main_#t~ite29_Out1673842751|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1673842751, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1673842751|, ~y$w_buff0~0=~y$w_buff0~0_In1673842751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1673842751, ~weak$$choice2~0=~weak$$choice2~0_In1673842751, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1673842751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1673842751} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1673842751|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1673842751, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1673842751|, ~y$w_buff0~0=~y$w_buff0~0_In1673842751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1673842751, ~weak$$choice2~0=~weak$$choice2~0_In1673842751, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1673842751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1673842751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 23:03:46,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L821-->L821-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1323204103 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1323204103 256)))) (or (= (mod ~y$w_buff0_used~0_In1323204103 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In1323204103 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In1323204103 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite32_Out1323204103| |ULTIMATE.start_main_#t~ite33_Out1323204103|) .cse1 (= |ULTIMATE.start_main_#t~ite32_Out1323204103| ~y$w_buff1~0_In1323204103)) (and (not .cse1) (= ~y$w_buff1~0_In1323204103 |ULTIMATE.start_main_#t~ite33_Out1323204103|) (= |ULTIMATE.start_main_#t~ite32_In1323204103| |ULTIMATE.start_main_#t~ite32_Out1323204103|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1323204103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1323204103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1323204103, ~weak$$choice2~0=~weak$$choice2~0_In1323204103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1323204103, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1323204103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1323204103} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1323204103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1323204103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1323204103, ~weak$$choice2~0=~weak$$choice2~0_In1323204103, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1323204103|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1323204103, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1323204103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1323204103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 23:03:46,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1672737811 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_In1672737811| |ULTIMATE.start_main_#t~ite35_Out1672737811|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out1672737811| ~y$w_buff0_used~0_In1672737811)) (and (= ~y$w_buff0_used~0_In1672737811 |ULTIMATE.start_main_#t~ite35_Out1672737811|) (= |ULTIMATE.start_main_#t~ite36_Out1672737811| |ULTIMATE.start_main_#t~ite35_Out1672737811|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1672737811 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1672737811 256))) (= (mod ~y$w_buff0_used~0_In1672737811 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1672737811 256) 0)))) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1672737811, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1672737811, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1672737811|, ~weak$$choice2~0=~weak$$choice2~0_In1672737811, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1672737811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672737811} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1672737811, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1672737811, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1672737811|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1672737811|, ~weak$$choice2~0=~weak$$choice2~0_In1672737811, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1672737811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672737811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 23:03:46,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L825: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff0_thd0~0_62)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 23:03:46,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L825-->L825-8: Formula: (let ((.cse4 (= (mod ~y$w_buff1_used~0_In-423469130 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-423469130 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In-423469130 256))) (.cse5 (= 0 (mod ~y$r_buff1_thd0~0_In-423469130 256))) (.cse1 (= 0 (mod ~weak$$choice2~0_In-423469130 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite44_Out-423469130| |ULTIMATE.start_main_#t~ite45_Out-423469130|))) (or (let ((.cse3 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite43_Out-423469130| 0) .cse0 .cse1 (not .cse2) (or .cse3 (not .cse4)) (or .cse3 (not .cse5)) (= |ULTIMATE.start_main_#t~ite43_Out-423469130| |ULTIMATE.start_main_#t~ite44_Out-423469130|))) (and (or (and (not .cse1) (= ~y$r_buff1_thd0~0_In-423469130 |ULTIMATE.start_main_#t~ite45_Out-423469130|) (= |ULTIMATE.start_main_#t~ite44_Out-423469130| |ULTIMATE.start_main_#t~ite44_In-423469130|)) (and (= ~y$r_buff1_thd0~0_In-423469130 |ULTIMATE.start_main_#t~ite44_Out-423469130|) (or (and .cse6 .cse4) .cse2 (and .cse6 .cse5)) .cse1 .cse0)) (= |ULTIMATE.start_main_#t~ite43_In-423469130| |ULTIMATE.start_main_#t~ite43_Out-423469130|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-423469130, ~weak$$choice2~0=~weak$$choice2~0_In-423469130, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-423469130|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-423469130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-423469130, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-423469130|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-423469130, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-423469130|, ~weak$$choice2~0=~weak$$choice2~0_In-423469130, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-423469130, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-423469130|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-423469130|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-423469130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 23:03:46,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_21 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:03:46,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 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_11, 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 23:03:47,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:03:47 BasicIcfg [2019-12-18 23:03:47,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:03:47,065 INFO L168 Benchmark]: Toolchain (without parser) took 18215.44 ms. Allocated memory was 138.4 MB in the beginning and 764.4 MB in the end (delta: 626.0 MB). Free memory was 101.2 MB in the beginning and 535.7 MB in the end (delta: -434.5 MB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,066 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.43 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 100.8 MB in the beginning and 158.3 MB in the end (delta: -57.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.77 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,071 INFO L168 Benchmark]: Boogie Preprocessor took 55.08 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,074 INFO L168 Benchmark]: RCFGBuilder took 775.11 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 106.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,075 INFO L168 Benchmark]: TraceAbstraction took 16467.68 ms. Allocated memory was 204.5 MB in the beginning and 764.4 MB in the end (delta: 559.9 MB). Free memory was 106.6 MB in the beginning and 535.7 MB in the end (delta: -429.1 MB). Peak memory consumption was 505.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:47,079 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.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.43 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 100.8 MB in the beginning and 158.3 MB in the end (delta: -57.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.77 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.08 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 775.11 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 106.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16467.68 ms. Allocated memory was 204.5 MB in the beginning and 764.4 MB in the end (delta: 559.9 MB). Free memory was 106.6 MB in the beginning and 535.7 MB in the end (delta: -429.1 MB). Peak memory consumption was 505.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 161 ProgramPointsBefore, 82 ProgramPointsAfterwards, 192 TransitionsBefore, 88 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 4003 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 47769 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L820] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L821] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L822] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1428 SDtfs, 1306 SDslu, 3880 SDs, 0 SdLazy, 2555 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22308occurred 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: 2.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 4288 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 130281 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...