/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:07:59,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:07:59,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:07:59,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:07:59,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:07:59,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:07:59,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:07:59,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:07:59,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:07:59,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:07:59,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:07:59,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:07:59,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:07:59,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:07:59,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:07:59,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:07:59,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:07:59,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:07:59,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:07:59,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:07:59,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:07:59,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:07:59,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:07:59,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:07:59,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:07:59,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:07:59,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:07:59,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:07:59,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:07:59,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:07:59,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:07:59,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:07:59,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:07:59,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:07:59,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:07:59,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:07:59,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:07:59,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:07:59,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:07:59,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:07:59,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:07:59,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:07:59,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:07:59,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:07:59,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:07:59,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:07:59,246 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:07:59,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:07:59,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:07:59,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:07:59,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:07:59,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:07:59,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:07:59,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:07:59,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:07:59,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:07:59,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:07:59,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:07:59,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:07:59,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:07:59,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:07:59,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:07:59,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:07:59,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:07:59,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:07:59,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:07:59,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:07:59,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:07:59,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:07:59,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:07:59,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:07:59,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:07:59,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:07:59,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:07:59,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:07:59,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:07:59,575 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:07:59,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-27 07:07:59,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4a62105/4119aba7261e470da879944a5d84ba53/FLAGa14fddbf1 [2019-12-27 07:08:00,173 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:08:00,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-27 07:08:00,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4a62105/4119aba7261e470da879944a5d84ba53/FLAGa14fddbf1 [2019-12-27 07:08:00,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4a62105/4119aba7261e470da879944a5d84ba53 [2019-12-27 07:08:00,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:08:00,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:08:00,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:00,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:08:00,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:08:00,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:00" (1/1) ... [2019-12-27 07:08:00,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:00, skipping insertion in model container [2019-12-27 07:08:00,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:00" (1/1) ... [2019-12-27 07:08:00,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:08:00,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:08:01,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:01,029 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:08:01,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:01,204 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:08:01,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01 WrapperNode [2019-12-27 07:08:01,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:01,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:01,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:08:01,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:08:01,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:01,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:08:01,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:08:01,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:08:01,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... [2019-12-27 07:08:01,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:08:01,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:08:01,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:08:01,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:08:01,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:08:01,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:08:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:08:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:08:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:08:01,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:08:01,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:08:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:08:01,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:08:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:08:01,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:08:01,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:08:01,389 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:08:02,101 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:08:02,102 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:08:02,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:02 BoogieIcfgContainer [2019-12-27 07:08:02,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:08:02,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:08:02,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:08:02,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:08:02,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:08:00" (1/3) ... [2019-12-27 07:08:02,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f515e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:02, skipping insertion in model container [2019-12-27 07:08:02,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:01" (2/3) ... [2019-12-27 07:08:02,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f515e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:02, skipping insertion in model container [2019-12-27 07:08:02,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:02" (3/3) ... [2019-12-27 07:08:02,111 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-27 07:08:02,119 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:08:02,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:08:02,127 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:08:02,128 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:08:02,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:02,231 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:08:02,252 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:08:02,253 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:08:02,253 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:08:02,253 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:08:02,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:08:02,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:08:02,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:08:02,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:08:02,294 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-27 07:08:02,296 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 07:08:02,376 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 07:08:02,376 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:02,398 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:02,414 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 07:08:02,478 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 07:08:02,479 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:02,484 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:02,495 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 07:08:02,497 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:08:05,603 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:08:05,737 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40940 [2019-12-27 07:08:05,737 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 07:08:05,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 77 transitions [2019-12-27 07:08:06,041 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 07:08:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 07:08:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:08:06,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:06,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:08:06,052 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 679647889, now seen corresponding path program 1 times [2019-12-27 07:08:06,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:06,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749453420] [2019-12-27 07:08:06,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:06,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749453420] [2019-12-27 07:08:06,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:06,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:06,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087165420] [2019-12-27 07:08:06,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:06,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:06,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:06,304 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 07:08:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:06,583 INFO L93 Difference]: Finished difference Result 6202 states and 20974 transitions. [2019-12-27 07:08:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:06,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:08:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:06,660 INFO L225 Difference]: With dead ends: 6202 [2019-12-27 07:08:06,660 INFO L226 Difference]: Without dead ends: 5842 [2019-12-27 07:08:06,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2019-12-27 07:08:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 5842. [2019-12-27 07:08:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5842 states. [2019-12-27 07:08:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 19720 transitions. [2019-12-27 07:08:06,973 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 19720 transitions. Word has length 5 [2019-12-27 07:08:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:06,973 INFO L462 AbstractCegarLoop]: Abstraction has 5842 states and 19720 transitions. [2019-12-27 07:08:06,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 19720 transitions. [2019-12-27 07:08:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:08:06,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:06,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:06,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1194540122, now seen corresponding path program 1 times [2019-12-27 07:08:06,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:06,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189078914] [2019-12-27 07:08:06,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189078914] [2019-12-27 07:08:07,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:07,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:07,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306752788] [2019-12-27 07:08:07,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:07,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:07,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:07,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:07,054 INFO L87 Difference]: Start difference. First operand 5842 states and 19720 transitions. Second operand 3 states. [2019-12-27 07:08:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:07,093 INFO L93 Difference]: Finished difference Result 1186 states and 2950 transitions. [2019-12-27 07:08:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:07,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 07:08:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:07,101 INFO L225 Difference]: With dead ends: 1186 [2019-12-27 07:08:07,101 INFO L226 Difference]: Without dead ends: 1186 [2019-12-27 07:08:07,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-27 07:08:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-27 07:08:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-27 07:08:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2950 transitions. [2019-12-27 07:08:07,139 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2950 transitions. Word has length 11 [2019-12-27 07:08:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:07,140 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 2950 transitions. [2019-12-27 07:08:07,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2950 transitions. [2019-12-27 07:08:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:07,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:07,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:07,147 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1520947745, now seen corresponding path program 1 times [2019-12-27 07:08:07,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:07,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167945973] [2019-12-27 07:08:07,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:07,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167945973] [2019-12-27 07:08:07,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:07,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:07,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406913371] [2019-12-27 07:08:07,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:07,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:07,274 INFO L87 Difference]: Start difference. First operand 1186 states and 2950 transitions. Second operand 3 states. [2019-12-27 07:08:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:07,350 INFO L93 Difference]: Finished difference Result 1816 states and 4578 transitions. [2019-12-27 07:08:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:07,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:08:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:07,361 INFO L225 Difference]: With dead ends: 1816 [2019-12-27 07:08:07,362 INFO L226 Difference]: Without dead ends: 1816 [2019-12-27 07:08:07,362 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-27 07:08:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-27 07:08:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1300. [2019-12-27 07:08:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 07:08:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3290 transitions. [2019-12-27 07:08:07,403 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3290 transitions. Word has length 14 [2019-12-27 07:08:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:07,403 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3290 transitions. [2019-12-27 07:08:07,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3290 transitions. [2019-12-27 07:08:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:07,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:07,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:07,405 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1657479898, now seen corresponding path program 1 times [2019-12-27 07:08:07,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:07,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696073917] [2019-12-27 07:08:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:07,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696073917] [2019-12-27 07:08:07,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:07,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:07,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894005166] [2019-12-27 07:08:07,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:07,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:07,471 INFO L87 Difference]: Start difference. First operand 1300 states and 3290 transitions. Second operand 4 states. [2019-12-27 07:08:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:07,679 INFO L93 Difference]: Finished difference Result 1749 states and 4286 transitions. [2019-12-27 07:08:07,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:07,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:07,690 INFO L225 Difference]: With dead ends: 1749 [2019-12-27 07:08:07,690 INFO L226 Difference]: Without dead ends: 1749 [2019-12-27 07:08:07,690 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-27 07:08:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-12-27 07:08:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1581. [2019-12-27 07:08:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-27 07:08:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3910 transitions. [2019-12-27 07:08:07,749 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3910 transitions. Word has length 14 [2019-12-27 07:08:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:07,750 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3910 transitions. [2019-12-27 07:08:07,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3910 transitions. [2019-12-27 07:08:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:07,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:07,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:07,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash 592134812, now seen corresponding path program 1 times [2019-12-27 07:08:07,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:07,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655160312] [2019-12-27 07:08:07,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:07,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655160312] [2019-12-27 07:08:07,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:07,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:07,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515959158] [2019-12-27 07:08:07,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:07,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:07,878 INFO L87 Difference]: Start difference. First operand 1581 states and 3910 transitions. Second operand 4 states. [2019-12-27 07:08:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:08,125 INFO L93 Difference]: Finished difference Result 2006 states and 4872 transitions. [2019-12-27 07:08:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:08,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:08,146 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 07:08:08,148 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 07:08:08,148 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-27 07:08:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 07:08:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1606. [2019-12-27 07:08:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-27 07:08:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 3970 transitions. [2019-12-27 07:08:08,198 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 3970 transitions. Word has length 14 [2019-12-27 07:08:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:08,198 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 3970 transitions. [2019-12-27 07:08:08,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 3970 transitions. [2019-12-27 07:08:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:08,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:08,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:08,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:08,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:08,202 INFO L82 PathProgramCache]: Analyzing trace with hash -321167057, now seen corresponding path program 1 times [2019-12-27 07:08:08,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:08,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830267402] [2019-12-27 07:08:08,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:08,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830267402] [2019-12-27 07:08:08,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:08,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:08,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051369210] [2019-12-27 07:08:08,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:08,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:08,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:08,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:08,285 INFO L87 Difference]: Start difference. First operand 1606 states and 3970 transitions. Second operand 4 states. [2019-12-27 07:08:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:08,308 INFO L93 Difference]: Finished difference Result 714 states and 1648 transitions. [2019-12-27 07:08:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:08,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 07:08:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:08,313 INFO L225 Difference]: With dead ends: 714 [2019-12-27 07:08:08,313 INFO L226 Difference]: Without dead ends: 714 [2019-12-27 07:08:08,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-27 07:08:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 682. [2019-12-27 07:08:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-27 07:08:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1580 transitions. [2019-12-27 07:08:08,332 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1580 transitions. Word has length 26 [2019-12-27 07:08:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:08,333 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1580 transitions. [2019-12-27 07:08:08,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1580 transitions. [2019-12-27 07:08:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:08,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:08,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:08,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash 152096728, now seen corresponding path program 1 times [2019-12-27 07:08:08,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:08,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87565907] [2019-12-27 07:08:08,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:08,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87565907] [2019-12-27 07:08:08,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:08,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:08,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622532747] [2019-12-27 07:08:08,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:08,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:08,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:08,489 INFO L87 Difference]: Start difference. First operand 682 states and 1580 transitions. Second operand 3 states. [2019-12-27 07:08:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:08,507 INFO L93 Difference]: Finished difference Result 1069 states and 2520 transitions. [2019-12-27 07:08:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:08,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 07:08:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:08,512 INFO L225 Difference]: With dead ends: 1069 [2019-12-27 07:08:08,512 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 07:08:08,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 07:08:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-27 07:08:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 07:08:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 971 transitions. [2019-12-27 07:08:08,528 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 971 transitions. Word has length 41 [2019-12-27 07:08:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:08,529 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 971 transitions. [2019-12-27 07:08:08,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 971 transitions. [2019-12-27 07:08:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:08,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:08,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:08,535 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash -927493450, now seen corresponding path program 2 times [2019-12-27 07:08:08,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:08,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933740067] [2019-12-27 07:08:08,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:08,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933740067] [2019-12-27 07:08:08,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:08,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:08:08,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509004545] [2019-12-27 07:08:08,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:08:08,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:08:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:08:08,657 INFO L87 Difference]: Start difference. First operand 406 states and 971 transitions. Second operand 6 states. [2019-12-27 07:08:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:08,820 INFO L93 Difference]: Finished difference Result 776 states and 1807 transitions. [2019-12-27 07:08:08,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:08:08,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 07:08:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:08,823 INFO L225 Difference]: With dead ends: 776 [2019-12-27 07:08:08,824 INFO L226 Difference]: Without dead ends: 512 [2019-12-27 07:08:08,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:08:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-27 07:08:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 436. [2019-12-27 07:08:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 07:08:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1021 transitions. [2019-12-27 07:08:08,837 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1021 transitions. Word has length 41 [2019-12-27 07:08:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:08,838 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 1021 transitions. [2019-12-27 07:08:08,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:08:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1021 transitions. [2019-12-27 07:08:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:08,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:08,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:08,842 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1094693734, now seen corresponding path program 3 times [2019-12-27 07:08:08,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:08,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936114886] [2019-12-27 07:08:08,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:09,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936114886] [2019-12-27 07:08:09,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:09,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:08:09,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113734822] [2019-12-27 07:08:09,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:08:09,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:09,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:08:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:08:09,033 INFO L87 Difference]: Start difference. First operand 436 states and 1021 transitions. Second operand 8 states. [2019-12-27 07:08:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:09,619 INFO L93 Difference]: Finished difference Result 747 states and 1593 transitions. [2019-12-27 07:08:09,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:08:09,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 07:08:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:09,625 INFO L225 Difference]: With dead ends: 747 [2019-12-27 07:08:09,625 INFO L226 Difference]: Without dead ends: 747 [2019-12-27 07:08:09,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:08:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-12-27 07:08:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 562. [2019-12-27 07:08:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-27 07:08:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1206 transitions. [2019-12-27 07:08:09,644 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1206 transitions. Word has length 41 [2019-12-27 07:08:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:09,644 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 1206 transitions. [2019-12-27 07:08:09,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:08:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1206 transitions. [2019-12-27 07:08:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:09,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:09,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:09,646 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash -924340920, now seen corresponding path program 4 times [2019-12-27 07:08:09,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:09,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228022135] [2019-12-27 07:08:09,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:09,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228022135] [2019-12-27 07:08:09,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:09,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:09,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450544904] [2019-12-27 07:08:09,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:08:09,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:09,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:08:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:09,727 INFO L87 Difference]: Start difference. First operand 562 states and 1206 transitions. Second operand 7 states. [2019-12-27 07:08:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:09,920 INFO L93 Difference]: Finished difference Result 1366 states and 2865 transitions. [2019-12-27 07:08:09,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:08:09,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 07:08:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:09,931 INFO L225 Difference]: With dead ends: 1366 [2019-12-27 07:08:09,931 INFO L226 Difference]: Without dead ends: 1019 [2019-12-27 07:08:09,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:08:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-27 07:08:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 561. [2019-12-27 07:08:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-12-27 07:08:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1207 transitions. [2019-12-27 07:08:09,951 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1207 transitions. Word has length 41 [2019-12-27 07:08:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:09,953 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 1207 transitions. [2019-12-27 07:08:09,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:08:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1207 transitions. [2019-12-27 07:08:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:09,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:09,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:09,955 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 318757224, now seen corresponding path program 5 times [2019-12-27 07:08:09,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:09,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809533428] [2019-12-27 07:08:09,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:10,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809533428] [2019-12-27 07:08:10,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:10,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:10,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145839503] [2019-12-27 07:08:10,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:08:10,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:08:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:08:10,096 INFO L87 Difference]: Start difference. First operand 561 states and 1207 transitions. Second operand 6 states. [2019-12-27 07:08:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:10,503 INFO L93 Difference]: Finished difference Result 851 states and 1793 transitions. [2019-12-27 07:08:10,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:10,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 07:08:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:10,510 INFO L225 Difference]: With dead ends: 851 [2019-12-27 07:08:10,511 INFO L226 Difference]: Without dead ends: 851 [2019-12-27 07:08:10,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:08:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-27 07:08:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 578. [2019-12-27 07:08:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-27 07:08:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1244 transitions. [2019-12-27 07:08:10,530 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1244 transitions. Word has length 41 [2019-12-27 07:08:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:10,530 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 1244 transitions. [2019-12-27 07:08:10,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:08:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1244 transitions. [2019-12-27 07:08:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:08:10,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:10,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:10,533 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1915123108, now seen corresponding path program 6 times [2019-12-27 07:08:10,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:10,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730790763] [2019-12-27 07:08:10,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:08:10,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730790763] [2019-12-27 07:08:10,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:10,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:10,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557270436] [2019-12-27 07:08:10,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:10,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:10,594 INFO L87 Difference]: Start difference. First operand 578 states and 1244 transitions. Second operand 3 states. [2019-12-27 07:08:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:10,606 INFO L93 Difference]: Finished difference Result 576 states and 1239 transitions. [2019-12-27 07:08:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:10,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 07:08:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:10,616 INFO L225 Difference]: With dead ends: 576 [2019-12-27 07:08:10,616 INFO L226 Difference]: Without dead ends: 576 [2019-12-27 07:08:10,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-27 07:08:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 484. [2019-12-27 07:08:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-27 07:08:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1060 transitions. [2019-12-27 07:08:10,632 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1060 transitions. Word has length 41 [2019-12-27 07:08:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:10,632 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1060 transitions. [2019-12-27 07:08:10,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1060 transitions. [2019-12-27 07:08:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:10,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:10,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:10,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash 563396780, now seen corresponding path program 1 times [2019-12-27 07:08:10,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:10,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922757344] [2019-12-27 07:08:10,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:10,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:08:10,723 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:08:10,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= v_~main$tmp_guard0~0_9 0) (= v_~x$r_buff1_thd1~0_40 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_23|)) (= 0 v_~x$r_buff0_thd2~0_29) (= 0 v_~x$r_buff0_thd1~0_69) (= 0 v_~x$r_buff0_thd0~0_21) (= |v_ULTIMATE.start_main_~#t1635~0.offset_18| 0) (= 0 v_~x$w_buff0~0_24) (= v_~y~0_19 0) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_25 0) (= v_~x$w_buff1_used~0_54 0) (= 0 v_~x$w_buff0_used~0_92) (= v_~x$r_buff1_thd2~0_21 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_23| 4)) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_23|) (= v_~x~0_20 0) (= v_~x$flush_delayed~0_12 0) (= v_~main$tmp_guard1~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_23| 1) |v_#valid_47|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_18 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_23|) |v_ULTIMATE.start_main_~#t1635~0.offset_18| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_69, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_23|, #length=|v_#length_17|, ~y~0=v_~y~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_23|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_54, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_25, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_92, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_23|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1635~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:08:10,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-12-27 07:08:10,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L5-->L777: Formula: (and (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1080390478)) (= ~x$r_buff0_thd2~0_Out1080390478 1) (= ~x$r_buff1_thd0~0_Out1080390478 ~x$r_buff0_thd0~0_In1080390478) (= ~y~0_Out1080390478 ~__unbuffered_p1_EBX~0_Out1080390478) (= ~__unbuffered_p1_EAX~0_Out1080390478 ~y~0_Out1080390478) (= ~x$r_buff1_thd2~0_Out1080390478 ~x$r_buff0_thd2~0_In1080390478) (= ~y~0_Out1080390478 1) (= ~x$r_buff0_thd1~0_In1080390478 ~x$r_buff1_thd1~0_Out1080390478)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1080390478, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1080390478, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1080390478, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1080390478} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1080390478, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1080390478, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1080390478, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1080390478, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1080390478, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1080390478, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1080390478, ~y~0=~y~0_Out1080390478, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1080390478, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1080390478} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:08:10,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_37) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 07:08:10,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2087858898 256) 0))) (or (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In2087858898 256) 0)))) (and (= |P0Thread1of1ForFork1_#t~ite22_Out2087858898| |P0Thread1of1ForFork1_#t~ite23_Out2087858898|) .cse0 (= 0 |P0Thread1of1ForFork1_#t~ite22_Out2087858898|) (or (not (= (mod ~x$w_buff1_used~0_In2087858898 256) 0)) .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out2087858898| |P0Thread1of1ForFork1_#t~ite23_Out2087858898|) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In2087858898 256) 0))) (not (= 0 (mod ~x$w_buff0_used~0_In2087858898 256))))) (and (= |P0Thread1of1ForFork1_#t~ite24_Out2087858898| ~x$r_buff1_thd1~0_In2087858898) (= |P0Thread1of1ForFork1_#t~ite22_In2087858898| |P0Thread1of1ForFork1_#t~ite22_Out2087858898|) (= |P0Thread1of1ForFork1_#t~ite23_In2087858898| |P0Thread1of1ForFork1_#t~ite23_Out2087858898|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2087858898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2087858898, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2087858898, ~weak$$choice2~0=~weak$$choice2~0_In2087858898, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In2087858898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2087858898, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In2087858898|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2087858898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2087858898, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2087858898, ~weak$$choice2~0=~weak$$choice2~0_In2087858898, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out2087858898|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out2087858898|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out2087858898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2087858898} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 07:08:10,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:08:10,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1685668174 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1685668174 256) 0))) (or (and (= ~x$w_buff0_used~0_In1685668174 |P1Thread1of1ForFork0_#t~ite28_Out1685668174|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1685668174|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1685668174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1685668174} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1685668174, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1685668174|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1685668174} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:08:10,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In208837197 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In208837197 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In208837197 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In208837197 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out208837197|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In208837197 |P1Thread1of1ForFork0_#t~ite29_Out208837197|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In208837197, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In208837197, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In208837197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In208837197} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In208837197, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In208837197, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In208837197, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out208837197|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In208837197} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:08:10,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1316378926 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1316378926 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1316378926 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1316378926 ~x$r_buff0_thd2~0_Out1316378926) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1316378926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1316378926} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1316378926|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1316378926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1316378926} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:08:10,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In540491984 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In540491984 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In540491984 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In540491984 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In540491984 |P1Thread1of1ForFork0_#t~ite31_Out540491984|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out540491984|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In540491984, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In540491984, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In540491984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540491984} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out540491984|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In540491984, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In540491984, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In540491984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540491984} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:08:10,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:08:10,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:08:10,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1704828864 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1704828864 256)))) (or (and (= ~x$w_buff1~0_In-1704828864 |ULTIMATE.start_main_#t~ite34_Out-1704828864|) (not .cse0) (not .cse1)) (and (= ~x~0_In-1704828864 |ULTIMATE.start_main_#t~ite34_Out-1704828864|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1704828864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1704828864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1704828864, ~x~0=~x~0_In-1704828864} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1704828864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1704828864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1704828864, ~x~0=~x~0_In-1704828864, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1704828864|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:10,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:10,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1540329756 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1540329756 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out1540329756|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out1540329756| ~x$w_buff0_used~0_In1540329756) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1540329756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540329756} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1540329756, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1540329756|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540329756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 07:08:10,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-640386857 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-640386857 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-640386857 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-640386857 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-640386857|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-640386857 |ULTIMATE.start_main_#t~ite37_Out-640386857|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-640386857, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-640386857, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-640386857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-640386857} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-640386857, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-640386857, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-640386857|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-640386857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-640386857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:08:10,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1182669851 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1182669851 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1182669851| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1182669851 |ULTIMATE.start_main_#t~ite38_Out1182669851|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1182669851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1182669851} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1182669851, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1182669851|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1182669851} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:08:10,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2048613378 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2048613378 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2048613378 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2048613378 256)))) (or (and (= ~x$r_buff1_thd0~0_In2048613378 |ULTIMATE.start_main_#t~ite39_Out2048613378|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out2048613378|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2048613378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048613378, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2048613378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048613378} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2048613378, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2048613378|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048613378, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2048613378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048613378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 07:08:10,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 1 v_~__unbuffered_p1_EAX~0_11) (= v_~__unbuffered_p1_EBX~0_12 1) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite39_14|) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:08:10,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:10 BasicIcfg [2019-12-27 07:08:10,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:08:10,894 INFO L168 Benchmark]: Toolchain (without parser) took 10410.10 ms. Allocated memory was 138.4 MB in the beginning and 380.6 MB in the end (delta: 242.2 MB). Free memory was 101.8 MB in the beginning and 327.8 MB in the end (delta: -226.0 MB). Peak memory consumption was 223.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,894 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.50 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 101.6 MB in the beginning and 154.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 200.3 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,900 INFO L168 Benchmark]: Boogie Preprocessor took 38.60 ms. Allocated memory is still 200.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,900 INFO L168 Benchmark]: RCFGBuilder took 797.14 ms. Allocated memory is still 200.3 MB. Free memory was 150.1 MB in the beginning and 109.0 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,903 INFO L168 Benchmark]: TraceAbstraction took 8787.04 ms. Allocated memory was 200.3 MB in the beginning and 380.6 MB in the end (delta: 180.4 MB). Free memory was 109.0 MB in the beginning and 327.8 MB in the end (delta: -218.7 MB). Peak memory consumption was 168.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:10,907 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 721.50 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 101.6 MB in the beginning and 154.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 200.3 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.60 ms. Allocated memory is still 200.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.14 ms. Allocated memory is still 200.3 MB. Free memory was 150.1 MB in the beginning and 109.0 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8787.04 ms. Allocated memory was 200.3 MB in the beginning and 380.6 MB in the end (delta: 180.4 MB). Free memory was 109.0 MB in the beginning and 327.8 MB in the end (delta: -218.7 MB). Peak memory consumption was 168.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 136 ProgramPointsBefore, 66 ProgramPointsAfterwards, 164 TransitionsBefore, 77 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 123 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 40940 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1284 SDtfs, 1097 SDslu, 2496 SDs, 0 SdLazy, 1393 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 2200 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 35342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...