/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:26:23,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:26:23,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:26:23,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:26:23,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:26:23,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:26:23,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:26:23,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:26:23,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:26:23,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:26:23,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:26:23,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:26:23,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:26:23,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:26:23,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:26:23,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:26:23,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:26:23,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:26:23,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:26:23,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:26:23,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:26:23,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:26:23,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:26:23,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:26:23,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:26:23,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:26:23,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:26:23,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:26:23,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:26:23,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:26:23,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:26:23,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:26:23,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:26:23,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:26:23,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:26:23,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:26:23,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:26:23,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:26:23,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:26:23,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:26:23,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:26:23,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:26:23,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:26:23,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:26:23,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:26:23,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:26:23,998 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:26:23,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:26:23,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:26:23,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:26:23,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:26:23,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:26:23,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:26:24,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:26:24,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:26:24,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:26:24,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:26:24,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:26:24,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:26:24,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:26:24,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:26:24,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:26:24,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:26:24,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:26:24,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:26:24,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:26:24,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:26:24,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:26:24,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:26:24,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:26:24,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:26:24,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:26:24,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:26:24,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:26:24,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:26:24,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:26:24,284 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:26:24,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-18 20:26:24,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd45e27/a6223229522248d491ba71936914057f/FLAG578b87256 [2019-12-18 20:26:24,931 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:26:24,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-18 20:26:24,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd45e27/a6223229522248d491ba71936914057f/FLAG578b87256 [2019-12-18 20:26:25,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd45e27/a6223229522248d491ba71936914057f [2019-12-18 20:26:25,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:26:25,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:26:25,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:26:25,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:26:25,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:26:25,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:25,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9bda4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25, skipping insertion in model container [2019-12-18 20:26:25,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:25,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:26:25,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:26:25,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:26:25,829 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:26:25,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:26:25,990 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:26:25,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25 WrapperNode [2019-12-18 20:26:25,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:26:25,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:26:25,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:26:25,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:26:26,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:26:26,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:26:26,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:26:26,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:26:26,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... [2019-12-18 20:26:26,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:26:26,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:26:26,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:26:26,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:26:26,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:26:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:26:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:26:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:26:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:26:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:26:26,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:26:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:26:26,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:26:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:26:26,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:26:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:26:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:26:26,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:26:26,172 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:26:26,927 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:26:26,927 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:26:26,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:26:26 BoogieIcfgContainer [2019-12-18 20:26:26,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:26:26,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:26:26,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:26:26,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:26:26,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:26:25" (1/3) ... [2019-12-18 20:26:26,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23597b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:26:26, skipping insertion in model container [2019-12-18 20:26:26,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:25" (2/3) ... [2019-12-18 20:26:26,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23597b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:26:26, skipping insertion in model container [2019-12-18 20:26:26,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:26:26" (3/3) ... [2019-12-18 20:26:26,939 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.oepc.i [2019-12-18 20:26:26,950 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:26:26,950 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:26:26,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:26:26,965 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:26:27,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,051 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,081 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:27,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:26:27,133 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:26:27,134 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:26:27,134 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:26:27,134 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:26:27,134 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:26:27,134 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:26:27,134 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:26:27,134 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:26:27,151 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 20:26:27,153 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 20:26:27,239 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 20:26:27,239 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:26:27,259 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:26:27,287 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 20:26:27,339 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 20:26:27,340 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:26:27,355 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:26:27,377 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:26:27,378 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:26:30,741 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-18 20:26:30,865 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-18 20:26:31,098 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:26:31,218 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 20:26:31,247 INFO L206 etLargeBlockEncoding]: Checked pairs total: 92501 [2019-12-18 20:26:31,248 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 20:26:31,252 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-18 20:26:47,937 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-18 20:26:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-18 20:26:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:26:47,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:47,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:26:47,947 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-18 20:26:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash 918816, now seen corresponding path program 1 times [2019-12-18 20:26:47,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:47,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85938403] [2019-12-18 20:26:47,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:48,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85938403] [2019-12-18 20:26:48,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:48,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:26:48,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207821996] [2019-12-18 20:26:48,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:48,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:48,212 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-18 20:26:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:49,448 INFO L93 Difference]: Finished difference Result 108764 states and 466654 transitions. [2019-12-18 20:26:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:49,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:26:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:52,839 INFO L225 Difference]: With dead ends: 108764 [2019-12-18 20:26:52,839 INFO L226 Difference]: Without dead ends: 102524 [2019-12-18 20:26:52,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102524 states. [2019-12-18 20:26:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102524 to 102524. [2019-12-18 20:26:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102524 states. [2019-12-18 20:26:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102524 states to 102524 states and 439302 transitions. [2019-12-18 20:26:59,682 INFO L78 Accepts]: Start accepts. Automaton has 102524 states and 439302 transitions. Word has length 3 [2019-12-18 20:26:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:59,682 INFO L462 AbstractCegarLoop]: Abstraction has 102524 states and 439302 transitions. [2019-12-18 20:26:59,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 102524 states and 439302 transitions. [2019-12-18 20:26:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:26:59,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:59,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:59,687 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-18 20:26:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 289019227, now seen corresponding path program 1 times [2019-12-18 20:26:59,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:59,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159151362] [2019-12-18 20:26:59,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:59,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159151362] [2019-12-18 20:26:59,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:59,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:26:59,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688423329] [2019-12-18 20:26:59,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:26:59,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:26:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:26:59,838 INFO L87 Difference]: Start difference. First operand 102524 states and 439302 transitions. Second operand 4 states. [2019-12-18 20:27:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:04,390 INFO L93 Difference]: Finished difference Result 163542 states and 670978 transitions. [2019-12-18 20:27:04,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:04,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:27:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:05,231 INFO L225 Difference]: With dead ends: 163542 [2019-12-18 20:27:05,231 INFO L226 Difference]: Without dead ends: 163493 [2019-12-18 20:27:05,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163493 states. [2019-12-18 20:27:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163493 to 148037. [2019-12-18 20:27:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148037 states. [2019-12-18 20:27:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148037 states to 148037 states and 616165 transitions. [2019-12-18 20:27:18,047 INFO L78 Accepts]: Start accepts. Automaton has 148037 states and 616165 transitions. Word has length 11 [2019-12-18 20:27:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:18,047 INFO L462 AbstractCegarLoop]: Abstraction has 148037 states and 616165 transitions. [2019-12-18 20:27:18,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 148037 states and 616165 transitions. [2019-12-18 20:27:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:27:18,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:18,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:18,052 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-18 20:27:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1142061067, now seen corresponding path program 1 times [2019-12-18 20:27:18,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:18,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751669113] [2019-12-18 20:27:18,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:18,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751669113] [2019-12-18 20:27:18,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:18,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:18,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850911972] [2019-12-18 20:27:18,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:18,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:18,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:18,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:18,157 INFO L87 Difference]: Start difference. First operand 148037 states and 616165 transitions. Second operand 4 states. [2019-12-18 20:27:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:25,153 INFO L93 Difference]: Finished difference Result 208653 states and 848099 transitions. [2019-12-18 20:27:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:25,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:27:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:25,804 INFO L225 Difference]: With dead ends: 208653 [2019-12-18 20:27:25,804 INFO L226 Difference]: Without dead ends: 208597 [2019-12-18 20:27:25,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208597 states. [2019-12-18 20:27:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208597 to 175408. [2019-12-18 20:27:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175408 states. [2019-12-18 20:27:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175408 states to 175408 states and 726040 transitions. [2019-12-18 20:27:35,653 INFO L78 Accepts]: Start accepts. Automaton has 175408 states and 726040 transitions. Word has length 13 [2019-12-18 20:27:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:35,654 INFO L462 AbstractCegarLoop]: Abstraction has 175408 states and 726040 transitions. [2019-12-18 20:27:35,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 175408 states and 726040 transitions. [2019-12-18 20:27:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:27:35,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:35,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:35,663 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-18 20:27:35,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:35,663 INFO L82 PathProgramCache]: Analyzing trace with hash 600624420, now seen corresponding path program 1 times [2019-12-18 20:27:35,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:35,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033770633] [2019-12-18 20:27:35,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:35,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033770633] [2019-12-18 20:27:35,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:35,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:35,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089381569] [2019-12-18 20:27:35,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:35,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:35,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:35,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:35,756 INFO L87 Difference]: Start difference. First operand 175408 states and 726040 transitions. Second operand 4 states. [2019-12-18 20:27:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:43,366 INFO L93 Difference]: Finished difference Result 219619 states and 903918 transitions. [2019-12-18 20:27:43,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:43,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:27:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:43,984 INFO L225 Difference]: With dead ends: 219619 [2019-12-18 20:27:43,984 INFO L226 Difference]: Without dead ends: 219619 [2019-12-18 20:27:43,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219619 states. [2019-12-18 20:27:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219619 to 188404. [2019-12-18 20:27:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188404 states. [2019-12-18 20:27:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188404 states to 188404 states and 779982 transitions. [2019-12-18 20:27:57,779 INFO L78 Accepts]: Start accepts. Automaton has 188404 states and 779982 transitions. Word has length 16 [2019-12-18 20:27:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:57,779 INFO L462 AbstractCegarLoop]: Abstraction has 188404 states and 779982 transitions. [2019-12-18 20:27:57,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 188404 states and 779982 transitions. [2019-12-18 20:27:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:27:57,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:57,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:57,788 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-18 20:27:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash 600531203, now seen corresponding path program 1 times [2019-12-18 20:27:57,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:57,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090039049] [2019-12-18 20:27:57,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:57,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090039049] [2019-12-18 20:27:57,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:57,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:57,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559609445] [2019-12-18 20:27:57,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:57,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:57,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:57,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:57,927 INFO L87 Difference]: Start difference. First operand 188404 states and 779982 transitions. Second operand 4 states. [2019-12-18 20:28:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:06,601 INFO L93 Difference]: Finished difference Result 228266 states and 940523 transitions. [2019-12-18 20:28:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:28:06,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:28:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:07,358 INFO L225 Difference]: With dead ends: 228266 [2019-12-18 20:28:07,358 INFO L226 Difference]: Without dead ends: 228266 [2019-12-18 20:28:07,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228266 states. [2019-12-18 20:28:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228266 to 187436. [2019-12-18 20:28:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187436 states. [2019-12-18 20:28:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187436 states to 187436 states and 775963 transitions. [2019-12-18 20:28:16,630 INFO L78 Accepts]: Start accepts. Automaton has 187436 states and 775963 transitions. Word has length 16 [2019-12-18 20:28:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:16,630 INFO L462 AbstractCegarLoop]: Abstraction has 187436 states and 775963 transitions. [2019-12-18 20:28:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:28:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 187436 states and 775963 transitions. [2019-12-18 20:28:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:28:16,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:16,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:28:16,644 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-18 20:28:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 5796283, now seen corresponding path program 1 times [2019-12-18 20:28:16,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:16,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465090737] [2019-12-18 20:28:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:16,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465090737] [2019-12-18 20:28:16,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:16,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:28:16,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134938465] [2019-12-18 20:28:16,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:16,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:16,696 INFO L87 Difference]: Start difference. First operand 187436 states and 775963 transitions. Second operand 3 states. [2019-12-18 20:28:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:18,950 INFO L93 Difference]: Finished difference Result 187072 states and 774536 transitions. [2019-12-18 20:28:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:18,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 20:28:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:19,491 INFO L225 Difference]: With dead ends: 187072 [2019-12-18 20:28:19,491 INFO L226 Difference]: Without dead ends: 187072 [2019-12-18 20:28:19,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187072 states. [2019-12-18 20:28:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187072 to 187072. [2019-12-18 20:28:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187072 states. [2019-12-18 20:28:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187072 states to 187072 states and 774536 transitions. [2019-12-18 20:28:35,523 INFO L78 Accepts]: Start accepts. Automaton has 187072 states and 774536 transitions. Word has length 18 [2019-12-18 20:28:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:35,524 INFO L462 AbstractCegarLoop]: Abstraction has 187072 states and 774536 transitions. [2019-12-18 20:28:35,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 187072 states and 774536 transitions. [2019-12-18 20:28:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 20:28:35,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:35,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:28:35,540 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-18 20:28:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash 468168812, now seen corresponding path program 1 times [2019-12-18 20:28:35,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:35,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314466396] [2019-12-18 20:28:35,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:35,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314466396] [2019-12-18 20:28:35,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:35,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:28:35,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360825944] [2019-12-18 20:28:35,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:35,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:35,611 INFO L87 Difference]: Start difference. First operand 187072 states and 774536 transitions. Second operand 3 states. [2019-12-18 20:28:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:43,104 INFO L93 Difference]: Finished difference Result 176234 states and 721440 transitions. [2019-12-18 20:28:43,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:43,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 20:28:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:43,619 INFO L225 Difference]: With dead ends: 176234 [2019-12-18 20:28:43,619 INFO L226 Difference]: Without dead ends: 176234 [2019-12-18 20:28:43,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176234 states. [2019-12-18 20:28:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176234 to 173102. [2019-12-18 20:28:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173102 states. [2019-12-18 20:28:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173102 states to 173102 states and 709856 transitions. [2019-12-18 20:28:51,641 INFO L78 Accepts]: Start accepts. Automaton has 173102 states and 709856 transitions. Word has length 19 [2019-12-18 20:28:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:51,641 INFO L462 AbstractCegarLoop]: Abstraction has 173102 states and 709856 transitions. [2019-12-18 20:28:51,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 173102 states and 709856 transitions. [2019-12-18 20:28:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 20:28:51,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:51,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:28:51,655 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-18 20:28:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1103194291, now seen corresponding path program 1 times [2019-12-18 20:28:51,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:51,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364927997] [2019-12-18 20:28:51,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:51,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364927997] [2019-12-18 20:28:51,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:51,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:51,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388876702] [2019-12-18 20:28:51,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:28:51,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:51,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:28:51,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:51,793 INFO L87 Difference]: Start difference. First operand 173102 states and 709856 transitions. Second operand 5 states. [2019-12-18 20:28:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:59,564 INFO L93 Difference]: Finished difference Result 255071 states and 1025623 transitions. [2019-12-18 20:28:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:28:59,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 20:28:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:00,277 INFO L225 Difference]: With dead ends: 255071 [2019-12-18 20:29:00,277 INFO L226 Difference]: Without dead ends: 254980 [2019-12-18 20:29:00,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:29:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254980 states. [2019-12-18 20:29:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254980 to 184835. [2019-12-18 20:29:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184835 states. [2019-12-18 20:29:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184835 states to 184835 states and 757464 transitions. [2019-12-18 20:29:10,594 INFO L78 Accepts]: Start accepts. Automaton has 184835 states and 757464 transitions. Word has length 19 [2019-12-18 20:29:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:10,594 INFO L462 AbstractCegarLoop]: Abstraction has 184835 states and 757464 transitions. [2019-12-18 20:29:10,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:29:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 184835 states and 757464 transitions. [2019-12-18 20:29:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 20:29:10,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:10,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:29:10,608 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-18 20:29:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash 782684069, now seen corresponding path program 1 times [2019-12-18 20:29:10,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:10,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058937792] [2019-12-18 20:29:10,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:10,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058937792] [2019-12-18 20:29:10,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:10,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:10,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824093384] [2019-12-18 20:29:10,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:29:10,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:29:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:29:10,681 INFO L87 Difference]: Start difference. First operand 184835 states and 757464 transitions. Second operand 4 states. [2019-12-18 20:29:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:10,912 INFO L93 Difference]: Finished difference Result 50550 states and 173110 transitions. [2019-12-18 20:29:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:29:10,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 20:29:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:10,984 INFO L225 Difference]: With dead ends: 50550 [2019-12-18 20:29:10,984 INFO L226 Difference]: Without dead ends: 38837 [2019-12-18 20:29:10,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38837 states. [2019-12-18 20:29:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38837 to 38732. [2019-12-18 20:29:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38732 states. [2019-12-18 20:29:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38732 states to 38732 states and 125184 transitions. [2019-12-18 20:29:16,818 INFO L78 Accepts]: Start accepts. Automaton has 38732 states and 125184 transitions. Word has length 19 [2019-12-18 20:29:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:16,818 INFO L462 AbstractCegarLoop]: Abstraction has 38732 states and 125184 transitions. [2019-12-18 20:29:16,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:29:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38732 states and 125184 transitions. [2019-12-18 20:29:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:29:16,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:16,823 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-18 20:29:16,824 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-18 20:29:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2018922146, now seen corresponding path program 1 times [2019-12-18 20:29:16,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:16,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540518215] [2019-12-18 20:29:16,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:16,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540518215] [2019-12-18 20:29:16,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:16,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:16,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842904540] [2019-12-18 20:29:16,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:29:16,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:16,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:29:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:16,886 INFO L87 Difference]: Start difference. First operand 38732 states and 125184 transitions. Second operand 5 states. [2019-12-18 20:29:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:17,642 INFO L93 Difference]: Finished difference Result 57228 states and 182263 transitions. [2019-12-18 20:29:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:29:17,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:29:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:17,785 INFO L225 Difference]: With dead ends: 57228 [2019-12-18 20:29:17,785 INFO L226 Difference]: Without dead ends: 57172 [2019-12-18 20:29:17,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:29:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57172 states. [2019-12-18 20:29:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57172 to 42133. [2019-12-18 20:29:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42133 states. [2019-12-18 20:29:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42133 states to 42133 states and 135962 transitions. [2019-12-18 20:29:19,095 INFO L78 Accepts]: Start accepts. Automaton has 42133 states and 135962 transitions. Word has length 22 [2019-12-18 20:29:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:19,096 INFO L462 AbstractCegarLoop]: Abstraction has 42133 states and 135962 transitions. [2019-12-18 20:29:19,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:29:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 42133 states and 135962 transitions. [2019-12-18 20:29:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:29:19,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:19,102 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-18 20:29:19,102 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-18 20:29:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2018828929, now seen corresponding path program 1 times [2019-12-18 20:29:19,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:19,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628371261] [2019-12-18 20:29:19,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:19,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628371261] [2019-12-18 20:29:19,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:19,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:19,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363588236] [2019-12-18 20:29:19,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:29:19,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:29:19,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:19,200 INFO L87 Difference]: Start difference. First operand 42133 states and 135962 transitions. Second operand 5 states. [2019-12-18 20:29:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:19,881 INFO L93 Difference]: Finished difference Result 57881 states and 184222 transitions. [2019-12-18 20:29:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:29:19,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:29:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:20,015 INFO L225 Difference]: With dead ends: 57881 [2019-12-18 20:29:20,016 INFO L226 Difference]: Without dead ends: 57825 [2019-12-18 20:29:20,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:29:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57825 states. [2019-12-18 20:29:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57825 to 39675. [2019-12-18 20:29:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39675 states. [2019-12-18 20:29:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39675 states to 39675 states and 127837 transitions. [2019-12-18 20:29:20,796 INFO L78 Accepts]: Start accepts. Automaton has 39675 states and 127837 transitions. Word has length 22 [2019-12-18 20:29:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:20,797 INFO L462 AbstractCegarLoop]: Abstraction has 39675 states and 127837 transitions. [2019-12-18 20:29:20,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:29:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 39675 states and 127837 transitions. [2019-12-18 20:29:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:29:20,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:20,809 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-18 20:29:20,809 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-18 20:29:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash -309567519, now seen corresponding path program 1 times [2019-12-18 20:29:20,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:20,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040126557] [2019-12-18 20:29:20,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:20,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040126557] [2019-12-18 20:29:20,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:20,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:20,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617618779] [2019-12-18 20:29:20,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:29:20,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:29:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:20,841 INFO L87 Difference]: Start difference. First operand 39675 states and 127837 transitions. Second operand 3 states. [2019-12-18 20:29:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:21,421 INFO L93 Difference]: Finished difference Result 60113 states and 193022 transitions. [2019-12-18 20:29:21,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:29:21,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 20:29:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:21,530 INFO L225 Difference]: With dead ends: 60113 [2019-12-18 20:29:21,530 INFO L226 Difference]: Without dead ends: 60113 [2019-12-18 20:29:21,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60113 states. [2019-12-18 20:29:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60113 to 46703. [2019-12-18 20:29:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46703 states. [2019-12-18 20:29:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46703 states to 46703 states and 151206 transitions. [2019-12-18 20:29:22,375 INFO L78 Accepts]: Start accepts. Automaton has 46703 states and 151206 transitions. Word has length 27 [2019-12-18 20:29:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:22,375 INFO L462 AbstractCegarLoop]: Abstraction has 46703 states and 151206 transitions. [2019-12-18 20:29:22,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:29:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 46703 states and 151206 transitions. [2019-12-18 20:29:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:29:22,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:22,390 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-18 20:29:22,390 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-18 20:29:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1484978850, now seen corresponding path program 1 times [2019-12-18 20:29:22,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:22,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305023640] [2019-12-18 20:29:22,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:22,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305023640] [2019-12-18 20:29:22,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:22,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:22,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585141330] [2019-12-18 20:29:22,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:29:22,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:22,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:29:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:22,432 INFO L87 Difference]: Start difference. First operand 46703 states and 151206 transitions. Second operand 3 states. [2019-12-18 20:29:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:22,753 INFO L93 Difference]: Finished difference Result 60113 states and 187784 transitions. [2019-12-18 20:29:22,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:29:22,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 20:29:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:22,893 INFO L225 Difference]: With dead ends: 60113 [2019-12-18 20:29:22,894 INFO L226 Difference]: Without dead ends: 60113 [2019-12-18 20:29:22,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60113 states. [2019-12-18 20:29:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60113 to 46703. [2019-12-18 20:29:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46703 states. [2019-12-18 20:29:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46703 states to 46703 states and 145968 transitions. [2019-12-18 20:29:24,130 INFO L78 Accepts]: Start accepts. Automaton has 46703 states and 145968 transitions. Word has length 27 [2019-12-18 20:29:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:24,130 INFO L462 AbstractCegarLoop]: Abstraction has 46703 states and 145968 transitions. [2019-12-18 20:29:24,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:29:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 46703 states and 145968 transitions. [2019-12-18 20:29:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:29:24,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:24,146 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-18 20:29:24,146 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-18 20:29:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1430659206, now seen corresponding path program 1 times [2019-12-18 20:29:24,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:24,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145999464] [2019-12-18 20:29:24,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:24,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145999464] [2019-12-18 20:29:24,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:24,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:24,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895513163] [2019-12-18 20:29:24,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:29:24,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:29:24,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:24,234 INFO L87 Difference]: Start difference. First operand 46703 states and 145968 transitions. Second operand 5 states. [2019-12-18 20:29:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:24,697 INFO L93 Difference]: Finished difference Result 57364 states and 177302 transitions. [2019-12-18 20:29:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:29:24,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:29:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:24,781 INFO L225 Difference]: With dead ends: 57364 [2019-12-18 20:29:24,781 INFO L226 Difference]: Without dead ends: 57188 [2019-12-18 20:29:24,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:29:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57188 states. [2019-12-18 20:29:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57188 to 48896. [2019-12-18 20:29:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48896 states. [2019-12-18 20:29:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48896 states to 48896 states and 152649 transitions. [2019-12-18 20:29:26,003 INFO L78 Accepts]: Start accepts. Automaton has 48896 states and 152649 transitions. Word has length 27 [2019-12-18 20:29:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:26,003 INFO L462 AbstractCegarLoop]: Abstraction has 48896 states and 152649 transitions. [2019-12-18 20:29:26,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:29:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 48896 states and 152649 transitions. [2019-12-18 20:29:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:29:26,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:26,019 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] [2019-12-18 20:29:26,019 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-18 20:29:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:26,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1720505979, now seen corresponding path program 1 times [2019-12-18 20:29:26,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:26,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412106010] [2019-12-18 20:29:26,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:26,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412106010] [2019-12-18 20:29:26,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:26,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:29:26,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710635397] [2019-12-18 20:29:26,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:29:26,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:26,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:29:26,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:29:26,090 INFO L87 Difference]: Start difference. First operand 48896 states and 152649 transitions. Second operand 4 states. [2019-12-18 20:29:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:26,319 INFO L93 Difference]: Finished difference Result 50051 states and 156011 transitions. [2019-12-18 20:29:26,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:29:26,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 20:29:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:26,408 INFO L225 Difference]: With dead ends: 50051 [2019-12-18 20:29:26,409 INFO L226 Difference]: Without dead ends: 50051 [2019-12-18 20:29:26,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50051 states. [2019-12-18 20:29:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50051 to 50051. [2019-12-18 20:29:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50051 states. [2019-12-18 20:29:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50051 states to 50051 states and 156011 transitions. [2019-12-18 20:29:27,733 INFO L78 Accepts]: Start accepts. Automaton has 50051 states and 156011 transitions. Word has length 28 [2019-12-18 20:29:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:27,733 INFO L462 AbstractCegarLoop]: Abstraction has 50051 states and 156011 transitions. [2019-12-18 20:29:27,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:29:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 50051 states and 156011 transitions. [2019-12-18 20:29:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 20:29:27,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:27,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:29:27,748 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-18 20:29:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1894062912, now seen corresponding path program 1 times [2019-12-18 20:29:27,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:27,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657645294] [2019-12-18 20:29:27,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:27,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657645294] [2019-12-18 20:29:27,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:27,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:27,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091747593] [2019-12-18 20:29:27,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:29:27,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:27,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:29:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:27,860 INFO L87 Difference]: Start difference. First operand 50051 states and 156011 transitions. Second operand 5 states. [2019-12-18 20:29:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:28,320 INFO L93 Difference]: Finished difference Result 60165 states and 185054 transitions. [2019-12-18 20:29:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:29:28,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 20:29:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:28,404 INFO L225 Difference]: With dead ends: 60165 [2019-12-18 20:29:28,405 INFO L226 Difference]: Without dead ends: 59981 [2019-12-18 20:29:28,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:29:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59981 states. [2019-12-18 20:29:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59981 to 49872. [2019-12-18 20:29:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49872 states. [2019-12-18 20:29:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49872 states to 49872 states and 155390 transitions. [2019-12-18 20:29:29,252 INFO L78 Accepts]: Start accepts. Automaton has 49872 states and 155390 transitions. Word has length 29 [2019-12-18 20:29:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:29,253 INFO L462 AbstractCegarLoop]: Abstraction has 49872 states and 155390 transitions. [2019-12-18 20:29:29,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:29:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 49872 states and 155390 transitions. [2019-12-18 20:29:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 20:29:29,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:29,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:29:29,269 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-18 20:29:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1125685633, now seen corresponding path program 1 times [2019-12-18 20:29:29,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:29,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448722457] [2019-12-18 20:29:29,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:29,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448722457] [2019-12-18 20:29:29,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:29,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:29:29,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133313707] [2019-12-18 20:29:29,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:29:29,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:29:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:29,342 INFO L87 Difference]: Start difference. First operand 49872 states and 155390 transitions. Second operand 5 states. [2019-12-18 20:29:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:29,483 INFO L93 Difference]: Finished difference Result 22113 states and 66177 transitions. [2019-12-18 20:29:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:29:29,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 20:29:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:29,521 INFO L225 Difference]: With dead ends: 22113 [2019-12-18 20:29:29,521 INFO L226 Difference]: Without dead ends: 19363 [2019-12-18 20:29:29,521 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-18 20:29:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19363 states. [2019-12-18 20:29:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19363 to 18191. [2019-12-18 20:29:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-12-18 20:29:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 54240 transitions. [2019-12-18 20:29:30,148 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 54240 transitions. Word has length 30 [2019-12-18 20:29:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:30,148 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 54240 transitions. [2019-12-18 20:29:30,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:29:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 54240 transitions. [2019-12-18 20:29:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:29:30,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:30,167 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-18 20:29:30,167 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-18 20:29:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1323394120, now seen corresponding path program 1 times [2019-12-18 20:29:30,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:30,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612583160] [2019-12-18 20:29:30,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:30,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612583160] [2019-12-18 20:29:30,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:30,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:29:30,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330791019] [2019-12-18 20:29:30,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:29:30,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:29:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:29:30,259 INFO L87 Difference]: Start difference. First operand 18191 states and 54240 transitions. Second operand 6 states. [2019-12-18 20:29:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:31,011 INFO L93 Difference]: Finished difference Result 22685 states and 66555 transitions. [2019-12-18 20:29:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:29:31,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 20:29:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:31,041 INFO L225 Difference]: With dead ends: 22685 [2019-12-18 20:29:31,041 INFO L226 Difference]: Without dead ends: 22364 [2019-12-18 20:29:31,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:29:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-12-18 20:29:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 18226. [2019-12-18 20:29:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18226 states. [2019-12-18 20:29:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18226 states to 18226 states and 54295 transitions. [2019-12-18 20:29:31,329 INFO L78 Accepts]: Start accepts. Automaton has 18226 states and 54295 transitions. Word has length 33 [2019-12-18 20:29:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:31,329 INFO L462 AbstractCegarLoop]: Abstraction has 18226 states and 54295 transitions. [2019-12-18 20:29:31,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:29:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 18226 states and 54295 transitions. [2019-12-18 20:29:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:29:31,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:31,350 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] [2019-12-18 20:29:31,351 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-18 20:29:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1896595454, now seen corresponding path program 1 times [2019-12-18 20:29:31,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:31,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202990542] [2019-12-18 20:29:31,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:31,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202990542] [2019-12-18 20:29:31,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:31,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:29:31,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150417945] [2019-12-18 20:29:31,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:29:31,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:29:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:29:31,446 INFO L87 Difference]: Start difference. First operand 18226 states and 54295 transitions. Second operand 6 states. [2019-12-18 20:29:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:32,187 INFO L93 Difference]: Finished difference Result 21814 states and 64016 transitions. [2019-12-18 20:29:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:29:32,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 20:29:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:32,216 INFO L225 Difference]: With dead ends: 21814 [2019-12-18 20:29:32,216 INFO L226 Difference]: Without dead ends: 21439 [2019-12-18 20:29:32,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:29:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21439 states. [2019-12-18 20:29:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21439 to 17105. [2019-12-18 20:29:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17105 states. [2019-12-18 20:29:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17105 states to 17105 states and 51025 transitions. [2019-12-18 20:29:32,500 INFO L78 Accepts]: Start accepts. Automaton has 17105 states and 51025 transitions. Word has length 35 [2019-12-18 20:29:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:32,501 INFO L462 AbstractCegarLoop]: Abstraction has 17105 states and 51025 transitions. [2019-12-18 20:29:32,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:29:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 17105 states and 51025 transitions. [2019-12-18 20:29:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:29:32,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:32,518 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] [2019-12-18 20:29:32,518 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-18 20:29:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:32,518 INFO L82 PathProgramCache]: Analyzing trace with hash -533542154, now seen corresponding path program 1 times [2019-12-18 20:29:32,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:32,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930092151] [2019-12-18 20:29:32,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:32,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-18 20:29:32,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930092151] [2019-12-18 20:29:32,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:32,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:32,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051882872] [2019-12-18 20:29:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:29:32,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:29:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:29:32,575 INFO L87 Difference]: Start difference. First operand 17105 states and 51025 transitions. Second operand 4 states. [2019-12-18 20:29:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:32,688 INFO L93 Difference]: Finished difference Result 27588 states and 82839 transitions. [2019-12-18 20:29:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:29:32,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 20:29:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:32,716 INFO L225 Difference]: With dead ends: 27588 [2019-12-18 20:29:32,717 INFO L226 Difference]: Without dead ends: 13533 [2019-12-18 20:29:32,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13533 states. [2019-12-18 20:29:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13533 to 13306. [2019-12-18 20:29:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13306 states. [2019-12-18 20:29:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 39164 transitions. [2019-12-18 20:29:33,454 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 39164 transitions. Word has length 41 [2019-12-18 20:29:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:33,455 INFO L462 AbstractCegarLoop]: Abstraction has 13306 states and 39164 transitions. [2019-12-18 20:29:33,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:29:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 39164 transitions. [2019-12-18 20:29:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:29:33,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:33,475 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] [2019-12-18 20:29:33,476 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-18 20:29:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -473924412, now seen corresponding path program 2 times [2019-12-18 20:29:33,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:33,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34080566] [2019-12-18 20:29:33,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:33,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34080566] [2019-12-18 20:29:33,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:33,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:29:33,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863546502] [2019-12-18 20:29:33,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:29:33,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:29:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:29:33,533 INFO L87 Difference]: Start difference. First operand 13306 states and 39164 transitions. Second operand 4 states. [2019-12-18 20:29:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:33,630 INFO L93 Difference]: Finished difference Result 21852 states and 64598 transitions. [2019-12-18 20:29:33,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:29:33,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 20:29:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:33,649 INFO L225 Difference]: With dead ends: 21852 [2019-12-18 20:29:33,650 INFO L226 Difference]: Without dead ends: 10629 [2019-12-18 20:29:33,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10629 states. [2019-12-18 20:29:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10629 to 10490. [2019-12-18 20:29:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10490 states. [2019-12-18 20:29:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10490 states to 10490 states and 29930 transitions. [2019-12-18 20:29:33,849 INFO L78 Accepts]: Start accepts. Automaton has 10490 states and 29930 transitions. Word has length 41 [2019-12-18 20:29:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:33,849 INFO L462 AbstractCegarLoop]: Abstraction has 10490 states and 29930 transitions. [2019-12-18 20:29:33,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:29:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 10490 states and 29930 transitions. [2019-12-18 20:29:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:29:33,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:33,859 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] [2019-12-18 20:29:33,859 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-18 20:29:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1765890018, now seen corresponding path program 3 times [2019-12-18 20:29:33,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:33,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746425011] [2019-12-18 20:29:33,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:33,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746425011] [2019-12-18 20:29:33,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:33,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:29:33,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797454217] [2019-12-18 20:29:33,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:29:33,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:33,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:29:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:33,920 INFO L87 Difference]: Start difference. First operand 10490 states and 29930 transitions. Second operand 3 states. [2019-12-18 20:29:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:33,954 INFO L93 Difference]: Finished difference Result 10490 states and 29315 transitions. [2019-12-18 20:29:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:29:33,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 20:29:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:33,968 INFO L225 Difference]: With dead ends: 10490 [2019-12-18 20:29:33,968 INFO L226 Difference]: Without dead ends: 10490 [2019-12-18 20:29:33,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2019-12-18 20:29:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 10478. [2019-12-18 20:29:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10478 states. [2019-12-18 20:29:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10478 states to 10478 states and 29292 transitions. [2019-12-18 20:29:34,113 INFO L78 Accepts]: Start accepts. Automaton has 10478 states and 29292 transitions. Word has length 41 [2019-12-18 20:29:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:34,113 INFO L462 AbstractCegarLoop]: Abstraction has 10478 states and 29292 transitions. [2019-12-18 20:29:34,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:29:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10478 states and 29292 transitions. [2019-12-18 20:29:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:29:34,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:34,123 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] [2019-12-18 20:29:34,123 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-18 20:29:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash 919425009, now seen corresponding path program 1 times [2019-12-18 20:29:34,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:34,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123289648] [2019-12-18 20:29:34,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:34,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123289648] [2019-12-18 20:29:34,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:34,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:29:34,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513376238] [2019-12-18 20:29:34,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:29:34,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:29:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:29:34,209 INFO L87 Difference]: Start difference. First operand 10478 states and 29292 transitions. Second operand 6 states. [2019-12-18 20:29:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:34,301 INFO L93 Difference]: Finished difference Result 9651 states and 27535 transitions. [2019-12-18 20:29:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:29:34,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 20:29:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:34,312 INFO L225 Difference]: With dead ends: 9651 [2019-12-18 20:29:34,312 INFO L226 Difference]: Without dead ends: 6679 [2019-12-18 20:29:34,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:29:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2019-12-18 20:29:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6679. [2019-12-18 20:29:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2019-12-18 20:29:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 20866 transitions. [2019-12-18 20:29:34,424 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 20866 transitions. Word has length 42 [2019-12-18 20:29:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:34,424 INFO L462 AbstractCegarLoop]: Abstraction has 6679 states and 20866 transitions. [2019-12-18 20:29:34,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:29:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 20866 transitions. [2019-12-18 20:29:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:29:34,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:34,434 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-18 20:29:34,434 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-18 20:29:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1971896379, now seen corresponding path program 1 times [2019-12-18 20:29:34,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:34,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515834641] [2019-12-18 20:29:34,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:34,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515834641] [2019-12-18 20:29:34,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:34,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:29:34,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184399040] [2019-12-18 20:29:34,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:29:34,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:29:34,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:29:34,519 INFO L87 Difference]: Start difference. First operand 6679 states and 20866 transitions. Second operand 6 states. [2019-12-18 20:29:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:34,695 INFO L93 Difference]: Finished difference Result 13890 states and 42375 transitions. [2019-12-18 20:29:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:29:34,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 20:29:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:34,712 INFO L225 Difference]: With dead ends: 13890 [2019-12-18 20:29:34,712 INFO L226 Difference]: Without dead ends: 10111 [2019-12-18 20:29:34,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:29:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10111 states. [2019-12-18 20:29:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10111 to 7764. [2019-12-18 20:29:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7764 states. [2019-12-18 20:29:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7764 states to 7764 states and 24036 transitions. [2019-12-18 20:29:34,881 INFO L78 Accepts]: Start accepts. Automaton has 7764 states and 24036 transitions. Word has length 66 [2019-12-18 20:29:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:34,881 INFO L462 AbstractCegarLoop]: Abstraction has 7764 states and 24036 transitions. [2019-12-18 20:29:34,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:29:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7764 states and 24036 transitions. [2019-12-18 20:29:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:29:34,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:34,890 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-18 20:29:34,890 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-18 20:29:34,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:34,890 INFO L82 PathProgramCache]: Analyzing trace with hash 811898523, now seen corresponding path program 2 times [2019-12-18 20:29:34,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:34,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93312110] [2019-12-18 20:29:34,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:29:34,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93312110] [2019-12-18 20:29:34,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:34,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:29:34,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604908145] [2019-12-18 20:29:34,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:29:34,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:29:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:34,944 INFO L87 Difference]: Start difference. First operand 7764 states and 24036 transitions. Second operand 3 states. [2019-12-18 20:29:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:35,017 INFO L93 Difference]: Finished difference Result 9084 states and 27886 transitions. [2019-12-18 20:29:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:29:35,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:29:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:35,033 INFO L225 Difference]: With dead ends: 9084 [2019-12-18 20:29:35,034 INFO L226 Difference]: Without dead ends: 9084 [2019-12-18 20:29:35,034 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-18 20:29:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2019-12-18 20:29:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 8028. [2019-12-18 20:29:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8028 states. [2019-12-18 20:29:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8028 states to 8028 states and 24806 transitions. [2019-12-18 20:29:35,233 INFO L78 Accepts]: Start accepts. Automaton has 8028 states and 24806 transitions. Word has length 66 [2019-12-18 20:29:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:35,233 INFO L462 AbstractCegarLoop]: Abstraction has 8028 states and 24806 transitions. [2019-12-18 20:29:35,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:29:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8028 states and 24806 transitions. [2019-12-18 20:29:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:29:35,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:35,245 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-18 20:29:35,245 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-18 20:29:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1635669227, now seen corresponding path program 1 times [2019-12-18 20:29:35,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:35,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231642193] [2019-12-18 20:29:35,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:29:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:29:35,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:29:35,489 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:29:35,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= v_~z$r_buff0_thd3~0_83 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_29 0) (= 0 v_~z$w_buff0~0_27) (= v_~main$tmp_guard0~0_12 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~z$w_buff1~0_28) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~__unbuffered_cnt~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t409~0.base_28|)) (= v_~__unbuffered_p2_EBX~0_16 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t409~0.base_28|) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t409~0.base_28| 1) |v_#valid_55|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff1_thd1~0_22) (= 0 v_~z$r_buff1_thd2~0_22) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$mem_tmp~0_10 0) (= 0 v_~z$w_buff1_used~0_74) (= v_~z~0_27 0) (= 0 |v_#NULL.base_3|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t409~0.base_28| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_28| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_28|) |v_ULTIMATE.start_main_~#t409~0.offset_22| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd2~0_21 0) (= 0 |v_ULTIMATE.start_main_~#t409~0.offset_22|) (= v_~z$w_buff0_used~0_121 0) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_12|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_28|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_22, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t409~0.base=|v_ULTIMATE.start_main_~#t409~0.base_28|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_12|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ULTIMATE.start_main_~#t409~0.offset=|v_ULTIMATE.start_main_~#t409~0.offset_22|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_17|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t410~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t410~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t409~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t409~0.offset, ULTIMATE.start_main_~#t411~0.offset, ~y~0, ~z$r_buff0_thd2~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, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:29:35,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13|) 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t410~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t410~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t410~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13|) |v_ULTIMATE.start_main_~#t410~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t410~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_11|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t410~0.offset, ULTIMATE.start_main_~#t410~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:29:35,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t411~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t411~0.base_10|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t411~0.base_10| 4) |v_#length_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10|) |v_ULTIMATE.start_main_~#t411~0.offset_9| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t411~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t411~0.offset, #length] because there is no mapped edge [2019-12-18 20:29:35,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~z$r_buff0_thd2~0_In-1920973759 ~z$r_buff1_thd2~0_Out-1920973759) (= ~z$r_buff0_thd3~0_In-1920973759 ~z$r_buff1_thd3~0_Out-1920973759) (= ~z$r_buff1_thd1~0_Out-1920973759 ~z$r_buff0_thd1~0_In-1920973759) (= ~x~0_In-1920973759 ~__unbuffered_p0_EAX~0_Out-1920973759) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1920973759)) (= 1 ~z$r_buff0_thd1~0_Out-1920973759) (= ~z$r_buff0_thd0~0_In-1920973759 ~z$r_buff1_thd0~0_Out-1920973759)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920973759, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1920973759, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1920973759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1920973759, ~x~0=~x~0_In-1920973759, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1920973759} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1920973759, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920973759, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1920973759, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1920973759, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1920973759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1920973759, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1920973759, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1920973759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1920973759, ~x~0=~x~0_In-1920973759, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1920973759} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:29:35,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1593348279 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1593348279 256) 0)) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out-1593348279| |P1Thread1of1ForFork2_#t~ite9_Out-1593348279|))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-1593348279 |P1Thread1of1ForFork2_#t~ite9_Out-1593348279|) (not .cse2)) (and (or .cse2 .cse0) (= ~z~0_In-1593348279 |P1Thread1of1ForFork2_#t~ite9_Out-1593348279|) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1593348279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1593348279, ~z$w_buff1~0=~z$w_buff1~0_In-1593348279, ~z~0=~z~0_In-1593348279} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1593348279|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1593348279, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1593348279|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1593348279, ~z$w_buff1~0=~z$w_buff1~0_In-1593348279, ~z~0=~z~0_In-1593348279} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:29:35,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-990008509 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-990008509 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-990008509|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-990008509| ~z$w_buff0_used~0_In-990008509)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-990008509, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-990008509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-990008509, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-990008509|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-990008509} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:29:35,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In2075453997 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2075453997 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2075453997 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2075453997 256)))) (or (and (= ~z$w_buff1_used~0_In2075453997 |P1Thread1of1ForFork2_#t~ite12_Out2075453997|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out2075453997|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2075453997, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2075453997, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2075453997, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2075453997} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2075453997, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2075453997, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2075453997, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2075453997|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2075453997} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:29:35,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2027540816 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-2027540816 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-2027540816 |P1Thread1of1ForFork2_#t~ite13_Out-2027540816|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-2027540816| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2027540816, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2027540816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2027540816, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2027540816|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2027540816} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:29:35,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L793-->L793-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In419462113 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In419462113 256) 0))) (or (= (mod ~z$w_buff0_used~0_In419462113 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In419462113 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In419462113 256))))) (= ~z$w_buff0~0_In419462113 |P2Thread1of1ForFork0_#t~ite20_Out419462113|) (= |P2Thread1of1ForFork0_#t~ite21_Out419462113| |P2Thread1of1ForFork0_#t~ite20_Out419462113|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite20_In419462113| |P2Thread1of1ForFork0_#t~ite20_Out419462113|) (= ~z$w_buff0~0_In419462113 |P2Thread1of1ForFork0_#t~ite21_Out419462113|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In419462113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In419462113, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In419462113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In419462113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In419462113, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In419462113|, ~weak$$choice2~0=~weak$$choice2~0_In419462113} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out419462113|, ~z$w_buff0~0=~z$w_buff0~0_In419462113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In419462113, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In419462113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In419462113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In419462113, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out419462113|, ~weak$$choice2~0=~weak$$choice2~0_In419462113} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 20:29:35,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1895579132 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-1895579132| |P2Thread1of1ForFork0_#t~ite23_Out-1895579132|) (= ~z$w_buff1~0_In-1895579132 |P2Thread1of1ForFork0_#t~ite24_Out-1895579132|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1895579132| |P2Thread1of1ForFork0_#t~ite23_Out-1895579132|) (= ~z$w_buff1~0_In-1895579132 |P2Thread1of1ForFork0_#t~ite23_Out-1895579132|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1895579132 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1895579132 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-1895579132 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1895579132 256) 0))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1895579132, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1895579132, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1895579132|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1895579132, ~z$w_buff1~0=~z$w_buff1~0_In-1895579132, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1895579132, ~weak$$choice2~0=~weak$$choice2~0_In-1895579132} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1895579132, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1895579132|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1895579132, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1895579132|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1895579132, ~z$w_buff1~0=~z$w_buff1~0_In-1895579132, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1895579132, ~weak$$choice2~0=~weak$$choice2~0_In-1895579132} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:29:35,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd3~0_72 v_~z$r_buff0_thd3~0_71)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_71, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:29:35,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 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_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:29:35,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-969953556 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-969953556 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-969953556 |P0Thread1of1ForFork1_#t~ite5_Out-969953556|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-969953556|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-969953556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-969953556} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-969953556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-969953556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-969953556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:29:35,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In2042418963 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2042418963 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2042418963 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2042418963 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out2042418963| ~z$w_buff1_used~0_In2042418963)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out2042418963| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2042418963, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2042418963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2042418963, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2042418963} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2042418963, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2042418963|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2042418963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2042418963, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2042418963} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:29:35,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1342515096 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1342515096 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1342515096 ~z$r_buff0_thd1~0_In1342515096)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1342515096)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1342515096, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1342515096} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1342515096, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1342515096|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1342515096} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:29:35,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-552471417 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-552471417 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-552471417 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-552471417 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-552471417| ~z$r_buff1_thd1~0_In-552471417) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-552471417| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-552471417, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-552471417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552471417, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-552471417} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-552471417|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-552471417, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-552471417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552471417, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-552471417} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:29:35,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:29:35,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-372116034 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-372116034 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-372116034| ~z$w_buff1~0_In-372116034)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-372116034| ~z~0_In-372116034) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-372116034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-372116034, ~z$w_buff1~0=~z$w_buff1~0_In-372116034, ~z~0=~z~0_In-372116034} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-372116034|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-372116034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-372116034, ~z$w_buff1~0=~z$w_buff1~0_In-372116034, ~z~0=~z~0_In-372116034} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:29:35,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 20:29:35,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1812140653 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1812140653 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1812140653| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1812140653 |P2Thread1of1ForFork0_#t~ite40_Out1812140653|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1812140653, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1812140653} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1812140653, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1812140653|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1812140653} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:29:35,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-245666713 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-245666713 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-245666713 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-245666713 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-245666713| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-245666713| ~z$w_buff1_used~0_In-245666713) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-245666713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-245666713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-245666713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-245666713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-245666713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-245666713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-245666713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-245666713, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-245666713|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:29:35,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1210393993 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210393993 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1210393993| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1210393993| ~z$r_buff0_thd3~0_In1210393993)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1210393993, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210393993} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1210393993, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210393993, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1210393993|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:29:35,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1765990926 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1765990926 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1765990926 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1765990926 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1765990926 |P2Thread1of1ForFork0_#t~ite43_Out1765990926|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1765990926|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1765990926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1765990926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765990926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1765990926} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1765990926|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1765990926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1765990926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765990926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1765990926} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:29:35,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:29:35,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In-1154051007 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1154051007 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1154051007 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1154051007 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1154051007| ~z$r_buff1_thd2~0_In-1154051007) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1154051007| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154051007, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1154051007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154051007, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1154051007} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154051007, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1154051007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154051007, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1154051007|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1154051007} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:29:35,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:29:35,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= (mod v_~z$w_buff0_used~0_95 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:29:35,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2087976039 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In2087976039 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out2087976039| ~z~0_In2087976039) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out2087976039| ~z$w_buff1~0_In2087976039) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2087976039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2087976039, ~z$w_buff1~0=~z$w_buff1~0_In2087976039, ~z~0=~z~0_In2087976039} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2087976039, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2087976039|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2087976039, ~z$w_buff1~0=~z$w_buff1~0_In2087976039, ~z~0=~z~0_In2087976039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:29:35,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 20:29:35,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-25295301 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-25295301 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-25295301|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-25295301 |ULTIMATE.start_main_#t~ite49_Out-25295301|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-25295301, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-25295301} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-25295301, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-25295301, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-25295301|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:29:35,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1813946832 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1813946832 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1813946832 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1813946832 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1813946832 |ULTIMATE.start_main_#t~ite50_Out-1813946832|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1813946832| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1813946832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1813946832, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1813946832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1813946832} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1813946832|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1813946832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1813946832, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1813946832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1813946832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:29:35,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1447097123 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1447097123 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1447097123|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1447097123 |ULTIMATE.start_main_#t~ite51_Out1447097123|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1447097123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447097123} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1447097123, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1447097123|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447097123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:29:35,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1412880034 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1412880034 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1412880034 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1412880034 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1412880034 |ULTIMATE.start_main_#t~ite52_Out1412880034|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1412880034|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1412880034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1412880034, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1412880034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1412880034} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1412880034|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1412880034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1412880034, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1412880034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1412880034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:29:35,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [892] [892] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_14| v_~z$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} 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-18 20:29:35,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:29:35 BasicIcfg [2019-12-18 20:29:35,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:29:35,661 INFO L168 Benchmark]: Toolchain (without parser) took 190447.68 ms. Allocated memory was 146.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,662 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.78 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 157.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,666 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,666 INFO L168 Benchmark]: RCFGBuilder took 834.83 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,667 INFO L168 Benchmark]: TraceAbstraction took 188729.02 ms. Allocated memory was 203.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:29:35,674 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.68 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.78 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 157.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.83 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188729.02 ms. Allocated memory was 203.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6931 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 92501 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L768] 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_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L768] 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) [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L792] 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_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L792] 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) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L770] 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 [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L793] 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)) [L794] 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)) [L795] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=1, x=1, 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] [L795] 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)) [L796] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, x=1, 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] [L796] 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)) [L798] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$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=1, 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] [L798] 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)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L748] 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) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L804] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 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 [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 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 [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 188.3s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 61.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4332 SDtfs, 4408 SDslu, 7007 SDs, 0 SdLazy, 3544 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 26 SyntacticMatches, 21 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188404occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 103.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 285907 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 87484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...