/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:33:54,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:33:54,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:33:55,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:33:55,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:33:55,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:33:55,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:33:55,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:33:55,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:33:55,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:33:55,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:33:55,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:33:55,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:33:55,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:33:55,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:33:55,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:33:55,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:33:55,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:33:55,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:33:55,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:33:55,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:33:55,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:33:55,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:33:55,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:33:55,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:33:55,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:33:55,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:33:55,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:33:55,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:33:55,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:33:55,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:33:55,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:33:55,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:33:55,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:33:55,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:33:55,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:33:55,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:33:55,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:33:55,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:33:55,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:33:55,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:33:55,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:33:55,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:33:55,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:33:55,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:33:55,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:33:55,091 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:33:55,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:33:55,091 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:33:55,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:33:55,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:33:55,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:33:55,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:33:55,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:33:55,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:33:55,093 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:33:55,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:33:55,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:33:55,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:33:55,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:33:55,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:33:55,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:33:55,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:33:55,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:33:55,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:33:55,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:33:55,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:33:55,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:33:55,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:33:55,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:33:55,098 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:33:55,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:33:55,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:33:55,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:33:55,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:33:55,442 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:33:55,442 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:33:55,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt.i [2019-12-18 14:33:55,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec1f753d/c12907a80879450a849918c1c512eb67/FLAG3f664da77 [2019-12-18 14:33:56,085 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:33:56,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt.i [2019-12-18 14:33:56,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec1f753d/c12907a80879450a849918c1c512eb67/FLAG3f664da77 [2019-12-18 14:33:56,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec1f753d/c12907a80879450a849918c1c512eb67 [2019-12-18 14:33:56,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:33:56,363 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:33:56,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:33:56,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:33:56,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:33:56,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:33:56" (1/1) ... [2019-12-18 14:33:56,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:56, skipping insertion in model container [2019-12-18 14:33:56,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:33:56" (1/1) ... [2019-12-18 14:33:56,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:33:56,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:33:56,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:33:56,933 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:33:57,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:33:57,121 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:33:57,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57 WrapperNode [2019-12-18 14:33:57,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:33:57,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:33:57,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:33:57,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:33:57,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:33:57,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:33:57,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:33:57,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:33:57,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (1/1) ... [2019-12-18 14:33:57,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:33:57,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:33:57,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:33:57,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:33:57,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (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 14:33:57,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 14:33:57,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:33:57,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:33:57,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:33:57,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:33:57,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:33:57,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:33:57,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:33:57,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:33:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:33:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:33:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 14:33:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:33:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:33:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:33:57,341 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 14:33:58,281 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:33:58,281 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:33:58,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:33:58 BoogieIcfgContainer [2019-12-18 14:33:58,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:33:58,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:33:58,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:33:58,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:33:58,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:33:56" (1/3) ... [2019-12-18 14:33:58,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556166a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:33:58, skipping insertion in model container [2019-12-18 14:33:58,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:33:57" (2/3) ... [2019-12-18 14:33:58,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556166a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:33:58, skipping insertion in model container [2019-12-18 14:33:58,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:33:58" (3/3) ... [2019-12-18 14:33:58,290 INFO L109 eAbstractionObserver]: Analyzing ICFG safe007_power.opt.i [2019-12-18 14:33:58,299 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:33:58,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:33:58,307 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:33:58,308 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:33:58,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,365 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,408 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,408 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,422 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,424 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:33:58,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:33:58,460 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:33:58,460 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:33:58,460 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:33:58,460 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:33:58,460 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:33:58,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:33:58,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:33:58,461 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:33:58,478 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 276 transitions [2019-12-18 14:33:58,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 224 places, 276 transitions [2019-12-18 14:33:58,577 INFO L126 PetriNetUnfolder]: 62/273 cut-off events. [2019-12-18 14:33:58,578 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:33:58,598 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 62/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 666 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 14:33:58,631 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 224 places, 276 transitions [2019-12-18 14:33:58,696 INFO L126 PetriNetUnfolder]: 62/273 cut-off events. [2019-12-18 14:33:58,697 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:33:58,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 62/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 666 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 14:33:58,755 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22870 [2019-12-18 14:33:58,757 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:34:07,522 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-12-18 14:34:07,696 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-18 14:34:08,222 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 136 [2019-12-18 14:34:08,483 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-12-18 14:34:08,536 INFO L206 etLargeBlockEncoding]: Checked pairs total: 113419 [2019-12-18 14:34:08,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 175 [2019-12-18 14:34:08,540 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 133 transitions [2019-12-18 14:34:10,692 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32514 states. [2019-12-18 14:34:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32514 states. [2019-12-18 14:34:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:34:10,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:10,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:34:10,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1148437831, now seen corresponding path program 1 times [2019-12-18 14:34:10,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:10,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074229825] [2019-12-18 14:34:10,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:10,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 14:34:10,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074229825] [2019-12-18 14:34:10,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:10,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:34:10,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110466039] [2019-12-18 14:34:10,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:10,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:10,962 INFO L87 Difference]: Start difference. First operand 32514 states. Second operand 3 states. [2019-12-18 14:34:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:12,726 INFO L93 Difference]: Finished difference Result 31858 states and 127030 transitions. [2019-12-18 14:34:12,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:12,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:34:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:12,998 INFO L225 Difference]: With dead ends: 31858 [2019-12-18 14:34:12,999 INFO L226 Difference]: Without dead ends: 30394 [2019-12-18 14:34:13,000 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 14:34:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30394 states. [2019-12-18 14:34:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30394 to 30394. [2019-12-18 14:34:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30394 states. [2019-12-18 14:34:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30394 states to 30394 states and 121136 transitions. [2019-12-18 14:34:15,002 INFO L78 Accepts]: Start accepts. Automaton has 30394 states and 121136 transitions. Word has length 5 [2019-12-18 14:34:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:15,002 INFO L462 AbstractCegarLoop]: Abstraction has 30394 states and 121136 transitions. [2019-12-18 14:34:15,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30394 states and 121136 transitions. [2019-12-18 14:34:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:34:15,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:15,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:15,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 816039134, now seen corresponding path program 1 times [2019-12-18 14:34:15,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:15,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976055603] [2019-12-18 14:34:15,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:15,180 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 14:34:15,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976055603] [2019-12-18 14:34:15,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:15,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:34:15,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333318437] [2019-12-18 14:34:15,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:34:15,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:15,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:34:15,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:34:15,185 INFO L87 Difference]: Start difference. First operand 30394 states and 121136 transitions. Second operand 4 states. [2019-12-18 14:34:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:15,932 INFO L93 Difference]: Finished difference Result 48598 states and 183912 transitions. [2019-12-18 14:34:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:34:15,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:34:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:17,814 INFO L225 Difference]: With dead ends: 48598 [2019-12-18 14:34:17,814 INFO L226 Difference]: Without dead ends: 48584 [2019-12-18 14:34:17,815 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 14:34:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2019-12-18 14:34:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 44998. [2019-12-18 14:34:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44998 states. [2019-12-18 14:34:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44998 states to 44998 states and 172210 transitions. [2019-12-18 14:34:19,359 INFO L78 Accepts]: Start accepts. Automaton has 44998 states and 172210 transitions. Word has length 13 [2019-12-18 14:34:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:19,360 INFO L462 AbstractCegarLoop]: Abstraction has 44998 states and 172210 transitions. [2019-12-18 14:34:19,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:34:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 44998 states and 172210 transitions. [2019-12-18 14:34:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:34:19,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:19,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:19,366 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash -612690505, now seen corresponding path program 1 times [2019-12-18 14:34:19,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:19,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486552347] [2019-12-18 14:34:19,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:19,518 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 14:34:19,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486552347] [2019-12-18 14:34:19,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:19,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:34:19,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298076763] [2019-12-18 14:34:19,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:34:19,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:34:19,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:34:19,521 INFO L87 Difference]: Start difference. First operand 44998 states and 172210 transitions. Second operand 5 states. [2019-12-18 14:34:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:20,595 INFO L93 Difference]: Finished difference Result 66878 states and 251204 transitions. [2019-12-18 14:34:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:34:20,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 14:34:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:20,935 INFO L225 Difference]: With dead ends: 66878 [2019-12-18 14:34:20,935 INFO L226 Difference]: Without dead ends: 66878 [2019-12-18 14:34:20,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:34:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66878 states. [2019-12-18 14:34:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66878 to 51580. [2019-12-18 14:34:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51580 states. [2019-12-18 14:34:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51580 states to 51580 states and 196291 transitions. [2019-12-18 14:34:24,790 INFO L78 Accepts]: Start accepts. Automaton has 51580 states and 196291 transitions. Word has length 16 [2019-12-18 14:34:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:24,790 INFO L462 AbstractCegarLoop]: Abstraction has 51580 states and 196291 transitions. [2019-12-18 14:34:24,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:34:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 51580 states and 196291 transitions. [2019-12-18 14:34:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:34:24,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:24,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:24,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash -612492787, now seen corresponding path program 1 times [2019-12-18 14:34:24,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:24,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580584942] [2019-12-18 14:34:24,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:34:24,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580584942] [2019-12-18 14:34:24,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:24,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:24,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083154910] [2019-12-18 14:34:24,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:24,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:24,847 INFO L87 Difference]: Start difference. First operand 51580 states and 196291 transitions. Second operand 3 states. [2019-12-18 14:34:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:25,154 INFO L93 Difference]: Finished difference Result 68690 states and 256962 transitions. [2019-12-18 14:34:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:25,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:34:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:25,443 INFO L225 Difference]: With dead ends: 68690 [2019-12-18 14:34:25,443 INFO L226 Difference]: Without dead ends: 68690 [2019-12-18 14:34:25,443 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 14:34:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68690 states. [2019-12-18 14:34:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68690 to 57838. [2019-12-18 14:34:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57838 states. [2019-12-18 14:34:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57838 states to 57838 states and 217912 transitions. [2019-12-18 14:34:27,777 INFO L78 Accepts]: Start accepts. Automaton has 57838 states and 217912 transitions. Word has length 16 [2019-12-18 14:34:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:27,777 INFO L462 AbstractCegarLoop]: Abstraction has 57838 states and 217912 transitions. [2019-12-18 14:34:27,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57838 states and 217912 transitions. [2019-12-18 14:34:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:34:27,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:27,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:27,786 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash 742083143, now seen corresponding path program 1 times [2019-12-18 14:34:27,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:27,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316125184] [2019-12-18 14:34:27,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:27,894 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 14:34:27,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316125184] [2019-12-18 14:34:27,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:27,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:34:27,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228757552] [2019-12-18 14:34:27,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:34:27,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:27,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:34:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:34:27,897 INFO L87 Difference]: Start difference. First operand 57838 states and 217912 transitions. Second operand 5 states. [2019-12-18 14:34:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:28,501 INFO L93 Difference]: Finished difference Result 72076 states and 269083 transitions. [2019-12-18 14:34:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:34:28,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 14:34:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:28,759 INFO L225 Difference]: With dead ends: 72076 [2019-12-18 14:34:28,759 INFO L226 Difference]: Without dead ends: 72076 [2019-12-18 14:34:28,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:34:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72076 states. [2019-12-18 14:34:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72076 to 57278. [2019-12-18 14:34:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57278 states. [2019-12-18 14:34:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57278 states to 57278 states and 216046 transitions. [2019-12-18 14:34:33,102 INFO L78 Accepts]: Start accepts. Automaton has 57278 states and 216046 transitions. Word has length 16 [2019-12-18 14:34:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:33,103 INFO L462 AbstractCegarLoop]: Abstraction has 57278 states and 216046 transitions. [2019-12-18 14:34:33,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:34:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 57278 states and 216046 transitions. [2019-12-18 14:34:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 14:34:33,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:33,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] [2019-12-18 14:34:33,123 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1834139520, now seen corresponding path program 1 times [2019-12-18 14:34:33,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:33,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831129815] [2019-12-18 14:34:33,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:33,182 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 14:34:33,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831129815] [2019-12-18 14:34:33,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:33,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:34:33,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454594486] [2019-12-18 14:34:33,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:33,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:33,184 INFO L87 Difference]: Start difference. First operand 57278 states and 216046 transitions. Second operand 3 states. [2019-12-18 14:34:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:33,422 INFO L93 Difference]: Finished difference Result 54970 states and 205544 transitions. [2019-12-18 14:34:33,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:33,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 14:34:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:33,551 INFO L225 Difference]: With dead ends: 54970 [2019-12-18 14:34:33,551 INFO L226 Difference]: Without dead ends: 54970 [2019-12-18 14:34:33,552 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 14:34:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54970 states. [2019-12-18 14:34:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54970 to 54730. [2019-12-18 14:34:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54730 states. [2019-12-18 14:34:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54730 states to 54730 states and 204728 transitions. [2019-12-18 14:34:35,031 INFO L78 Accepts]: Start accepts. Automaton has 54730 states and 204728 transitions. Word has length 20 [2019-12-18 14:34:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:35,031 INFO L462 AbstractCegarLoop]: Abstraction has 54730 states and 204728 transitions. [2019-12-18 14:34:35,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54730 states and 204728 transitions. [2019-12-18 14:34:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 14:34:35,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:35,045 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] [2019-12-18 14:34:35,045 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash 916890148, now seen corresponding path program 1 times [2019-12-18 14:34:35,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:35,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854330468] [2019-12-18 14:34:35,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:35,133 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 14:34:35,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854330468] [2019-12-18 14:34:35,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:35,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:35,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452904195] [2019-12-18 14:34:35,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:34:35,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:35,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:34:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:34:35,136 INFO L87 Difference]: Start difference. First operand 54730 states and 204728 transitions. Second operand 4 states. [2019-12-18 14:34:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:35,274 INFO L93 Difference]: Finished difference Result 32666 states and 106197 transitions. [2019-12-18 14:34:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:34:35,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-18 14:34:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:35,340 INFO L225 Difference]: With dead ends: 32666 [2019-12-18 14:34:35,340 INFO L226 Difference]: Without dead ends: 30386 [2019-12-18 14:34:35,341 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 14:34:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30386 states. [2019-12-18 14:34:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30386 to 30386. [2019-12-18 14:34:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30386 states. [2019-12-18 14:34:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30386 states to 30386 states and 98664 transitions. [2019-12-18 14:34:36,570 INFO L78 Accepts]: Start accepts. Automaton has 30386 states and 98664 transitions. Word has length 20 [2019-12-18 14:34:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:36,570 INFO L462 AbstractCegarLoop]: Abstraction has 30386 states and 98664 transitions. [2019-12-18 14:34:36,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:34:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30386 states and 98664 transitions. [2019-12-18 14:34:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 14:34:36,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:36,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:36,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash -385683241, now seen corresponding path program 1 times [2019-12-18 14:34:36,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:36,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919733552] [2019-12-18 14:34:36,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:34:36,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919733552] [2019-12-18 14:34:36,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:36,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:34:36,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928776168] [2019-12-18 14:34:36,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:34:36,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:34:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:34:36,651 INFO L87 Difference]: Start difference. First operand 30386 states and 98664 transitions. Second operand 5 states. [2019-12-18 14:34:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:36,718 INFO L93 Difference]: Finished difference Result 5545 states and 15258 transitions. [2019-12-18 14:34:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:34:36,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 14:34:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:36,725 INFO L225 Difference]: With dead ends: 5545 [2019-12-18 14:34:36,726 INFO L226 Difference]: Without dead ends: 4300 [2019-12-18 14:34:36,726 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 14:34:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2019-12-18 14:34:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4252. [2019-12-18 14:34:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4252 states. [2019-12-18 14:34:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 11137 transitions. [2019-12-18 14:34:36,784 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 11137 transitions. Word has length 21 [2019-12-18 14:34:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:36,784 INFO L462 AbstractCegarLoop]: Abstraction has 4252 states and 11137 transitions. [2019-12-18 14:34:36,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:34:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 11137 transitions. [2019-12-18 14:34:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:34:36,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:36,787 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 14:34:36,788 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash 849569807, now seen corresponding path program 1 times [2019-12-18 14:34:36,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:36,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89194931] [2019-12-18 14:34:36,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:36,897 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 14:34:36,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89194931] [2019-12-18 14:34:36,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:36,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:34:36,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850604367] [2019-12-18 14:34:36,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:34:36,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:34:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:34:36,899 INFO L87 Difference]: Start difference. First operand 4252 states and 11137 transitions. Second operand 6 states. [2019-12-18 14:34:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:37,352 INFO L93 Difference]: Finished difference Result 5485 states and 14002 transitions. [2019-12-18 14:34:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:34:37,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 14:34:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:37,360 INFO L225 Difference]: With dead ends: 5485 [2019-12-18 14:34:37,361 INFO L226 Difference]: Without dead ends: 5437 [2019-12-18 14:34:37,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:34:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2019-12-18 14:34:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4351. [2019-12-18 14:34:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2019-12-18 14:34:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 11378 transitions. [2019-12-18 14:34:37,414 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 11378 transitions. Word has length 27 [2019-12-18 14:34:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:37,414 INFO L462 AbstractCegarLoop]: Abstraction has 4351 states and 11378 transitions. [2019-12-18 14:34:37,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:34:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 11378 transitions. [2019-12-18 14:34:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:34:37,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:37,419 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 14:34:37,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:37,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1399306623, now seen corresponding path program 1 times [2019-12-18 14:34:37,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:37,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150967918] [2019-12-18 14:34:37,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:37,460 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 14:34:37,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150967918] [2019-12-18 14:34:37,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:37,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:37,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356928193] [2019-12-18 14:34:37,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:37,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:37,462 INFO L87 Difference]: Start difference. First operand 4351 states and 11378 transitions. Second operand 3 states. [2019-12-18 14:34:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:37,511 INFO L93 Difference]: Finished difference Result 5219 states and 13168 transitions. [2019-12-18 14:34:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:37,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 14:34:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:37,519 INFO L225 Difference]: With dead ends: 5219 [2019-12-18 14:34:37,520 INFO L226 Difference]: Without dead ends: 5219 [2019-12-18 14:34:37,520 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 14:34:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-18 14:34:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4335. [2019-12-18 14:34:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2019-12-18 14:34:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 11088 transitions. [2019-12-18 14:34:37,593 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 11088 transitions. Word has length 27 [2019-12-18 14:34:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:37,594 INFO L462 AbstractCegarLoop]: Abstraction has 4335 states and 11088 transitions. [2019-12-18 14:34:37,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 11088 transitions. [2019-12-18 14:34:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:34:37,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:37,599 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 14:34:37,599 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1834461847, now seen corresponding path program 1 times [2019-12-18 14:34:37,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:37,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80070118] [2019-12-18 14:34:37,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:37,702 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 14:34:37,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80070118] [2019-12-18 14:34:37,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:37,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:34:37,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457885064] [2019-12-18 14:34:37,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:34:37,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:37,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:34:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:34:37,705 INFO L87 Difference]: Start difference. First operand 4335 states and 11088 transitions. Second operand 6 states. [2019-12-18 14:34:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:38,294 INFO L93 Difference]: Finished difference Result 7824 states and 19768 transitions. [2019-12-18 14:34:38,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:34:38,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 14:34:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:38,304 INFO L225 Difference]: With dead ends: 7824 [2019-12-18 14:34:38,304 INFO L226 Difference]: Without dead ends: 7766 [2019-12-18 14:34:38,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:34:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-12-18 14:34:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 4183. [2019-12-18 14:34:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2019-12-18 14:34:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 10699 transitions. [2019-12-18 14:34:38,961 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 10699 transitions. Word has length 28 [2019-12-18 14:34:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:38,961 INFO L462 AbstractCegarLoop]: Abstraction has 4183 states and 10699 transitions. [2019-12-18 14:34:38,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:34:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 10699 transitions. [2019-12-18 14:34:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 14:34:38,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:38,966 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] [2019-12-18 14:34:38,966 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1865234292, now seen corresponding path program 1 times [2019-12-18 14:34:38,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:38,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771628246] [2019-12-18 14:34:38,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:39,116 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 14:34:39,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771628246] [2019-12-18 14:34:39,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:39,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:34:39,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400687080] [2019-12-18 14:34:39,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:34:39,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:34:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:34:39,118 INFO L87 Difference]: Start difference. First operand 4183 states and 10699 transitions. Second operand 6 states. [2019-12-18 14:34:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:39,204 INFO L93 Difference]: Finished difference Result 2573 states and 6950 transitions. [2019-12-18 14:34:39,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:34:39,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 14:34:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:39,208 INFO L225 Difference]: With dead ends: 2573 [2019-12-18 14:34:39,209 INFO L226 Difference]: Without dead ends: 2464 [2019-12-18 14:34:39,209 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 14:34:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-12-18 14:34:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2019-12-18 14:34:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2019-12-18 14:34:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 6706 transitions. [2019-12-18 14:34:39,256 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 6706 transitions. Word has length 32 [2019-12-18 14:34:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:39,259 INFO L462 AbstractCegarLoop]: Abstraction has 2464 states and 6706 transitions. [2019-12-18 14:34:39,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:34:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 6706 transitions. [2019-12-18 14:34:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:34:39,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:39,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:39,268 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:39,268 INFO L82 PathProgramCache]: Analyzing trace with hash 920348685, now seen corresponding path program 1 times [2019-12-18 14:34:39,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:39,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622358055] [2019-12-18 14:34:39,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:39,352 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 14:34:39,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622358055] [2019-12-18 14:34:39,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:39,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:39,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139162656] [2019-12-18 14:34:39,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:39,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:39,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:39,356 INFO L87 Difference]: Start difference. First operand 2464 states and 6706 transitions. Second operand 3 states. [2019-12-18 14:34:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:39,544 INFO L93 Difference]: Finished difference Result 3224 states and 8738 transitions. [2019-12-18 14:34:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:39,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 14:34:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:39,550 INFO L225 Difference]: With dead ends: 3224 [2019-12-18 14:34:39,550 INFO L226 Difference]: Without dead ends: 3224 [2019-12-18 14:34:39,551 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 14:34:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-12-18 14:34:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2744. [2019-12-18 14:34:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-18 14:34:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 7458 transitions. [2019-12-18 14:34:39,602 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 7458 transitions. Word has length 57 [2019-12-18 14:34:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:39,602 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 7458 transitions. [2019-12-18 14:34:39,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 7458 transitions. [2019-12-18 14:34:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:34:39,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:39,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:39,609 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2004340659, now seen corresponding path program 2 times [2019-12-18 14:34:39,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:39,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21838342] [2019-12-18 14:34:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:39,697 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 14:34:39,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21838342] [2019-12-18 14:34:39,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:39,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:34:39,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535774942] [2019-12-18 14:34:39,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:39,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:39,700 INFO L87 Difference]: Start difference. First operand 2744 states and 7458 transitions. Second operand 3 states. [2019-12-18 14:34:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:39,771 INFO L93 Difference]: Finished difference Result 3078 states and 8141 transitions. [2019-12-18 14:34:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:39,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 14:34:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:39,775 INFO L225 Difference]: With dead ends: 3078 [2019-12-18 14:34:39,776 INFO L226 Difference]: Without dead ends: 3078 [2019-12-18 14:34:39,777 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 14:34:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-12-18 14:34:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2570. [2019-12-18 14:34:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-18 14:34:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 6869 transitions. [2019-12-18 14:34:39,819 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 6869 transitions. Word has length 57 [2019-12-18 14:34:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:39,819 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 6869 transitions. [2019-12-18 14:34:39,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 6869 transitions. [2019-12-18 14:34:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 14:34:39,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:39,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:39,824 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:39,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash -320339371, now seen corresponding path program 1 times [2019-12-18 14:34:39,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:39,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750305338] [2019-12-18 14:34:39,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:39,972 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 14:34:39,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750305338] [2019-12-18 14:34:39,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:39,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:39,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40653294] [2019-12-18 14:34:39,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:39,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:39,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:39,976 INFO L87 Difference]: Start difference. First operand 2570 states and 6869 transitions. Second operand 3 states. [2019-12-18 14:34:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:39,997 INFO L93 Difference]: Finished difference Result 2569 states and 6867 transitions. [2019-12-18 14:34:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:39,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 14:34:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:40,005 INFO L225 Difference]: With dead ends: 2569 [2019-12-18 14:34:40,005 INFO L226 Difference]: Without dead ends: 2569 [2019-12-18 14:34:40,008 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 14:34:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2019-12-18 14:34:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2569. [2019-12-18 14:34:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-12-18 14:34:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 6867 transitions. [2019-12-18 14:34:40,062 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 6867 transitions. Word has length 58 [2019-12-18 14:34:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:40,064 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 6867 transitions. [2019-12-18 14:34:40,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 6867 transitions. [2019-12-18 14:34:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:34:40,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:40,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:40,072 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:40,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1355522643, now seen corresponding path program 1 times [2019-12-18 14:34:40,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:40,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882690814] [2019-12-18 14:34:40,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:40,609 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 14:34:40,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882690814] [2019-12-18 14:34:40,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:40,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:34:40,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183518991] [2019-12-18 14:34:40,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:34:40,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:40,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:34:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:34:40,611 INFO L87 Difference]: Start difference. First operand 2569 states and 6867 transitions. Second operand 17 states. [2019-12-18 14:34:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:43,776 INFO L93 Difference]: Finished difference Result 6079 states and 15318 transitions. [2019-12-18 14:34:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 14:34:43,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 14:34:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:43,783 INFO L225 Difference]: With dead ends: 6079 [2019-12-18 14:34:43,783 INFO L226 Difference]: Without dead ends: 3674 [2019-12-18 14:34:43,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 14:34:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-12-18 14:34:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2644. [2019-12-18 14:34:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2019-12-18 14:34:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 7096 transitions. [2019-12-18 14:34:43,816 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 7096 transitions. Word has length 59 [2019-12-18 14:34:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:43,816 INFO L462 AbstractCegarLoop]: Abstraction has 2644 states and 7096 transitions. [2019-12-18 14:34:43,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:34:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 7096 transitions. [2019-12-18 14:34:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:34:43,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:43,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:43,822 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1895337163, now seen corresponding path program 2 times [2019-12-18 14:34:43,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:43,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372151088] [2019-12-18 14:34:43,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:43,909 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 14:34:43,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372151088] [2019-12-18 14:34:43,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:43,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:43,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105042407] [2019-12-18 14:34:43,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:34:43,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:34:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:34:43,911 INFO L87 Difference]: Start difference. First operand 2644 states and 7096 transitions. Second operand 5 states. [2019-12-18 14:34:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:43,948 INFO L93 Difference]: Finished difference Result 3546 states and 9044 transitions. [2019-12-18 14:34:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:34:43,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 14:34:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:43,950 INFO L225 Difference]: With dead ends: 3546 [2019-12-18 14:34:43,950 INFO L226 Difference]: Without dead ends: 987 [2019-12-18 14:34:43,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 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 14:34:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-12-18 14:34:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2019-12-18 14:34:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-18 14:34:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2108 transitions. [2019-12-18 14:34:43,963 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2108 transitions. Word has length 59 [2019-12-18 14:34:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:43,964 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 2108 transitions. [2019-12-18 14:34:43,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:34:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2108 transitions. [2019-12-18 14:34:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:34:43,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:43,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:43,966 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1593378973, now seen corresponding path program 3 times [2019-12-18 14:34:43,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:43,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989018155] [2019-12-18 14:34:43,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:44,074 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 14:34:44,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989018155] [2019-12-18 14:34:44,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:44,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:34:44,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660903552] [2019-12-18 14:34:44,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:34:44,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:34:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:34:44,076 INFO L87 Difference]: Start difference. First operand 987 states and 2108 transitions. Second operand 5 states. [2019-12-18 14:34:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:44,110 INFO L93 Difference]: Finished difference Result 1186 states and 2490 transitions. [2019-12-18 14:34:44,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:34:44,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 14:34:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:44,111 INFO L225 Difference]: With dead ends: 1186 [2019-12-18 14:34:44,111 INFO L226 Difference]: Without dead ends: 248 [2019-12-18 14:34:44,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 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 14:34:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-18 14:34:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-12-18 14:34:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-18 14:34:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 446 transitions. [2019-12-18 14:34:44,115 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 446 transitions. Word has length 59 [2019-12-18 14:34:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:44,115 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 446 transitions. [2019-12-18 14:34:44,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:34:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 446 transitions. [2019-12-18 14:34:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:34:44,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:44,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:44,117 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1947312003, now seen corresponding path program 4 times [2019-12-18 14:34:44,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:44,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44098555] [2019-12-18 14:34:44,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:34:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:34:44,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:34:44,330 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:34:44,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1180] [1180] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse1 (store |v_#valid_78| 0 0))) (let ((.cse0 (store .cse1 |v_~#y~0.base_164| 1))) (and (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8) (< 0 |v_#StackHeapBarrier_25|) (= v_~z~0_24 0) (= 0 v_~y$r_buff1_thd2~0_265) (= 0 v_~__unbuffered_cnt~0_71) (= v_~y$r_buff1_thd0~0_314 0) (= |v_#length_37| (store (store |v_#length_39| |v_~#y~0.base_164| 4) |v_ULTIMATE.start_main_~#t1940~0.base_22| 4)) (= 0 v_~__unbuffered_p2_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p2_EAX$w_buff1~0_7) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_298| (store |v_#memory_int_299| |v_ULTIMATE.start_main_~#t1940~0.base_22| (store (select |v_#memory_int_299| |v_ULTIMATE.start_main_~#t1940~0.base_22|) |v_ULTIMATE.start_main_~#t1940~0.offset_17| 0))) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45) (= v_~y$mem_tmp~0_15 0) (= 0 v_~__unbuffered_p2_EAX$mem_tmp~0_8) (= 0 v_~weak$$choice1~0_99) (= 0 v_~y$r_buff0_thd2~0_413) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd1~0_225 0) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1940~0.base_22|) 0) (= 0 |v_#NULL.base_5|) (= v_~main$tmp_guard0~0_51 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_1532) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1940~0.base_22| 1)) (= 0 v_~y$r_buff0_thd3~0_885) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7) (= v_~y$r_buff0_thd0~0_245 0) (= 0 |v_~#y~0.offset_164|) (= 0 v_~y$w_buff1_used~0_1325) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7) (= v_~y$w_buff1~0_855 0) (= 0 v_~__unbuffered_p2_EAX$w_buff1_used~0_7) (= v_~main$tmp_guard1~0_30 0) (= v_~y$w_buff0_used~0_2077 0) (= 0 v_~weak$$choice0~0_215) (= v_~weak$$choice2~0_122 0) (= (select .cse1 |v_~#y~0.base_164|) 0) (= 0 v_~__unbuffered_p2_EAX$flush_delayed~0_8) (= v_~y$r_buff0_thd1~0_140 0) (= 0 v_~y$r_buff1_thd3~0_805) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 0) (< |v_#StackHeapBarrier_25| |v_~#y~0.base_164|) (= v_~__unbuffered_p1_EAX~0_749 0) (= |v_ULTIMATE.start_main_~#t1940~0.offset_17| 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$flush_delayed~0_26) (= 0 v_~__unbuffered_p2_EAX$w_buff0~0_8) (= 0 v_~x~0_741) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8) (= (select (select |v_#memory_int_299| |v_~#y~0.base_164|) |v_~#y~0.offset_164|) 0) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t1940~0.base_22|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_299|, #length=|v_#length_39|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_65|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45, ULTIMATE.start_main_~#t1941~0.offset=|v_ULTIMATE.start_main_~#t1941~0.offset_15|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_83|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_86|, ~weak$$choice1~0=v_~weak$$choice1~0_99, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_805, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_749, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_140, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~__unbuffered_p2_EAX$w_buff0_used~0=v_~__unbuffered_p2_EAX$w_buff0_used~0_7, #length=|v_#length_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~__unbuffered_p2_EAX$r_buff1_thd2~0=v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7, ULTIMATE.start_main_~#t1942~0.base=|v_ULTIMATE.start_main_~#t1942~0.base_19|, ~__unbuffered_p2_EAX$r_buff0_thd0~0=v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_35|, ~__unbuffered_p2_EAX$w_buff0~0=v_~__unbuffered_p2_EAX$w_buff0~0_8, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_22|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_7|, ULTIMATE.start_main_~#t1941~0.base=|v_ULTIMATE.start_main_~#t1941~0.base_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_55|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_85|, ULTIMATE.start_main_~#t1940~0.base=|v_ULTIMATE.start_main_~#t1940~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_215, #StackHeapBarrier=|v_#StackHeapBarrier_25|, ~y$w_buff1~0=v_~y$w_buff1~0_855, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_413, ~__unbuffered_p2_EAX$r_buff0_thd1~0=v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_741, ~__unbuffered_p2_EAX$r_buff1_thd3~0=v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8, ~__unbuffered_p2_EAX$w_buff1~0=v_~__unbuffered_p2_EAX$w_buff1~0_7, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~#y~0.offset=|v_~#y~0.offset_164|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_2077, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~#y~0.base=|v_~#y~0.base_164|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_225, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_59|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_141|, ~__unbuffered_p2_EAX$w_buff1_used~0=v_~__unbuffered_p2_EAX$w_buff1_used~0_7, ULTIMATE.start_main_~#t1940~0.offset=|v_ULTIMATE.start_main_~#t1940~0.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_1532, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_885, ~__unbuffered_p2_EAX$r_buff0_thd2~0=v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7, ~__unbuffered_p2_EAX$r_buff1_thd0~0=v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8, ULTIMATE.start_main_~#t1942~0.offset=|v_ULTIMATE.start_main_~#t1942~0.offset_15|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_7|, ~__unbuffered_p2_EAX$mem_tmp~0=v_~__unbuffered_p2_EAX$mem_tmp~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_51, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_42|, ~__unbuffered_p2_EAX$flush_delayed~0=v_~__unbuffered_p2_EAX$flush_delayed~0_8, #NULL.base=|v_#NULL.base_5|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_245, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_298|, ~__unbuffered_p2_EAX$r_buff1_thd1~0=v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7, ~__unbuffered_p2_EAX$r_buff0_thd3~0=v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_122, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_90|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_1325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ULTIMATE.start_main_~#t1941~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~weak$$choice1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX$w_buff0_used~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EAX$r_buff1_thd2~0, ULTIMATE.start_main_~#t1942~0.base, ~__unbuffered_p2_EAX$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem77, ~__unbuffered_p2_EAX$w_buff0~0, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~nondet66, ULTIMATE.start_main_~#t1941~0.base, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1940~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd1~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~__unbuffered_p2_EAX$r_buff1_thd3~0, ~__unbuffered_p2_EAX$w_buff1~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~__unbuffered_p2_EAX$w_buff1_used~0, ULTIMATE.start_main_~#t1940~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff1_thd0~0, ULTIMATE.start_main_~#t1942~0.offset, ULTIMATE.start_main_#t~nondet67, ~__unbuffered_p2_EAX$mem_tmp~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, ~__unbuffered_p2_EAX$flush_delayed~0, #NULL.base, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p2_EAX$r_buff1_thd1~0, ~__unbuffered_p2_EAX$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_#t~mem69, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:34:44,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L837-1-->L839: Formula: (and (= |v_#memory_int_213| (store |v_#memory_int_214| |v_ULTIMATE.start_main_~#t1941~0.base_12| (store (select |v_#memory_int_214| |v_ULTIMATE.start_main_~#t1941~0.base_12|) |v_ULTIMATE.start_main_~#t1941~0.offset_10| 1))) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1941~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t1941~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1941~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1941~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t1941~0.base_12| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1941~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_214|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_4|, #memory_int=|v_#memory_int_213|, ULTIMATE.start_main_~#t1941~0.offset=|v_ULTIMATE.start_main_~#t1941~0.offset_10|, ULTIMATE.start_main_~#t1941~0.base=|v_ULTIMATE.start_main_~#t1941~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet66, #memory_int, ULTIMATE.start_main_~#t1941~0.offset, ULTIMATE.start_main_~#t1941~0.base, #length] because there is no mapped edge [2019-12-18 14:34:44,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1124] [1124] L839-1-->L841: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1942~0.base_10| 1)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1942~0.base_10| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1942~0.base_10|) |v_ULTIMATE.start_main_~#t1942~0.offset_9| 2)) |v_#memory_int_167|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1942~0.base_10| 4)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1942~0.base_10|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1942~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1942~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1942~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_168|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1942~0.offset=|v_ULTIMATE.start_main_~#t1942~0.offset_9|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_167|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1942~0.base=|v_ULTIMATE.start_main_~#t1942~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1942~0.offset, ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1942~0.base] because there is no mapped edge [2019-12-18 14:34:44,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1147] [1147] L799-->L799-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1662208280 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In1662208280 |P2Thread1of1ForFork2_#t~ite34_Out1662208280|) (= |P2Thread1of1ForFork2_#t~ite33_In1662208280| |P2Thread1of1ForFork2_#t~ite33_Out1662208280|)) (and (= (mod ~y$w_buff0_used~0_In1662208280 256) 0) (= |P2Thread1of1ForFork2_#t~ite33_Out1662208280| |P2Thread1of1ForFork2_#t~ite34_Out1662208280|) (= |P2Thread1of1ForFork2_#t~ite33_Out1662208280| ~y$w_buff1~0_In1662208280) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1662208280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1662208280, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_In1662208280|, ~weak$$choice2~0=~weak$$choice2~0_In1662208280} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1662208280|, ~y$w_buff1~0=~y$w_buff1~0_In1662208280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1662208280, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1662208280|, ~weak$$choice2~0=~weak$$choice2~0_In1662208280} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34, P2Thread1of1ForFork2_#t~ite33] because there is no mapped edge [2019-12-18 14:34:44,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1148] [1148] L801-->L801-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1760512904 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite44_Out-1760512904| |P2Thread1of1ForFork2_#t~ite43_Out-1760512904|) .cse0 (= (mod ~y$w_buff0_used~0_In-1760512904 256) 0) (= |P2Thread1of1ForFork2_#t~ite43_Out-1760512904| ~y$w_buff1_used~0_In-1760512904)) (and (= |P2Thread1of1ForFork2_#t~ite43_In-1760512904| |P2Thread1of1ForFork2_#t~ite43_Out-1760512904|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite44_Out-1760512904| ~y$w_buff1_used~0_In-1760512904)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1760512904, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_In-1760512904|, ~weak$$choice2~0=~weak$$choice2~0_In-1760512904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1760512904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1760512904, P2Thread1of1ForFork2_#t~ite44=|P2Thread1of1ForFork2_#t~ite44_Out-1760512904|, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1760512904|, ~weak$$choice2~0=~weak$$choice2~0_In-1760512904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1760512904} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite44, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 14:34:44,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L802-->L803: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_33 256))) (= v_~y$r_buff0_thd3~0_255 v_~y$r_buff0_thd3~0_254)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_255, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P2Thread1of1ForFork2_#t~ite46=|v_P2Thread1of1ForFork2_#t~ite46_15|, P2Thread1of1ForFork2_#t~ite45=|v_P2Thread1of1ForFork2_#t~ite45_14|, P2Thread1of1ForFork2_#t~ite48=|v_P2Thread1of1ForFork2_#t~ite48_11|, P2Thread1of1ForFork2_#t~ite47=|v_P2Thread1of1ForFork2_#t~ite47_14|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_33, P2Thread1of1ForFork2_#t~ite49=|v_P2Thread1of1ForFork2_#t~ite49_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite46, P2Thread1of1ForFork2_#t~ite45, P2Thread1of1ForFork2_#t~ite48, P2Thread1of1ForFork2_#t~ite47, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite49] because there is no mapped edge [2019-12-18 14:34:44,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L807-->L814: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= |v_#memory_int_99| (store |v_#memory_int_100| |v_~#y~0.base_59| (store (select |v_#memory_int_100| |v_~#y~0.base_59|) |v_~#y~0.offset_59| v_~y$mem_tmp~0_7))) (= v_~z~0_10 1) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, #memory_int=|v_#memory_int_100|, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~#y~0.base=|v_~#y~0.base_59|} OutVars{P2Thread1of1ForFork2_#t~ite58=|v_P2Thread1of1ForFork2_#t~ite58_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, P2Thread1of1ForFork2_#t~mem57=|v_P2Thread1of1ForFork2_#t~mem57_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, #memory_int=|v_#memory_int_99|, ~z~0=v_~z~0_10, ~#y~0.base=|v_~#y~0.base_59|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58, P2Thread1of1ForFork2_#t~mem57, ~y$flush_delayed~0, #memory_int, ~z~0] because there is no mapped edge [2019-12-18 14:34:44,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1107] [1107] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_~z~0_16 v_~__unbuffered_p0_EAX~0_21) (= 1 v_~x~0_275)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~z~0=v_~z~0_16} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~z~0=v_~z~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_275, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:34:44,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L814-2-->L814-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In566253228 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In566253228 256) 0)) (.cse0 (= |P2Thread1of1ForFork2_#t~ite61_Out566253228| |P2Thread1of1ForFork2_#t~ite60_Out566253228|))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~mem59_In566253228| |P2Thread1of1ForFork2_#t~mem59_Out566253228|) (not .cse1) (not .cse2) (= ~y$w_buff1~0_In566253228 |P2Thread1of1ForFork2_#t~ite60_Out566253228|)) (and (or .cse2 .cse1) (= |P2Thread1of1ForFork2_#t~mem59_Out566253228| |P2Thread1of1ForFork2_#t~ite60_Out566253228|) .cse0 (= (select (select |#memory_int_In566253228| |~#y~0.base_In566253228|) |~#y~0.offset_In566253228|) |P2Thread1of1ForFork2_#t~mem59_Out566253228|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In566253228, ~#y~0.offset=|~#y~0.offset_In566253228|, ~y$w_buff1~0=~y$w_buff1~0_In566253228, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_In566253228|, #memory_int=|#memory_int_In566253228|, ~#y~0.base=|~#y~0.base_In566253228|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In566253228} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In566253228, ~#y~0.offset=|~#y~0.offset_In566253228|, ~y$w_buff1~0=~y$w_buff1~0_In566253228, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_Out566253228|, P2Thread1of1ForFork2_#t~ite61=|P2Thread1of1ForFork2_#t~ite61_Out566253228|, #memory_int=|#memory_int_In566253228|, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out566253228|, ~#y~0.base=|~#y~0.base_In566253228|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In566253228} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~mem59, P2Thread1of1ForFork2_#t~ite61, P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-18 14:34:44,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1088] [1088] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1829271832 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1829271832 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite62_Out1829271832|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite62_Out1829271832| ~y$w_buff0_used~0_In1829271832)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1829271832, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1829271832} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1829271832, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1829271832, P2Thread1of1ForFork2_#t~ite62=|P2Thread1of1ForFork2_#t~ite62_Out1829271832|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite62] because there is no mapped edge [2019-12-18 14:34:44,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_113 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_111|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_111| v_P1Thread1of1ForFork1_~arg.offset_111) (= v_P1Thread1of1ForFork1_~arg.base_111 |v_P1Thread1of1ForFork1_#in~arg.base_111|) (= v_~y$w_buff1~0_135 v_~y$w_buff0~0_238) (= 1 v_~y$w_buff0~0_237) (= v_~y$w_buff0_used~0_384 v_~y$w_buff1_used~0_233) (= v_~y$w_buff0_used~0_383 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_111| 1) (= v_~__unbuffered_p1_EAX~0_111 v_~x~0_115) (= (mod v_~y$w_buff1_used~0_233 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_384, ~y$w_buff0~0=v_~y$w_buff0~0_238, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_113, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_111, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_111|, ~y$w_buff0~0=v_~y$w_buff0~0_237, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:34:44,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1034390771 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1034390771 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite6_Out1034390771|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1034390771 |P1Thread1of1ForFork1_#t~ite6_Out1034390771|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1034390771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1034390771} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1034390771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1034390771, P1Thread1of1ForFork1_#t~ite6=|P1Thread1of1ForFork1_#t~ite6_Out1034390771|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 14:34:44,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1074] [1074] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In65067389 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In65067389 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In65067389 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In65067389 256) 0))) (or (and (= ~y$w_buff1_used~0_In65067389 |P1Thread1of1ForFork1_#t~ite7_Out65067389|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite7_Out65067389|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In65067389, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65067389, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65067389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65067389} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In65067389, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65067389, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65067389, P1Thread1of1ForFork1_#t~ite7=|P1Thread1of1ForFork1_#t~ite7_Out65067389|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65067389} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-18 14:34:44,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1096] [1096] L781-->L782: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1922881757 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1922881757 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1922881757 ~y$r_buff0_thd2~0_Out1922881757)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out1922881757)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1922881757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1922881757} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1922881757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1922881757, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1922881757|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 14:34:44,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2037364265 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2037364265 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2037364265 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2037364265 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-2037364265 |P1Thread1of1ForFork1_#t~ite9_Out-2037364265|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2037364265| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037364265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037364265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037364265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037364265} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037364265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037364265, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2037364265|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037364265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037364265} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:34:44,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1138] [1138] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork1_#t~ite9_24|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite9, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:34:44,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In441986874 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In441986874 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In441986874 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In441986874 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite63_Out441986874| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite63_Out441986874| ~y$w_buff1_used~0_In441986874) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In441986874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In441986874, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In441986874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In441986874} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In441986874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In441986874, P2Thread1of1ForFork2_#t~ite63=|P2Thread1of1ForFork2_#t~ite63_Out441986874|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In441986874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In441986874} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite63] because there is no mapped edge [2019-12-18 14:34:44,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1092] [1092] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In979548371 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In979548371 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite64_Out979548371| ~y$r_buff0_thd3~0_In979548371)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite64_Out979548371|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In979548371, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In979548371} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In979548371, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In979548371, P2Thread1of1ForFork2_#t~ite64=|P2Thread1of1ForFork2_#t~ite64_Out979548371|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite64] because there is no mapped edge [2019-12-18 14:34:44,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1083] [1083] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2095664081 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-2095664081 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2095664081 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-2095664081 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite65_Out-2095664081| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite65_Out-2095664081| ~y$r_buff1_thd3~0_In-2095664081) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2095664081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095664081, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2095664081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095664081} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2095664081, P2Thread1of1ForFork2_#t~ite65=|P2Thread1of1ForFork2_#t~ite65_Out-2095664081|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095664081, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2095664081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095664081} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65] because there is no mapped edge [2019-12-18 14:34:44,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1128] [1128] L818-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork2_#t~ite65_22| v_~y$r_buff1_thd3~0_421) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_421, P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_21|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:34:44,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L845-->L847-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_10 256) 0)) (or (= (mod v_~y$r_buff0_thd0~0_79 256) 0) (= (mod v_~y$w_buff0_used~0_492 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:34:44,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1087] [1087] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-457976941 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-457976941 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~mem69_In-457976941| |ULTIMATE.start_main_#t~mem69_Out-457976941|) (= ~y$w_buff1~0_In-457976941 |ULTIMATE.start_main_#t~ite70_Out-457976941|)) (and (= |ULTIMATE.start_main_#t~mem69_Out-457976941| |ULTIMATE.start_main_#t~ite70_Out-457976941|) (or .cse1 .cse0) (= (select (select |#memory_int_In-457976941| |~#y~0.base_In-457976941|) |~#y~0.offset_In-457976941|) |ULTIMATE.start_main_#t~mem69_Out-457976941|)))) InVars {~#y~0.offset=|~#y~0.offset_In-457976941|, ~y$w_buff1~0=~y$w_buff1~0_In-457976941, #memory_int=|#memory_int_In-457976941|, ~#y~0.base=|~#y~0.base_In-457976941|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-457976941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-457976941, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_In-457976941|} OutVars{~#y~0.offset=|~#y~0.offset_In-457976941|, ~y$w_buff1~0=~y$w_buff1~0_In-457976941, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-457976941|, #memory_int=|#memory_int_In-457976941|, ~#y~0.base=|~#y~0.base_In-457976941|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-457976941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-457976941, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_Out-457976941|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-18 14:34:44,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-4-->L848: Formula: (= (store |v_#memory_int_69| |v_~#y~0.base_37| (store (select |v_#memory_int_69| |v_~#y~0.base_37|) |v_~#y~0.offset_37| |v_ULTIMATE.start_main_#t~ite70_13|)) |v_#memory_int_68|) InVars {~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, #memory_int=|v_#memory_int_69|, ~#y~0.base=|v_~#y~0.base_37|} OutVars{ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_12|, #memory_int=|v_#memory_int_68|, ~#y~0.base=|v_~#y~0.base_37|, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite70, #memory_int, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-18 14:34:44,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1077] [1077] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1796085542 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1796085542 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite72_Out1796085542| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite72_Out1796085542| ~y$w_buff0_used~0_In1796085542)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1796085542, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1796085542} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out1796085542|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1796085542, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1796085542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-18 14:34:44,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1194369015 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1194369015 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1194369015 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1194369015 256)))) (or (and (= ~y$w_buff1_used~0_In1194369015 |ULTIMATE.start_main_#t~ite73_Out1194369015|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite73_Out1194369015|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1194369015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1194369015, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194369015, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194369015} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1194369015|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1194369015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1194369015, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194369015, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194369015} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-18 14:34:44,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1615427405 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1615427405 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite74_Out1615427405| 0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1615427405 |ULTIMATE.start_main_#t~ite74_Out1615427405|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1615427405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1615427405} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1615427405|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1615427405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1615427405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-18 14:34:44,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In579539037 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In579539037 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In579539037 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In579539037 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite75_Out579539037|)) (and (= ~y$r_buff1_thd0~0_In579539037 |ULTIMATE.start_main_#t~ite75_Out579539037|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In579539037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In579539037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In579539037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In579539037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In579539037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In579539037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In579539037, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out579539037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In579539037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-18 14:34:44,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] L855-->L855-3: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice1~0_In-1102894675 256))) (.cse1 (not (= 0 (mod ~__unbuffered_p2_EAX$read_delayed~0_In-1102894675 256))))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_#t~mem77_In-1102894675| |ULTIMATE.start_main_#t~mem77_Out-1102894675|) (= |ULTIMATE.start_main_#t~ite78_Out-1102894675| ~__unbuffered_p2_EAX~0_In-1102894675)) (and (= |ULTIMATE.start_main_#t~mem77_Out-1102894675| (select (select |#memory_int_In-1102894675| ~__unbuffered_p2_EAX$read_delayed_var~0.base_In-1102894675) ~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-1102894675)) (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~mem77_Out-1102894675| |ULTIMATE.start_main_#t~ite78_Out-1102894675|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1102894675, ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_In-1102894675|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-1102894675, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-1102894675, #memory_int=|#memory_int_In-1102894675|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-1102894675, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-1102894675} OutVars{ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_Out-1102894675|, ~weak$$choice1~0=~weak$$choice1~0_In-1102894675, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-1102894675, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-1102894675, #memory_int=|#memory_int_In-1102894675|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-1102894675, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-1102894675|, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-1102894675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-18 14:34:44,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1141] [1141] L855-3-->L4: Formula: (and (let ((.cse1 (= 1 v_~__unbuffered_p0_EAX~0_26)) (.cse2 (= v_~__unbuffered_p1_EAX~0_540 1)) (.cse0 (= 1 v_~__unbuffered_p2_EAX~0_50))) (or (and (= v_~main$tmp_guard1~0_17 1) (or (not .cse0) (not .cse1) (not .cse2))) (and (= v_~main$tmp_guard1~0_17 0) .cse1 .cse2 .cse0))) (= |v_ULTIMATE.start_main_#t~ite78_30| v_~__unbuffered_p2_EAX~0_50) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_25|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_34|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite78, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:34:44,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:34:44,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:34:44 BasicIcfg [2019-12-18 14:34:44,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:34:44,477 INFO L168 Benchmark]: Toolchain (without parser) took 48114.36 ms. Allocated memory was 145.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 99.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 293.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,477 INFO L168 Benchmark]: CDTParser took 1.63 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.01 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.5 MB in the beginning and 155.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.87 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,479 INFO L168 Benchmark]: Boogie Preprocessor took 43.73 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,480 INFO L168 Benchmark]: RCFGBuilder took 1033.09 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 150.1 MB in the beginning and 204.9 MB in the end (delta: -54.8 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,480 INFO L168 Benchmark]: TraceAbstraction took 46191.77 ms. Allocated memory was 235.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:34:44,483 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.01 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.5 MB in the beginning and 155.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.87 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.73 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1033.09 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 150.1 MB in the beginning and 204.9 MB in the end (delta: -54.8 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46191.77 ms. Allocated memory was 235.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 10.0s, 224 ProgramPointsBefore, 107 ProgramPointsAfterwards, 276 TransitionsBefore, 133 TransitionsAfterwards, 22870 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 66 ConcurrentYvCompositions, 30 ChoiceCompositions, 10335 VarBasedMoverChecksPositive, 480 VarBasedMoverChecksNegative, 246 SemBasedMoverChecksPositive, 398 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.9s, 0 MoverChecksTotal, 113419 CheckedPairsTotal, 175 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] EXPR 3 \read(y) [L795] 3 y$mem_tmp = y [L796] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L797] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L797] EXPR 3 \read(y) [L797] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) VAL [!y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))=0, \read(y)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L804] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L805] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L806] EXPR 3 \read(y) [L806] 3 __unbuffered_p2_EAX = y [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L771] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L849] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L850] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L851] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2631 SDtfs, 4067 SDslu, 4741 SDs, 0 SdLazy, 3889 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57838occurred 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: 17.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 52393 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 98476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...