/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:39:36,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:39:36,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:39:36,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:39:36,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:39:36,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:39:36,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:39:36,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:39:36,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:39:36,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:39:36,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:39:36,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:39:36,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:39:36,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:39:36,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:39:36,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:39:36,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:39:36,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:39:36,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:39:36,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:39:36,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:39:36,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:39:36,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:39:36,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:39:36,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:39:36,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:39:36,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:39:36,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:39:36,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:39:36,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:39:36,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:39:36,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:39:36,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:39:36,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:39:36,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:39:36,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:39:36,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:39:36,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:39:36,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:39:36,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:39:36,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:39:36,716 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-MCR.epf [2019-12-27 22:39:36,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:39:36,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:39:36,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:39:36,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:39:36,732 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:39:36,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:39:36,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:39:36,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:39:36,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:39:36,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:39:36,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:39:36,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:39:36,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:39:36,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:39:36,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:39:36,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:39:36,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:39:36,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:39:36,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:39:36,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:39:36,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:39:36,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:39:36,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:39:36,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:39:36,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:39:36,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:39:36,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:39:36,737 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:39:36,737 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:39:36,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:39:36,738 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:39:36,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:39:37,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:39:37,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:39:37,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:39:37,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:39:37,040 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:39:37,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-27 22:39:37,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a836104e/ba1c180846784b5d8c54784b46598d07/FLAGf1491284c [2019-12-27 22:39:37,680 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:39:37,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-27 22:39:37,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a836104e/ba1c180846784b5d8c54784b46598d07/FLAGf1491284c [2019-12-27 22:39:38,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a836104e/ba1c180846784b5d8c54784b46598d07 [2019-12-27 22:39:38,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:39:38,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:39:38,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:39:38,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:39:38,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:39:38,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2391b325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38, skipping insertion in model container [2019-12-27 22:39:38,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:39:38,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:39:38,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:39:38,728 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:39:38,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:39:38,909 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:39:38,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38 WrapperNode [2019-12-27 22:39:38,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:39:38,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:39:38,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:39:38,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:39:38,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:39:38,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:39:38,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:39:38,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:39:38,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:38,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:39,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:39,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:39,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... [2019-12-27 22:39:39,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:39:39,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:39:39,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:39:39,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:39:39,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:39:39,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:39:39,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:39:39,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:39:39,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:39:39,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:39:39,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:39:39,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:39:39,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:39:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:39:39,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:39:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:39:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:39:39,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:39:39,111 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:39:39,898 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:39:39,898 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:39:39,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:39:39 BoogieIcfgContainer [2019-12-27 22:39:39,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:39:39,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:39:39,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:39:39,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:39:39,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:39:38" (1/3) ... [2019-12-27 22:39:39,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29456f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:39:39, skipping insertion in model container [2019-12-27 22:39:39,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:39:38" (2/3) ... [2019-12-27 22:39:39,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29456f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:39:39, skipping insertion in model container [2019-12-27 22:39:39,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:39:39" (3/3) ... [2019-12-27 22:39:39,909 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-27 22:39:39,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:39:39,919 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:39:39,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:39:39,928 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:39:39,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,993 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:39,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:39:40,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:39:40,119 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:39:40,119 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:39:40,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:39:40,119 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:39:40,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:39:40,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:39:40,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:39:40,120 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:39:40,137 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:39:40,139 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:39:40,252 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:39:40,253 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:39:40,272 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:39:40,301 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:39:40,364 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:39:40,364 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:39:40,373 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:39:40,398 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 22:39:40,399 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:39:44,318 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:39:44,438 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:39:44,458 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 22:39:44,459 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 22:39:44,464 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 22:40:00,550 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 22:40:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 22:40:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:40:00,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:00,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:40:00,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 22:40:00,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:00,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20418199] [2019-12-27 22:40:00,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:00,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20418199] [2019-12-27 22:40:00,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:00,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:40:00,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443205460] [2019-12-27 22:40:00,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:00,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:00,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:40:00,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:00,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:00,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:40:00,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:40:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:00,865 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 22:40:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:02,459 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 22:40:02,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:40:02,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:40:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:05,999 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 22:40:06,006 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 22:40:06,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 22:40:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 22:40:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 22:40:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 22:40:17,129 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 22:40:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:17,129 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 22:40:17,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:40:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 22:40:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:40:17,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:17,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:17,134 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 22:40:17,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:17,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426574831] [2019-12-27 22:40:17,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:17,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426574831] [2019-12-27 22:40:17,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:17,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:40:17,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728498506] [2019-12-27 22:40:17,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:17,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:17,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:40:17,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:17,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:17,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:40:17,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:17,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:40:17,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:40:17,293 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 22:40:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:22,669 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 22:40:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:40:22,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:40:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:23,255 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 22:40:23,255 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 22:40:23,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:40:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 22:40:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 22:40:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 22:40:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 22:40:31,578 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 22:40:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:31,579 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 22:40:31,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:40:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 22:40:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:40:31,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:31,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:31,586 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 22:40:31,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:31,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131668342] [2019-12-27 22:40:31,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:31,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131668342] [2019-12-27 22:40:31,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:31,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:40:31,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883562124] [2019-12-27 22:40:31,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:31,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:31,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:40:31,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:31,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:31,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:40:31,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:31,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:40:31,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:31,653 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 22:40:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:31,789 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 22:40:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:40:31,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:40:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:31,838 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 22:40:31,839 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 22:40:31,839 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-27 22:40:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 22:40:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 22:40:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 22:40:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 22:40:36,802 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 22:40:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:36,802 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 22:40:36,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:40:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 22:40:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 22:40:36,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:36,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:36,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 22:40:36,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:36,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000084994] [2019-12-27 22:40:36,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:36,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000084994] [2019-12-27 22:40:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:36,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:40:36,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010596823] [2019-12-27 22:40:36,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:36,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:36,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 22:40:36,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:36,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:36,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:40:36,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:40:36,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:40:36,963 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 22:40:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:37,483 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 22:40:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:40:37,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 22:40:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:37,558 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 22:40:37,558 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 22:40:37,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:40:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 22:40:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 22:40:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 22:40:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 22:40:38,520 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 22:40:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:38,521 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 22:40:38,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:40:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 22:40:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:40:38,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:38,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:38,531 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 22:40:38,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:38,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383024039] [2019-12-27 22:40:38,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:38,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383024039] [2019-12-27 22:40:38,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:38,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:40:38,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617966694] [2019-12-27 22:40:38,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:38,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:38,659 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 22:40:38,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:38,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:38,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:40:38,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:40:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:40:38,662 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 22:40:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:39,672 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 22:40:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:40:39,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:40:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:39,807 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 22:40:39,807 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 22:40:39,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:40:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 22:40:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 22:40:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 22:40:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 22:40:40,907 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 22:40:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:40,907 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 22:40:40,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:40:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 22:40:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:40:40,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:40,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:40,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 22:40:40,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:40,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53328347] [2019-12-27 22:40:40,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:40,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53328347] [2019-12-27 22:40:40,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:40,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:40:40,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1900997500] [2019-12-27 22:40:40,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:40,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:40,993 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:40:40,993 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:41,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:40:41,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:40:41,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:40:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:40:41,031 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 5 states. [2019-12-27 22:40:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:41,109 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 22:40:41,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:40:41,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:40:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:41,133 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 22:40:41,134 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 22:40:41,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-27 22:40:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 22:40:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 22:40:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 22:40:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 22:40:41,349 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 22:40:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:41,349 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 22:40:41,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:40:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 22:40:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 22:40:41,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:41,360 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] [2019-12-27 22:40:41,360 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 22:40:41,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:41,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106732171] [2019-12-27 22:40:41,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:41,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106732171] [2019-12-27 22:40:41,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:41,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:40:41,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87241232] [2019-12-27 22:40:41,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:41,475 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:41,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 22:40:41,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:41,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:41,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:40:41,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:40:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:40:41,483 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 22:40:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:42,079 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 22:40:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:40:42,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 22:40:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:42,123 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 22:40:42,123 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 22:40:42,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:40:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 22:40:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 22:40:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 22:40:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 22:40:42,514 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 22:40:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:42,514 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 22:40:42,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:40:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 22:40:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:40:42,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:42,533 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] [2019-12-27 22:40:42,533 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 22:40:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:42,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798453531] [2019-12-27 22:40:42,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:42,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798453531] [2019-12-27 22:40:42,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:42,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:40:42,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095284481] [2019-12-27 22:40:42,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:42,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:42,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 22:40:42,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:42,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:42,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:40:42,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:42,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:40:42,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:40:42,891 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 22:40:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:44,191 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 22:40:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:40:44,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 22:40:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:44,227 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 22:40:44,227 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 22:40:44,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:40:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 22:40:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 22:40:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 22:40:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 22:40:44,525 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 22:40:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:44,525 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 22:40:44,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:40:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 22:40:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:40:44,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:44,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:44,548 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 22:40:44,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:44,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502665180] [2019-12-27 22:40:44,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502665180] [2019-12-27 22:40:44,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:44,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:40:44,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [559093501] [2019-12-27 22:40:44,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:44,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:44,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 22:40:44,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:44,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:44,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:40:44,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:40:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:44,686 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 22:40:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:44,766 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 22:40:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:40:44,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:40:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:44,799 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 22:40:44,800 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 22:40:44,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 22:40:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 22:40:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 22:40:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 22:40:45,050 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 22:40:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:45,050 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 22:40:45,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:40:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 22:40:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:40:45,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:45,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:45,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 22:40:45,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:45,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144745436] [2019-12-27 22:40:45,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:45,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144745436] [2019-12-27 22:40:45,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:45,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:40:45,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073959501] [2019-12-27 22:40:45,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:45,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:45,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 198 transitions. [2019-12-27 22:40:45,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:45,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:40:45,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:40:45,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:40:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:40:45,461 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 22:40:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:45,611 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 22:40:45,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:40:45,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:40:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:45,646 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 22:40:45,646 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 22:40:45,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:40:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 22:40:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 22:40:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 22:40:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 22:40:45,926 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 22:40:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:45,926 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 22:40:45,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:40:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 22:40:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:40:45,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:45,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:45,946 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 22:40:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:45,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437893022] [2019-12-27 22:40:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:46,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437893022] [2019-12-27 22:40:46,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:46,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:40:46,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746137119] [2019-12-27 22:40:46,048 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:46,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:46,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 324 transitions. [2019-12-27 22:40:46,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:46,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:40:46,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:40:46,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:40:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:40:46,327 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 11 states. [2019-12-27 22:40:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:47,600 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 22:40:47,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:40:47,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 22:40:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:47,632 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 22:40:47,632 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 22:40:47,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:40:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 22:40:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 22:40:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 22:40:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 22:40:47,938 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 22:40:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:47,938 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 22:40:47,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:40:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 22:40:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:40:47,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:47,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:47,958 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 22:40:47,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:47,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090573137] [2019-12-27 22:40:47,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:48,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090573137] [2019-12-27 22:40:48,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:48,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:40:48,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96709534] [2019-12-27 22:40:48,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:48,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:48,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 450 transitions. [2019-12-27 22:40:48,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:48,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:40:48,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:40:48,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:40:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:40:48,410 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 7 states. [2019-12-27 22:40:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:48,550 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 22:40:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:40:48,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 22:40:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:48,593 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 22:40:48,593 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 22:40:48,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:40:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 22:40:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 22:40:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 22:40:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 22:40:49,041 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 22:40:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:49,041 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 22:40:49,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:40:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 22:40:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:40:49,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:49,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:49,070 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 22:40:49,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:49,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283504214] [2019-12-27 22:40:49,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:49,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-27 22:40:49,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283504214] [2019-12-27 22:40:49,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:49,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:40:49,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868611166] [2019-12-27 22:40:49,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:49,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:49,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 22:40:49,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:49,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:40:49,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:40:49,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:40:49,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:49,396 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 22:40:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:49,524 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 22:40:49,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:40:49,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 22:40:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:49,562 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 22:40:49,563 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 22:40:49,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 22:40:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 22:40:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 22:40:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 22:40:50,217 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 22:40:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:50,218 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 22:40:50,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:40:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 22:40:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:40:50,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:50,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:50,248 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 22:40:50,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:50,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686577846] [2019-12-27 22:40:50,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:50,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686577846] [2019-12-27 22:40:50,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:50,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:40:50,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272549231] [2019-12-27 22:40:50,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:50,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:50,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 22:40:50,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:50,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:40:50,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:40:50,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:40:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:40:50,738 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 11 states. [2019-12-27 22:40:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:51,466 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 22:40:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:40:51,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 22:40:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:51,526 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 22:40:51,527 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 22:40:51,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:40:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 22:40:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 22:40:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 22:40:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 22:40:52,452 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 22:40:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:52,452 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 22:40:52,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:40:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 22:40:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:40:52,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:52,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:52,490 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 22:40:52,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:52,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009778492] [2019-12-27 22:40:52,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:52,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009778492] [2019-12-27 22:40:52,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:52,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:40:52,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1257095598] [2019-12-27 22:40:52,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:52,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:52,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 22:40:52,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:52,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:40:52,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:40:52,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:40:52,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:40:52,949 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 10 states. [2019-12-27 22:40:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:54,437 INFO L93 Difference]: Finished difference Result 132353 states and 401673 transitions. [2019-12-27 22:40:54,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 22:40:54,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 22:40:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:54,588 INFO L225 Difference]: With dead ends: 132353 [2019-12-27 22:40:54,588 INFO L226 Difference]: Without dead ends: 102599 [2019-12-27 22:40:54,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:40:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102599 states. [2019-12-27 22:40:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102599 to 28331. [2019-12-27 22:40:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 22:40:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 22:40:55,957 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 22:40:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:55,957 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 22:40:55,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:40:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 22:40:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:40:55,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:55,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:55,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 22:40:55,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:55,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432172039] [2019-12-27 22:40:55,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:56,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432172039] [2019-12-27 22:40:56,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:56,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:40:56,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458079025] [2019-12-27 22:40:56,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:56,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:56,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:40:56,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:56,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:40:56,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:40:56,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:40:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:40:56,487 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 11 states. [2019-12-27 22:40:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:58,416 INFO L93 Difference]: Finished difference Result 81245 states and 247982 transitions. [2019-12-27 22:40:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:40:58,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 22:40:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:58,534 INFO L225 Difference]: With dead ends: 81245 [2019-12-27 22:40:58,534 INFO L226 Difference]: Without dead ends: 71796 [2019-12-27 22:40:58,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:40:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71796 states. [2019-12-27 22:40:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71796 to 28639. [2019-12-27 22:40:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 22:40:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 22:40:59,399 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 22:40:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:59,399 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 22:40:59,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:40:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 22:40:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:40:59,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:59,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:59,433 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:40:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 22:40:59,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:59,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495821429] [2019-12-27 22:40:59,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:40:59,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495821429] [2019-12-27 22:40:59,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:59,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:40:59,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246613458] [2019-12-27 22:40:59,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:59,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:59,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 307 transitions. [2019-12-27 22:40:59,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:59,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:59,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:40:59,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:40:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:59,714 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 22:41:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:00,121 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 22:41:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:00,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 22:41:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:00,166 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 22:41:00,166 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 22:41:00,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 22:41:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 22:41:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 22:41:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 22:41:00,640 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 22:41:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:00,640 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 22:41:00,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 22:41:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:00,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:00,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:00,671 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:00,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 22:41:00,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:00,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720243854] [2019-12-27 22:41:00,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:00,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720243854] [2019-12-27 22:41:00,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:00,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:41:00,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384740313] [2019-12-27 22:41:00,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:00,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:01,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 22:41:01,033 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:01,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:41:01,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:41:01,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:41:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:41:01,108 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 6 states. [2019-12-27 22:41:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:01,798 INFO L93 Difference]: Finished difference Result 54266 states and 168301 transitions. [2019-12-27 22:41:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:41:01,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:41:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:01,879 INFO L225 Difference]: With dead ends: 54266 [2019-12-27 22:41:01,879 INFO L226 Difference]: Without dead ends: 54266 [2019-12-27 22:41:01,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:41:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54266 states. [2019-12-27 22:41:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54266 to 31050. [2019-12-27 22:41:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31050 states. [2019-12-27 22:41:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31050 states to 31050 states and 96522 transitions. [2019-12-27 22:41:02,863 INFO L78 Accepts]: Start accepts. Automaton has 31050 states and 96522 transitions. Word has length 65 [2019-12-27 22:41:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:02,864 INFO L462 AbstractCegarLoop]: Abstraction has 31050 states and 96522 transitions. [2019-12-27 22:41:02,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:41:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 31050 states and 96522 transitions. [2019-12-27 22:41:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:02,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:02,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:02,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 2 times [2019-12-27 22:41:02,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:02,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390006552] [2019-12-27 22:41:02,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:02,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390006552] [2019-12-27 22:41:02,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:02,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:41:02,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781952437] [2019-12-27 22:41:02,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:03,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:03,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 497 transitions. [2019-12-27 22:41:03,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:03,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:03,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:41:03,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:41:03,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:03,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:41:03,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:41:03,705 INFO L87 Difference]: Start difference. First operand 31050 states and 96522 transitions. Second operand 12 states. [2019-12-27 22:41:06,131 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 22:41:06,867 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 22:41:07,055 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 22:41:07,894 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 22:41:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:10,842 INFO L93 Difference]: Finished difference Result 145008 states and 441349 transitions. [2019-12-27 22:41:10,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 22:41:10,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:41:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:11,037 INFO L225 Difference]: With dead ends: 145008 [2019-12-27 22:41:11,037 INFO L226 Difference]: Without dead ends: 119327 [2019-12-27 22:41:11,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=784, Invalid=3376, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 22:41:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119327 states. [2019-12-27 22:41:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119327 to 31635. [2019-12-27 22:41:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-12-27 22:41:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 98776 transitions. [2019-12-27 22:41:12,709 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 98776 transitions. Word has length 65 [2019-12-27 22:41:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:12,709 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 98776 transitions. [2019-12-27 22:41:12,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:41:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 98776 transitions. [2019-12-27 22:41:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:12,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:12,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:12,742 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 22:41:12,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:12,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139046696] [2019-12-27 22:41:12,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:12,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139046696] [2019-12-27 22:41:12,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:12,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:41:12,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704503995] [2019-12-27 22:41:12,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:12,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:13,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 22:41:13,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:13,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:41:13,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:41:13,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:41:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:41:13,084 INFO L87 Difference]: Start difference. First operand 31635 states and 98776 transitions. Second operand 5 states. [2019-12-27 22:41:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:13,746 INFO L93 Difference]: Finished difference Result 48003 states and 146796 transitions. [2019-12-27 22:41:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:41:13,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:41:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:13,821 INFO L225 Difference]: With dead ends: 48003 [2019-12-27 22:41:13,821 INFO L226 Difference]: Without dead ends: 47783 [2019-12-27 22:41:13,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:41:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47783 states. [2019-12-27 22:41:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47783 to 37821. [2019-12-27 22:41:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37821 states. [2019-12-27 22:41:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37821 states to 37821 states and 117767 transitions. [2019-12-27 22:41:15,006 INFO L78 Accepts]: Start accepts. Automaton has 37821 states and 117767 transitions. Word has length 65 [2019-12-27 22:41:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:15,007 INFO L462 AbstractCegarLoop]: Abstraction has 37821 states and 117767 transitions. [2019-12-27 22:41:15,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:41:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 37821 states and 117767 transitions. [2019-12-27 22:41:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:15,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:15,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:15,048 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 22:41:15,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:15,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23333878] [2019-12-27 22:41:15,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:15,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23333878] [2019-12-27 22:41:15,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:15,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:41:15,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872359191] [2019-12-27 22:41:15,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:15,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:15,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 22:41:15,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:15,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:41:15,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:41:15,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:41:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:41:15,574 INFO L87 Difference]: Start difference. First operand 37821 states and 117767 transitions. Second operand 12 states. [2019-12-27 22:41:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:18,042 INFO L93 Difference]: Finished difference Result 72164 states and 220001 transitions. [2019-12-27 22:41:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 22:41:18,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:41:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:18,158 INFO L225 Difference]: With dead ends: 72164 [2019-12-27 22:41:18,158 INFO L226 Difference]: Without dead ends: 72038 [2019-12-27 22:41:18,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:41:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2019-12-27 22:41:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 40078. [2019-12-27 22:41:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40078 states. [2019-12-27 22:41:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40078 states to 40078 states and 124479 transitions. [2019-12-27 22:41:19,534 INFO L78 Accepts]: Start accepts. Automaton has 40078 states and 124479 transitions. Word has length 65 [2019-12-27 22:41:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:19,534 INFO L462 AbstractCegarLoop]: Abstraction has 40078 states and 124479 transitions. [2019-12-27 22:41:19,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:41:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 40078 states and 124479 transitions. [2019-12-27 22:41:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:19,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:19,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:19,577 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 22:41:19,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:19,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095627236] [2019-12-27 22:41:19,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:19,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095627236] [2019-12-27 22:41:19,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:19,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:41:19,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578554550] [2019-12-27 22:41:19,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:19,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:19,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 248 transitions. [2019-12-27 22:41:19,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:20,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:20,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:20,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:20,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:41:20,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 22:41:20,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 22:41:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:41:20,126 INFO L87 Difference]: Start difference. First operand 40078 states and 124479 transitions. Second operand 18 states. [2019-12-27 22:41:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:32,293 INFO L93 Difference]: Finished difference Result 81164 states and 245805 transitions. [2019-12-27 22:41:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-12-27 22:41:32,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 22:41:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:32,433 INFO L225 Difference]: With dead ends: 81164 [2019-12-27 22:41:32,433 INFO L226 Difference]: Without dead ends: 80840 [2019-12-27 22:41:32,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4009 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1658, Invalid=9472, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 22:41:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80840 states. [2019-12-27 22:41:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80840 to 43229. [2019-12-27 22:41:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43229 states. [2019-12-27 22:41:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43229 states to 43229 states and 134113 transitions. [2019-12-27 22:41:33,413 INFO L78 Accepts]: Start accepts. Automaton has 43229 states and 134113 transitions. Word has length 65 [2019-12-27 22:41:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:33,413 INFO L462 AbstractCegarLoop]: Abstraction has 43229 states and 134113 transitions. [2019-12-27 22:41:33,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 22:41:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43229 states and 134113 transitions. [2019-12-27 22:41:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:33,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:33,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:33,674 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 22:41:33,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:33,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377535480] [2019-12-27 22:41:33,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:33,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377535480] [2019-12-27 22:41:33,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:33,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:33,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764809003] [2019-12-27 22:41:33,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:33,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:33,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 288 transitions. [2019-12-27 22:41:33,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:34,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:41:34,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:41:34,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:41:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:41:34,015 INFO L87 Difference]: Start difference. First operand 43229 states and 134113 transitions. Second operand 6 states. [2019-12-27 22:41:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:34,599 INFO L93 Difference]: Finished difference Result 42625 states and 129622 transitions. [2019-12-27 22:41:34,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:41:34,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:41:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:34,659 INFO L225 Difference]: With dead ends: 42625 [2019-12-27 22:41:34,660 INFO L226 Difference]: Without dead ends: 42625 [2019-12-27 22:41:34,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:41:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42625 states. [2019-12-27 22:41:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42625 to 32472. [2019-12-27 22:41:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32472 states. [2019-12-27 22:41:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32472 states to 32472 states and 98949 transitions. [2019-12-27 22:41:35,221 INFO L78 Accepts]: Start accepts. Automaton has 32472 states and 98949 transitions. Word has length 65 [2019-12-27 22:41:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:35,221 INFO L462 AbstractCegarLoop]: Abstraction has 32472 states and 98949 transitions. [2019-12-27 22:41:35,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:41:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32472 states and 98949 transitions. [2019-12-27 22:41:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:41:35,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:35,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:35,261 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash 199812966, now seen corresponding path program 1 times [2019-12-27 22:41:35,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:35,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682826855] [2019-12-27 22:41:35,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:35,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682826855] [2019-12-27 22:41:35,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:35,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:41:35,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62683673] [2019-12-27 22:41:35,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:35,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:35,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 689 transitions. [2019-12-27 22:41:35,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:36,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 22:41:36,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:41:36,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:36,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:41:36,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:41:36,487 INFO L87 Difference]: Start difference. First operand 32472 states and 98949 transitions. Second operand 19 states. [2019-12-27 22:41:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:42,135 INFO L93 Difference]: Finished difference Result 49641 states and 147651 transitions. [2019-12-27 22:41:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 22:41:42,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 22:41:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:42,204 INFO L225 Difference]: With dead ends: 49641 [2019-12-27 22:41:42,204 INFO L226 Difference]: Without dead ends: 49641 [2019-12-27 22:41:42,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=548, Invalid=3112, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 22:41:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49641 states. [2019-12-27 22:41:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49641 to 32140. [2019-12-27 22:41:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32140 states. [2019-12-27 22:41:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32140 states to 32140 states and 98157 transitions. [2019-12-27 22:41:42,840 INFO L78 Accepts]: Start accepts. Automaton has 32140 states and 98157 transitions. Word has length 66 [2019-12-27 22:41:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:42,840 INFO L462 AbstractCegarLoop]: Abstraction has 32140 states and 98157 transitions. [2019-12-27 22:41:42,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 22:41:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32140 states and 98157 transitions. [2019-12-27 22:41:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:41:42,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:42,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:42,877 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1022991488, now seen corresponding path program 2 times [2019-12-27 22:41:42,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:42,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779817398] [2019-12-27 22:41:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:42,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779817398] [2019-12-27 22:41:42,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:42,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:41:42,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317629439] [2019-12-27 22:41:42,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:43,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:43,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 507 transitions. [2019-12-27 22:41:43,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:43,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:41:43,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:41:43,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:43,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:41:43,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:41:43,943 INFO L87 Difference]: Start difference. First operand 32140 states and 98157 transitions. Second operand 15 states. [2019-12-27 22:41:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:46,843 INFO L93 Difference]: Finished difference Result 58478 states and 176840 transitions. [2019-12-27 22:41:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:41:46,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 22:41:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:46,907 INFO L225 Difference]: With dead ends: 58478 [2019-12-27 22:41:46,907 INFO L226 Difference]: Without dead ends: 45710 [2019-12-27 22:41:46,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-27 22:41:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45710 states. [2019-12-27 22:41:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45710 to 32566. [2019-12-27 22:41:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32566 states. [2019-12-27 22:41:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32566 states to 32566 states and 99021 transitions. [2019-12-27 22:41:47,476 INFO L78 Accepts]: Start accepts. Automaton has 32566 states and 99021 transitions. Word has length 66 [2019-12-27 22:41:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:47,477 INFO L462 AbstractCegarLoop]: Abstraction has 32566 states and 99021 transitions. [2019-12-27 22:41:47,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:41:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32566 states and 99021 transitions. [2019-12-27 22:41:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:41:47,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:47,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:47,510 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1990266554, now seen corresponding path program 1 times [2019-12-27 22:41:47,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:47,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767205117] [2019-12-27 22:41:47,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:47,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767205117] [2019-12-27 22:41:47,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:47,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:41:47,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387204924] [2019-12-27 22:41:47,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:47,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:47,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 246 states and 469 transitions. [2019-12-27 22:41:47,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:47,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:41:47,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:41:47,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:47,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:41:47,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:41:47,813 INFO L87 Difference]: Start difference. First operand 32566 states and 99021 transitions. Second operand 4 states. [2019-12-27 22:41:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:48,128 INFO L93 Difference]: Finished difference Result 32566 states and 98734 transitions. [2019-12-27 22:41:48,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:41:48,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 22:41:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:48,172 INFO L225 Difference]: With dead ends: 32566 [2019-12-27 22:41:48,172 INFO L226 Difference]: Without dead ends: 32566 [2019-12-27 22:41:48,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:41:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32566 states. [2019-12-27 22:41:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32566 to 30014. [2019-12-27 22:41:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30014 states. [2019-12-27 22:41:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30014 states to 30014 states and 90959 transitions. [2019-12-27 22:41:48,626 INFO L78 Accepts]: Start accepts. Automaton has 30014 states and 90959 transitions. Word has length 66 [2019-12-27 22:41:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:48,626 INFO L462 AbstractCegarLoop]: Abstraction has 30014 states and 90959 transitions. [2019-12-27 22:41:48,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:41:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30014 states and 90959 transitions. [2019-12-27 22:41:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:41:48,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:48,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:48,658 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash -855039682, now seen corresponding path program 3 times [2019-12-27 22:41:48,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:48,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598520052] [2019-12-27 22:41:48,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:48,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598520052] [2019-12-27 22:41:48,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:48,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:41:48,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358852265] [2019-12-27 22:41:48,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:48,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:49,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 338 transitions. [2019-12-27 22:41:49,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:49,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:49,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:41:49,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:41:49,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:41:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:41:49,385 INFO L87 Difference]: Start difference. First operand 30014 states and 90959 transitions. Second operand 17 states. [2019-12-27 22:41:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:51,943 INFO L93 Difference]: Finished difference Result 65617 states and 196801 transitions. [2019-12-27 22:41:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 22:41:51,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 22:41:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:52,016 INFO L225 Difference]: With dead ends: 65617 [2019-12-27 22:41:52,016 INFO L226 Difference]: Without dead ends: 51571 [2019-12-27 22:41:52,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1207, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:41:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51571 states. [2019-12-27 22:41:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51571 to 28826. [2019-12-27 22:41:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28826 states. [2019-12-27 22:41:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28826 states to 28826 states and 87192 transitions. [2019-12-27 22:41:52,907 INFO L78 Accepts]: Start accepts. Automaton has 28826 states and 87192 transitions. Word has length 66 [2019-12-27 22:41:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:52,908 INFO L462 AbstractCegarLoop]: Abstraction has 28826 states and 87192 transitions. [2019-12-27 22:41:52,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:41:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28826 states and 87192 transitions. [2019-12-27 22:41:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:41:52,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:52,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:52,938 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -503134108, now seen corresponding path program 4 times [2019-12-27 22:41:52,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:52,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311625777] [2019-12-27 22:41:52,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:53,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311625777] [2019-12-27 22:41:53,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:53,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:53,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749018171] [2019-12-27 22:41:53,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:53,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:53,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 398 transitions. [2019-12-27 22:41:53,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:53,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:53,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:41:53,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:53,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:41:53,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:53,294 INFO L87 Difference]: Start difference. First operand 28826 states and 87192 transitions. Second operand 3 states. [2019-12-27 22:41:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:53,430 INFO L93 Difference]: Finished difference Result 28826 states and 87191 transitions. [2019-12-27 22:41:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:53,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:41:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:53,484 INFO L225 Difference]: With dead ends: 28826 [2019-12-27 22:41:53,485 INFO L226 Difference]: Without dead ends: 28826 [2019-12-27 22:41:53,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28826 states. [2019-12-27 22:41:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28826 to 22565. [2019-12-27 22:41:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22565 states. [2019-12-27 22:41:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22565 states to 22565 states and 69477 transitions. [2019-12-27 22:41:54,147 INFO L78 Accepts]: Start accepts. Automaton has 22565 states and 69477 transitions. Word has length 66 [2019-12-27 22:41:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:54,147 INFO L462 AbstractCegarLoop]: Abstraction has 22565 states and 69477 transitions. [2019-12-27 22:41:54,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22565 states and 69477 transitions. [2019-12-27 22:41:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:41:54,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:54,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:54,183 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:41:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 1 times [2019-12-27 22:41:54,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:54,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147926796] [2019-12-27 22:41:54,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:54,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147926796] [2019-12-27 22:41:54,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:54,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:41:54,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969046216] [2019-12-27 22:41:54,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:54,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:54,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 22:41:54,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:55,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:41:55,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:41:55,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:41:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:41:56,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 22:41:56,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 22:41:56,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 22:41:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:41:56,087 INFO L87 Difference]: Start difference. First operand 22565 states and 69477 transitions. Second operand 27 states. [2019-12-27 22:42:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:04,078 INFO L93 Difference]: Finished difference Result 39701 states and 120513 transitions. [2019-12-27 22:42:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 22:42:04,078 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-12-27 22:42:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:04,132 INFO L225 Difference]: With dead ends: 39701 [2019-12-27 22:42:04,132 INFO L226 Difference]: Without dead ends: 39164 [2019-12-27 22:42:04,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=540, Invalid=3242, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 22:42:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39164 states. [2019-12-27 22:42:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39164 to 22311. [2019-12-27 22:42:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22311 states. [2019-12-27 22:42:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22311 states to 22311 states and 68833 transitions. [2019-12-27 22:42:04,552 INFO L78 Accepts]: Start accepts. Automaton has 22311 states and 68833 transitions. Word has length 67 [2019-12-27 22:42:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:04,552 INFO L462 AbstractCegarLoop]: Abstraction has 22311 states and 68833 transitions. [2019-12-27 22:42:04,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 22:42:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22311 states and 68833 transitions. [2019-12-27 22:42:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:42:04,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:04,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:04,574 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 2 times [2019-12-27 22:42:04,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:04,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733272779] [2019-12-27 22:42:04,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:04,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:42:04,674 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:42:04,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_17|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_23|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_23| 1)) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_23| 4)) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_23|) 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_23|) |v_ULTIMATE.start_main_~#t2287~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_23|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_17|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 22:42:04,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-27 22:42:04,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out1809151988 ~z$w_buff0_used~0_In1809151988) (= P0Thread1of1ForFork0_~arg.offset_Out1809151988 |P0Thread1of1ForFork0_#in~arg.offset_In1809151988|) (= ~z$w_buff1~0_Out1809151988 ~z$w_buff0~0_In1809151988) (= ~z$w_buff0_used~0_Out1809151988 1) (= 0 (mod ~z$w_buff1_used~0_Out1809151988 256)) (= ~z$w_buff0~0_Out1809151988 1) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1809151988|) (= |P0Thread1of1ForFork0_#in~arg.base_In1809151988| P0Thread1of1ForFork0_~arg.base_Out1809151988) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1809151988| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1809151988)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1809151988|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1809151988, ~z$w_buff0~0=~z$w_buff0~0_In1809151988, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1809151988|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1809151988|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1809151988, ~z$w_buff0~0=~z$w_buff0~0_Out1809151988, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1809151988, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1809151988, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1809151988|, ~z$w_buff1~0=~z$w_buff1~0_Out1809151988, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1809151988, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1809151988|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1809151988} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:42:04,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-27 22:42:04,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1837161317 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1837161317 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out1837161317| |P1Thread1of1ForFork1_#t~ite10_Out1837161317|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1837161317| ~z$w_buff1~0_In1837161317) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1837161317| ~z~0_In1837161317) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1837161317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1837161317, ~z$w_buff1~0=~z$w_buff1~0_In1837161317, ~z~0=~z~0_In1837161317} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1837161317|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1837161317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1837161317, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1837161317|, ~z$w_buff1~0=~z$w_buff1~0_In1837161317, ~z~0=~z~0_In1837161317} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 22:42:04,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2121135927 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In2121135927 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out2121135927| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out2121135927| ~z$w_buff0_used~0_In2121135927)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121135927, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2121135927} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2121135927, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2121135927|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2121135927} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:42:04,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-1068447071 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1068447071 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1068447071 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1068447071 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1068447071 |P1Thread1of1ForFork1_#t~ite12_Out-1068447071|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1068447071|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068447071, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1068447071, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1068447071, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1068447071} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068447071, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1068447071, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1068447071, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1068447071|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1068447071} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:42:04,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1963548931 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1963548931 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In1963548931 |P1Thread1of1ForFork1_#t~ite13_Out1963548931|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1963548931|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1963548931, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1963548931} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1963548931, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1963548931|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1963548931} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:42:04,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In425588023 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In425588023 256) 0))) (or (= (mod ~z$w_buff0_used~0_In425588023 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In425588023 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In425588023 256) 0)))) (= ~z$w_buff1~0_In425588023 |P2Thread1of1ForFork2_#t~ite23_Out425588023|) (= |P2Thread1of1ForFork2_#t~ite24_Out425588023| |P2Thread1of1ForFork2_#t~ite23_Out425588023|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In425588023| |P2Thread1of1ForFork2_#t~ite23_Out425588023|) (= ~z$w_buff1~0_In425588023 |P2Thread1of1ForFork2_#t~ite24_Out425588023|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In425588023|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In425588023, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In425588023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In425588023, ~z$w_buff1~0=~z$w_buff1~0_In425588023, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In425588023, ~weak$$choice2~0=~weak$$choice2~0_In425588023} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out425588023|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out425588023|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In425588023, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In425588023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In425588023, ~z$w_buff1~0=~z$w_buff1~0_In425588023, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In425588023, ~weak$$choice2~0=~weak$$choice2~0_In425588023} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 22:42:04,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-932452580 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out-932452580| ~z$w_buff0_used~0_In-932452580) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-932452580 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-932452580 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-932452580 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In-932452580 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite26_Out-932452580| |P2Thread1of1ForFork2_#t~ite27_Out-932452580|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In-932452580| |P2Thread1of1ForFork2_#t~ite26_Out-932452580|) (= |P2Thread1of1ForFork2_#t~ite27_Out-932452580| ~z$w_buff0_used~0_In-932452580)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-932452580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-932452580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-932452580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932452580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-932452580, ~weak$$choice2~0=~weak$$choice2~0_In-932452580} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-932452580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-932452580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-932452580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932452580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-932452580, ~weak$$choice2~0=~weak$$choice2~0_In-932452580, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-932452580|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 22:42:04,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-96238427 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-96238427 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-96238427 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-96238427 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-96238427| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-96238427| ~z$r_buff1_thd2~0_In-96238427) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-96238427, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-96238427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-96238427, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-96238427} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-96238427, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-96238427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-96238427, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-96238427|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-96238427} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:42:04,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:42:04,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-811213470 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-811213470 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-811213470 256)) (and .cse0 (= (mod ~z$w_buff1_used~0_In-811213470 256) 0)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-811213470 256) 0)))) (= ~z$w_buff1_used~0_In-811213470 |P2Thread1of1ForFork2_#t~ite29_Out-811213470|) (= |P2Thread1of1ForFork2_#t~ite30_Out-811213470| |P2Thread1of1ForFork2_#t~ite29_Out-811213470|) .cse1) (and (not .cse1) (= ~z$w_buff1_used~0_In-811213470 |P2Thread1of1ForFork2_#t~ite30_Out-811213470|) (= |P2Thread1of1ForFork2_#t~ite29_In-811213470| |P2Thread1of1ForFork2_#t~ite29_Out-811213470|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-811213470, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-811213470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-811213470, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-811213470, ~weak$$choice2~0=~weak$$choice2~0_In-811213470, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-811213470|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-811213470|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-811213470, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-811213470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-811213470, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-811213470, ~weak$$choice2~0=~weak$$choice2~0_In-811213470, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-811213470|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 22:42:04,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 22:42:04,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 22:42:04,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In466247648 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In466247648 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In466247648 |P0Thread1of1ForFork0_#t~ite5_Out466247648|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out466247648|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In466247648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In466247648} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out466247648|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In466247648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In466247648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:42:04,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1823801994 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1823801994 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1823801994 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1823801994 256) 0))) (or (and (= ~z$w_buff1_used~0_In1823801994 |P0Thread1of1ForFork0_#t~ite6_Out1823801994|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1823801994|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1823801994, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1823801994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1823801994, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1823801994} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1823801994|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1823801994, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1823801994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1823801994, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1823801994} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:42:04,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In861161898 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In861161898 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In861161898 ~z$r_buff0_thd1~0_Out861161898)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out861161898)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In861161898, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In861161898} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In861161898, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out861161898|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out861161898} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:42:04,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In428140566 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In428140566 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In428140566 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In428140566 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out428140566| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out428140566| ~z$r_buff1_thd1~0_In428140566) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In428140566, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In428140566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In428140566, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In428140566} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In428140566, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out428140566|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In428140566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In428140566, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In428140566} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:42:04,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:42:04,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In452296733 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In452296733 256))) (.cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out452296733| |P2Thread1of1ForFork2_#t~ite39_Out452296733|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out452296733| ~z$w_buff1~0_In452296733)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out452296733| ~z~0_In452296733) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In452296733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452296733, ~z$w_buff1~0=~z$w_buff1~0_In452296733, ~z~0=~z~0_In452296733} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In452296733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452296733, ~z$w_buff1~0=~z$w_buff1~0_In452296733, ~z~0=~z~0_In452296733, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out452296733|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out452296733|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 22:42:04,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In740197813 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In740197813 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out740197813| ~z$w_buff0_used~0_In740197813)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out740197813| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In740197813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In740197813} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In740197813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In740197813, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out740197813|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 22:42:04,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1998952236 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1998952236 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1998952236 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1998952236 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1998952236 |P2Thread1of1ForFork2_#t~ite41_Out1998952236|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1998952236|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1998952236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1998952236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1998952236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1998952236} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1998952236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998952236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1998952236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1998952236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1998952236} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 22:42:04,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In977273128 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In977273128 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In977273128 |P2Thread1of1ForFork2_#t~ite42_Out977273128|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out977273128|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In977273128, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In977273128} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out977273128|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In977273128, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In977273128} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 22:42:04,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1723224137 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1723224137 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1723224137 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1723224137 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out1723224137| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1723224137 |P2Thread1of1ForFork2_#t~ite43_Out1723224137|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1723224137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1723224137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1723224137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1723224137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1723224137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1723224137, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1723224137|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1723224137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1723224137} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 22:42:04,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:42:04,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: 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{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:42:04,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1954782358| |ULTIMATE.start_main_#t~ite47_Out-1954782358|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1954782358 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1954782358 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-1954782358 |ULTIMATE.start_main_#t~ite47_Out-1954782358|)) (and (= ~z~0_In-1954782358 |ULTIMATE.start_main_#t~ite47_Out-1954782358|) .cse0 (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1954782358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1954782358, ~z$w_buff1~0=~z$w_buff1~0_In-1954782358, ~z~0=~z~0_In-1954782358} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1954782358, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1954782358|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1954782358, ~z$w_buff1~0=~z$w_buff1~0_In-1954782358, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1954782358|, ~z~0=~z~0_In-1954782358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:42:04,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-378615182 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-378615182 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-378615182|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-378615182 |ULTIMATE.start_main_#t~ite49_Out-378615182|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-378615182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-378615182} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-378615182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-378615182, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-378615182|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 22:42:04,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1847546940 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1847546940 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1847546940 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1847546940 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1847546940| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1847546940 |ULTIMATE.start_main_#t~ite50_Out-1847546940|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1847546940, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1847546940, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1847546940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1847546940} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1847546940|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1847546940, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1847546940, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1847546940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1847546940} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 22:42:04,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1983348661 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1983348661 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1983348661 |ULTIMATE.start_main_#t~ite51_Out-1983348661|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1983348661|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1983348661, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983348661} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1983348661, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1983348661|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983348661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 22:42:04,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1249124767 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1249124767 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1249124767 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1249124767 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1249124767| ~z$r_buff1_thd0~0_In-1249124767) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1249124767| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1249124767, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1249124767, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1249124767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1249124767} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1249124767|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1249124767, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1249124767, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1249124767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1249124767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 22:42:04,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:42:04,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:42:04 BasicIcfg [2019-12-27 22:42:04,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:42:04,776 INFO L168 Benchmark]: Toolchain (without parser) took 146688.88 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,777 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.80 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.7 MB in the beginning and 154.9 MB in the end (delta: -52.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.49 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,778 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,778 INFO L168 Benchmark]: RCFGBuilder took 881.72 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 99.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,779 INFO L168 Benchmark]: TraceAbstraction took 144873.61 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:42:04,781 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.62 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.80 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.7 MB in the beginning and 154.9 MB in the end (delta: -52.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.49 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.72 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 99.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144873.61 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 66.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7572 SDtfs, 13429 SDslu, 34180 SDs, 0 SdLazy, 30873 SolverSat, 810 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 870 GetRequests, 213 SyntacticMatches, 126 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8239 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 43.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 480522 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1387 ConstructedInterpolants, 0 QuantifiedInterpolants, 289246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...