/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:50:18,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:50:18,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:50:18,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:50:18,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:50:18,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:50:18,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:50:18,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:50:18,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:50:18,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:50:18,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:50:18,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:50:18,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:50:18,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:50:18,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:50:18,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:50:18,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:50:18,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:50:18,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:50:18,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:50:18,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:50:18,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:50:18,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:50:18,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:50:18,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:50:18,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:50:18,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:50:18,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:50:18,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:50:18,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:50:18,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:50:18,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:50:18,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:50:18,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:50:18,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:50:18,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:50:18,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:50:18,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:50:18,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:50:18,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:50:18,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:50:18,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:50:18,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:50:18,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:50:18,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:50:18,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:50:18,339 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:50:18,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:50:18,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:50:18,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:50:18,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:50:18,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:50:18,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:50:18,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:50:18,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:50:18,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:50:18,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:50:18,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:50:18,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:50:18,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:50:18,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:50:18,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:50:18,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:50:18,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:50:18,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:50:18,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:50:18,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:50:18,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:50:18,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:50:18,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:50:18,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:50:18,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:50:18,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:50:18,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:50:18,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:50:18,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:50:18,638 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:50:18,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-18 12:50:18,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d2c9e88/6f65215c05614a3098a6ff7d9b01d480/FLAGc0d7b0f8e [2019-12-18 12:50:19,278 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:50:19,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-18 12:50:19,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d2c9e88/6f65215c05614a3098a6ff7d9b01d480/FLAGc0d7b0f8e [2019-12-18 12:50:19,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d2c9e88/6f65215c05614a3098a6ff7d9b01d480 [2019-12-18 12:50:19,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:50:19,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:50:19,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:50:19,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:50:19,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:50:19,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:50:19" (1/1) ... [2019-12-18 12:50:19,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5323c7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:19, skipping insertion in model container [2019-12-18 12:50:19,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:50:19" (1/1) ... [2019-12-18 12:50:19,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:50:19,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:50:20,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:50:20,180 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:50:20,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:50:20,384 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:50:20,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20 WrapperNode [2019-12-18 12:50:20,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:50:20,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:50:20,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:50:20,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:50:20,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:50:20,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:50:20,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:50:20,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:50:20,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... [2019-12-18 12:50:20,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:50:20,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:50:20,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:50:20,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:50:20,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:50:20,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:50:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:50:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:50:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:50:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:50:20,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:50:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:50:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:50:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:50:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:50:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:50:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:50:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:50:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:50:20,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:50:20,554 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:50:21,344 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:50:21,345 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:50:21,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:50:21 BoogieIcfgContainer [2019-12-18 12:50:21,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:50:21,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:50:21,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:50:21,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:50:21,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:50:19" (1/3) ... [2019-12-18 12:50:21,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4764fed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:50:21, skipping insertion in model container [2019-12-18 12:50:21,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:50:20" (2/3) ... [2019-12-18 12:50:21,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4764fed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:50:21, skipping insertion in model container [2019-12-18 12:50:21,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:50:21" (3/3) ... [2019-12-18 12:50:21,355 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_pso.opt.i [2019-12-18 12:50:21,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:50:21,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:50:21,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:50:21,380 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:50:21,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,432 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,432 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,493 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,494 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,494 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,501 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,501 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,501 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,501 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,503 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,503 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,503 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,503 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,503 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,511 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,512 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:50:21,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:50:21,563 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:50:21,563 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:50:21,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:50:21,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:50:21,564 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:50:21,564 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:50:21,564 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:50:21,564 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:50:21,581 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 12:50:21,583 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 12:50:21,677 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 12:50:21,677 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:50:21,697 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:50:21,725 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 12:50:21,781 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 12:50:21,782 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:50:21,794 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:50:21,819 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 12:50:21,821 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:50:26,646 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-18 12:50:27,447 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:50:27,595 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:50:27,743 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-18 12:50:27,744 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:50:27,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-18 12:50:59,203 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-18 12:50:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-18 12:50:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:50:59,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:59,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:59,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-18 12:50:59,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:59,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995149327] [2019-12-18 12:50:59,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:50:59,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995149327] [2019-12-18 12:50:59,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:59,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:50:59,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580923112] [2019-12-18 12:50:59,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:50:59,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:50:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:50:59,483 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-18 12:51:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:51:06,028 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-18 12:51:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:51:06,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:51:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:51:06,932 INFO L225 Difference]: With dead ends: 158998 [2019-12-18 12:51:06,932 INFO L226 Difference]: Without dead ends: 149254 [2019-12-18 12:51:06,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:51:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-18 12:51:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-18 12:51:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-18 12:51:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-18 12:51:23,622 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-18 12:51:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:51:23,623 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-18 12:51:23,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:51:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-18 12:51:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:51:23,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:51:23,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:51:23,636 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:51:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:51:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-18 12:51:23,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:51:23,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468349258] [2019-12-18 12:51:23,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:51:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:51:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:51:23,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468349258] [2019-12-18 12:51:23,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:51:23,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:51:23,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689996984] [2019-12-18 12:51:23,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:51:23,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:51:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:51:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:51:23,754 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-18 12:51:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:51:24,457 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-18 12:51:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:51:24,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 12:51:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:51:26,261 INFO L225 Difference]: With dead ends: 94546 [2019-12-18 12:51:26,261 INFO L226 Difference]: Without dead ends: 94546 [2019-12-18 12:51:26,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:51:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-18 12:51:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-18 12:51:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-18 12:51:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-18 12:51:35,884 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-18 12:51:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:51:35,884 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-18 12:51:35,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:51:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-18 12:51:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:51:35,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:51:35,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:51:35,888 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:51:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:51:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-18 12:51:35,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:51:35,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281541832] [2019-12-18 12:51:35,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:51:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:51:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:51:35,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281541832] [2019-12-18 12:51:35,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:51:35,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:51:35,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951110699] [2019-12-18 12:51:35,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:51:35,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:51:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:51:35,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:51:35,976 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-18 12:51:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:51:37,804 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-18 12:51:37,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:51:37,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:51:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:51:38,245 INFO L225 Difference]: With dead ends: 144639 [2019-12-18 12:51:38,245 INFO L226 Difference]: Without dead ends: 144527 [2019-12-18 12:51:38,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:51:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-18 12:51:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-18 12:51:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-18 12:51:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-18 12:51:55,778 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-18 12:51:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:51:55,779 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-18 12:51:55,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:51:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-18 12:51:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:51:55,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:51:55,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:51:55,783 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:51:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:51:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-18 12:51:55,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:51:55,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630390361] [2019-12-18 12:51:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:51:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:51:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:51:55,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630390361] [2019-12-18 12:51:55,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:51:55,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:51:55,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254263763] [2019-12-18 12:51:55,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:51:55,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:51:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:51:55,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:51:55,858 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-18 12:51:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:51:56,038 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-18 12:51:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:51:56,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:51:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:51:56,113 INFO L225 Difference]: With dead ends: 37161 [2019-12-18 12:51:56,113 INFO L226 Difference]: Without dead ends: 37161 [2019-12-18 12:51:56,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:51:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-18 12:51:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-18 12:51:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-18 12:51:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-18 12:51:56,834 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-18 12:51:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:51:56,834 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-18 12:51:56,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:51:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-18 12:51:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:51:56,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:51:56,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:51:56,838 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:51:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:51:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-18 12:51:56,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:51:56,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474638594] [2019-12-18 12:51:56,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:51:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:51:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:51:56,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474638594] [2019-12-18 12:51:56,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:51:56,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:51:56,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202120704] [2019-12-18 12:51:56,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:51:56,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:51:56,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:51:56,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:51:56,922 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-18 12:51:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:51:57,444 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-18 12:51:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:51:57,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:51:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:51:57,929 INFO L225 Difference]: With dead ends: 54896 [2019-12-18 12:51:57,929 INFO L226 Difference]: Without dead ends: 54878 [2019-12-18 12:51:57,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:51:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-18 12:51:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-18 12:51:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-18 12:51:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-18 12:51:58,792 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-18 12:51:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:51:58,792 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-18 12:51:58,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:51:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-18 12:51:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:51:58,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:51:58,810 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] [2019-12-18 12:51:58,811 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:51:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:51:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-18 12:51:58,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:51:58,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841874412] [2019-12-18 12:51:58,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:51:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:51:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:51:58,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841874412] [2019-12-18 12:51:58,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:51:58,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:51:58,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429217355] [2019-12-18 12:51:58,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:51:58,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:51:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:51:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:51:58,957 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-18 12:51:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:51:59,989 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-18 12:51:59,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:51:59,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 12:51:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:00,551 INFO L225 Difference]: With dead ends: 65283 [2019-12-18 12:52:00,551 INFO L226 Difference]: Without dead ends: 65253 [2019-12-18 12:52:00,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:52:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-18 12:52:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-18 12:52:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-18 12:52:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-18 12:52:01,506 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-18 12:52:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:01,506 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-18 12:52:01,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:52:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-18 12:52:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:52:01,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:01,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:01,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-18 12:52:01,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:01,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831906645] [2019-12-18 12:52:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:01,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831906645] [2019-12-18 12:52:01,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:01,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:52:01,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092824648] [2019-12-18 12:52:01,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:52:01,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:52:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:52:01,605 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-18 12:52:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:01,741 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-18 12:52:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:52:01,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:52:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:01,784 INFO L225 Difference]: With dead ends: 23301 [2019-12-18 12:52:01,785 INFO L226 Difference]: Without dead ends: 23301 [2019-12-18 12:52:01,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:52:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-18 12:52:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-18 12:52:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-18 12:52:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-18 12:52:02,476 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-18 12:52:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:02,476 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-18 12:52:02,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:52:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-18 12:52:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 12:52:02,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:02,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:02,519 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-18 12:52:02,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:02,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955186492] [2019-12-18 12:52:02,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:02,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955186492] [2019-12-18 12:52:02,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:02,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:52:02,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10838013] [2019-12-18 12:52:02,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:02,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:02,593 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-18 12:52:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:02,796 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-18 12:52:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:02,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 12:52:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:02,866 INFO L225 Difference]: With dead ends: 34696 [2019-12-18 12:52:02,866 INFO L226 Difference]: Without dead ends: 23444 [2019-12-18 12:52:02,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-18 12:52:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-18 12:52:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-18 12:52:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-18 12:52:03,431 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-18 12:52:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:03,431 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-18 12:52:03,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:52:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-18 12:52:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 12:52:03,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:03,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:03,468 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:03,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:03,468 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-18 12:52:03,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:03,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545445047] [2019-12-18 12:52:03,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:03,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545445047] [2019-12-18 12:52:03,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:03,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:52:03,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256689425] [2019-12-18 12:52:03,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:52:03,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:03,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:52:03,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:52:03,546 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-18 12:52:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:03,652 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-18 12:52:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:52:03,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 12:52:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:03,671 INFO L225 Difference]: With dead ends: 21758 [2019-12-18 12:52:03,671 INFO L226 Difference]: Without dead ends: 11194 [2019-12-18 12:52:03,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:52:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-18 12:52:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-18 12:52:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-18 12:52:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-18 12:52:03,851 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-18 12:52:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:03,852 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-18 12:52:03,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:52:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-18 12:52:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:03,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:03,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:03,870 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-18 12:52:03,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:03,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599816632] [2019-12-18 12:52:03,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:03,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599816632] [2019-12-18 12:52:03,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:03,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:52:03,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936827675] [2019-12-18 12:52:03,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:03,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:03,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:03,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:03,931 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-18 12:52:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:04,029 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-18 12:52:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:04,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 12:52:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:04,055 INFO L225 Difference]: With dead ends: 14554 [2019-12-18 12:52:04,055 INFO L226 Difference]: Without dead ends: 14554 [2019-12-18 12:52:04,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-18 12:52:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-18 12:52:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-18 12:52:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-18 12:52:04,444 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-18 12:52:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:04,445 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-18 12:52:04,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:52:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-18 12:52:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:04,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:04,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:04,466 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:04,466 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-18 12:52:04,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:04,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649650203] [2019-12-18 12:52:04,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:04,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649650203] [2019-12-18 12:52:04,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:04,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:52:04,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107147443] [2019-12-18 12:52:04,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:52:04,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:52:04,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:52:04,557 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-18 12:52:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:04,689 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-18 12:52:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:52:04,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 12:52:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:04,713 INFO L225 Difference]: With dead ends: 21477 [2019-12-18 12:52:04,714 INFO L226 Difference]: Without dead ends: 9937 [2019-12-18 12:52:04,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:52:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-18 12:52:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-18 12:52:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-18 12:52:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-18 12:52:05,027 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-18 12:52:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:05,027 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-18 12:52:05,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:52:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-18 12:52:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:05,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:05,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:05,043 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-18 12:52:05,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:05,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567775133] [2019-12-18 12:52:05,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:05,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567775133] [2019-12-18 12:52:05,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:05,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:52:05,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554940599] [2019-12-18 12:52:05,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:52:05,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:52:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:52:05,151 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-18 12:52:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:05,576 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-18 12:52:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:52:05,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 12:52:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:05,612 INFO L225 Difference]: With dead ends: 26843 [2019-12-18 12:52:05,612 INFO L226 Difference]: Without dead ends: 20587 [2019-12-18 12:52:05,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:52:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-18 12:52:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-18 12:52:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-18 12:52:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-18 12:52:05,878 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-18 12:52:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:05,878 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-18 12:52:05,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:52:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-18 12:52:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:05,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:05,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:05,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-18 12:52:05,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:05,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780801366] [2019-12-18 12:52:05,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:05,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780801366] [2019-12-18 12:52:06,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:06,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:52:06,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478334073] [2019-12-18 12:52:06,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:52:06,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:06,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:52:06,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:52:06,001 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-18 12:52:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:06,459 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-18 12:52:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:52:06,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 12:52:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:06,505 INFO L225 Difference]: With dead ends: 33666 [2019-12-18 12:52:06,505 INFO L226 Difference]: Without dead ends: 24086 [2019-12-18 12:52:06,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:52:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-18 12:52:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-18 12:52:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-18 12:52:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-18 12:52:06,946 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-18 12:52:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:06,946 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-18 12:52:06,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:52:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-18 12:52:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:06,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:06,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:06,969 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:06,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-18 12:52:06,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:06,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690746686] [2019-12-18 12:52:06,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:07,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690746686] [2019-12-18 12:52:07,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:07,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:52:07,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514643504] [2019-12-18 12:52:07,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:52:07,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:52:07,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:52:07,075 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-18 12:52:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:08,049 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-18 12:52:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:52:08,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 12:52:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:08,097 INFO L225 Difference]: With dead ends: 34932 [2019-12-18 12:52:08,097 INFO L226 Difference]: Without dead ends: 32668 [2019-12-18 12:52:08,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:52:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-18 12:52:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-18 12:52:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-18 12:52:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-18 12:52:08,488 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-18 12:52:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:08,489 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-18 12:52:08,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:52:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-18 12:52:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:08,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:08,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:08,506 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-18 12:52:08,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:08,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466430135] [2019-12-18 12:52:08,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:08,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466430135] [2019-12-18 12:52:08,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:08,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:52:08,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869419027] [2019-12-18 12:52:08,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:52:08,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:52:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:52:08,622 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-18 12:52:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:10,043 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-18 12:52:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:52:10,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 12:52:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:10,143 INFO L225 Difference]: With dead ends: 48430 [2019-12-18 12:52:10,143 INFO L226 Difference]: Without dead ends: 46166 [2019-12-18 12:52:10,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:52:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-18 12:52:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-18 12:52:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-18 12:52:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-18 12:52:10,793 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-18 12:52:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:10,794 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-18 12:52:10,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:52:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-18 12:52:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:10,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:10,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:10,812 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-18 12:52:10,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:10,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926616129] [2019-12-18 12:52:10,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:10,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926616129] [2019-12-18 12:52:10,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:10,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:52:10,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556779987] [2019-12-18 12:52:10,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:52:10,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:52:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:52:10,920 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-18 12:52:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:12,387 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-18 12:52:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:52:12,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 12:52:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:12,473 INFO L225 Difference]: With dead ends: 62597 [2019-12-18 12:52:12,473 INFO L226 Difference]: Without dead ends: 54167 [2019-12-18 12:52:12,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:52:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-18 12:52:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-18 12:52:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-18 12:52:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-18 12:52:13,297 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-18 12:52:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:13,297 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-18 12:52:13,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:52:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-18 12:52:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:52:13,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:13,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:13,322 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-18 12:52:13,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:13,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964435635] [2019-12-18 12:52:13,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:13,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964435635] [2019-12-18 12:52:13,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:13,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:52:13,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054998536] [2019-12-18 12:52:13,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:13,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:13,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:13,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:13,405 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-18 12:52:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:13,483 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-18 12:52:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:13,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 12:52:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:13,513 INFO L225 Difference]: With dead ends: 16496 [2019-12-18 12:52:13,514 INFO L226 Difference]: Without dead ends: 16496 [2019-12-18 12:52:13,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-18 12:52:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-18 12:52:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-18 12:52:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-18 12:52:13,779 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-18 12:52:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:13,779 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-18 12:52:13,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:52:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-18 12:52:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:13,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:13,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:13,796 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-18 12:52:13,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:13,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324162329] [2019-12-18 12:52:13,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:14,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324162329] [2019-12-18 12:52:14,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:14,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:52:14,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195226858] [2019-12-18 12:52:14,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:52:14,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:52:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:52:14,401 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 16 states. [2019-12-18 12:52:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:20,236 INFO L93 Difference]: Finished difference Result 33798 states and 102333 transitions. [2019-12-18 12:52:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 12:52:20,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-12-18 12:52:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:20,276 INFO L225 Difference]: With dead ends: 33798 [2019-12-18 12:52:20,277 INFO L226 Difference]: Without dead ends: 27381 [2019-12-18 12:52:20,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=472, Invalid=2180, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 12:52:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27381 states. [2019-12-18 12:52:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27381 to 18017. [2019-12-18 12:52:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18017 states. [2019-12-18 12:52:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18017 states to 18017 states and 55469 transitions. [2019-12-18 12:52:20,627 INFO L78 Accepts]: Start accepts. Automaton has 18017 states and 55469 transitions. Word has length 58 [2019-12-18 12:52:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:20,628 INFO L462 AbstractCegarLoop]: Abstraction has 18017 states and 55469 transitions. [2019-12-18 12:52:20,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:52:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 18017 states and 55469 transitions. [2019-12-18 12:52:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:20,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:20,647 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 856782122, now seen corresponding path program 2 times [2019-12-18 12:52:20,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:20,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106975001] [2019-12-18 12:52:20,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:21,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106975001] [2019-12-18 12:52:21,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:21,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:52:21,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218874725] [2019-12-18 12:52:21,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:52:21,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:52:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:52:21,367 INFO L87 Difference]: Start difference. First operand 18017 states and 55469 transitions. Second operand 17 states. [2019-12-18 12:52:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:27,670 INFO L93 Difference]: Finished difference Result 37453 states and 113542 transitions. [2019-12-18 12:52:27,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-18 12:52:27,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2019-12-18 12:52:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:27,713 INFO L225 Difference]: With dead ends: 37453 [2019-12-18 12:52:27,713 INFO L226 Difference]: Without dead ends: 28499 [2019-12-18 12:52:27,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=619, Invalid=3287, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 12:52:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28499 states. [2019-12-18 12:52:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28499 to 18535. [2019-12-18 12:52:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18535 states. [2019-12-18 12:52:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18535 states to 18535 states and 56825 transitions. [2019-12-18 12:52:28,086 INFO L78 Accepts]: Start accepts. Automaton has 18535 states and 56825 transitions. Word has length 58 [2019-12-18 12:52:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:28,086 INFO L462 AbstractCegarLoop]: Abstraction has 18535 states and 56825 transitions. [2019-12-18 12:52:28,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:52:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 18535 states and 56825 transitions. [2019-12-18 12:52:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:28,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:28,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:28,113 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:28,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:28,113 INFO L82 PathProgramCache]: Analyzing trace with hash 540759914, now seen corresponding path program 3 times [2019-12-18 12:52:28,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:28,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546484965] [2019-12-18 12:52:28,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:28,511 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 12 [2019-12-18 12:52:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:28,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546484965] [2019-12-18 12:52:28,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:28,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:52:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215127000] [2019-12-18 12:52:28,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:52:28,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:52:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:52:28,773 INFO L87 Difference]: Start difference. First operand 18535 states and 56825 transitions. Second operand 17 states. [2019-12-18 12:52:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:36,083 INFO L93 Difference]: Finished difference Result 31871 states and 95779 transitions. [2019-12-18 12:52:36,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 12:52:36,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2019-12-18 12:52:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:36,124 INFO L225 Difference]: With dead ends: 31871 [2019-12-18 12:52:36,124 INFO L226 Difference]: Without dead ends: 27527 [2019-12-18 12:52:36,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=593, Invalid=2947, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 12:52:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27527 states. [2019-12-18 12:52:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27527 to 18653. [2019-12-18 12:52:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18653 states. [2019-12-18 12:52:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18653 states to 18653 states and 57003 transitions. [2019-12-18 12:52:36,465 INFO L78 Accepts]: Start accepts. Automaton has 18653 states and 57003 transitions. Word has length 58 [2019-12-18 12:52:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:36,466 INFO L462 AbstractCegarLoop]: Abstraction has 18653 states and 57003 transitions. [2019-12-18 12:52:36,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:52:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 18653 states and 57003 transitions. [2019-12-18 12:52:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:36,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:36,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:36,485 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 532534436, now seen corresponding path program 4 times [2019-12-18 12:52:36,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:36,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996175069] [2019-12-18 12:52:36,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:36,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996175069] [2019-12-18 12:52:36,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:36,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:52:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515433336] [2019-12-18 12:52:36,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:52:36,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:52:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:52:36,601 INFO L87 Difference]: Start difference. First operand 18653 states and 57003 transitions. Second operand 8 states. [2019-12-18 12:52:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:38,473 INFO L93 Difference]: Finished difference Result 31337 states and 92921 transitions. [2019-12-18 12:52:38,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:52:38,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-18 12:52:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:38,519 INFO L225 Difference]: With dead ends: 31337 [2019-12-18 12:52:38,519 INFO L226 Difference]: Without dead ends: 31127 [2019-12-18 12:52:38,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:52:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31127 states. [2019-12-18 12:52:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31127 to 21255. [2019-12-18 12:52:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21255 states. [2019-12-18 12:52:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21255 states to 21255 states and 64498 transitions. [2019-12-18 12:52:38,922 INFO L78 Accepts]: Start accepts. Automaton has 21255 states and 64498 transitions. Word has length 58 [2019-12-18 12:52:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:38,923 INFO L462 AbstractCegarLoop]: Abstraction has 21255 states and 64498 transitions. [2019-12-18 12:52:38,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:52:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 21255 states and 64498 transitions. [2019-12-18 12:52:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:38,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:38,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:38,945 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1124271006, now seen corresponding path program 5 times [2019-12-18 12:52:38,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:38,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394962184] [2019-12-18 12:52:38,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:39,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394962184] [2019-12-18 12:52:39,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:39,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:52:39,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984211281] [2019-12-18 12:52:39,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:52:39,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:52:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:52:39,111 INFO L87 Difference]: Start difference. First operand 21255 states and 64498 transitions. Second operand 10 states. [2019-12-18 12:52:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:40,754 INFO L93 Difference]: Finished difference Result 36127 states and 109571 transitions. [2019-12-18 12:52:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:52:40,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 12:52:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:40,798 INFO L225 Difference]: With dead ends: 36127 [2019-12-18 12:52:40,798 INFO L226 Difference]: Without dead ends: 28547 [2019-12-18 12:52:40,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:52:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28547 states. [2019-12-18 12:52:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28547 to 21489. [2019-12-18 12:52:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21489 states. [2019-12-18 12:52:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21489 states to 21489 states and 65085 transitions. [2019-12-18 12:52:41,199 INFO L78 Accepts]: Start accepts. Automaton has 21489 states and 65085 transitions. Word has length 58 [2019-12-18 12:52:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:41,200 INFO L462 AbstractCegarLoop]: Abstraction has 21489 states and 65085 transitions. [2019-12-18 12:52:41,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:52:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21489 states and 65085 transitions. [2019-12-18 12:52:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:41,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:41,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:41,226 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash 755166698, now seen corresponding path program 6 times [2019-12-18 12:52:41,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:41,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191353671] [2019-12-18 12:52:41,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:41,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191353671] [2019-12-18 12:52:41,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:41,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:52:41,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436318643] [2019-12-18 12:52:41,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:52:41,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:41,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:52:41,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:52:41,436 INFO L87 Difference]: Start difference. First operand 21489 states and 65085 transitions. Second operand 11 states. [2019-12-18 12:52:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:42,959 INFO L93 Difference]: Finished difference Result 32790 states and 98640 transitions. [2019-12-18 12:52:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:52:42,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 12:52:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:43,003 INFO L225 Difference]: With dead ends: 32790 [2019-12-18 12:52:43,004 INFO L226 Difference]: Without dead ends: 28673 [2019-12-18 12:52:43,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:52:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2019-12-18 12:52:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 21179. [2019-12-18 12:52:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21179 states. [2019-12-18 12:52:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21179 states to 21179 states and 64174 transitions. [2019-12-18 12:52:43,558 INFO L78 Accepts]: Start accepts. Automaton has 21179 states and 64174 transitions. Word has length 58 [2019-12-18 12:52:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:43,558 INFO L462 AbstractCegarLoop]: Abstraction has 21179 states and 64174 transitions. [2019-12-18 12:52:43,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:52:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21179 states and 64174 transitions. [2019-12-18 12:52:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:52:43,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:43,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:43,584 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 7 times [2019-12-18 12:52:43,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:43,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355450937] [2019-12-18 12:52:43,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:43,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355450937] [2019-12-18 12:52:43,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:43,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:52:43,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712557801] [2019-12-18 12:52:43,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:43,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:43,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:43,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:43,645 INFO L87 Difference]: Start difference. First operand 21179 states and 64174 transitions. Second operand 3 states. [2019-12-18 12:52:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:43,743 INFO L93 Difference]: Finished difference Result 21179 states and 64172 transitions. [2019-12-18 12:52:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:43,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 12:52:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:43,782 INFO L225 Difference]: With dead ends: 21179 [2019-12-18 12:52:43,782 INFO L226 Difference]: Without dead ends: 21179 [2019-12-18 12:52:43,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21179 states. [2019-12-18 12:52:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21179 to 18152. [2019-12-18 12:52:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18152 states. [2019-12-18 12:52:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18152 states to 18152 states and 55874 transitions. [2019-12-18 12:52:44,109 INFO L78 Accepts]: Start accepts. Automaton has 18152 states and 55874 transitions. Word has length 58 [2019-12-18 12:52:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:44,110 INFO L462 AbstractCegarLoop]: Abstraction has 18152 states and 55874 transitions. [2019-12-18 12:52:44,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:52:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 18152 states and 55874 transitions. [2019-12-18 12:52:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:52:44,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:44,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:44,131 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 1 times [2019-12-18 12:52:44,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:44,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406828263] [2019-12-18 12:52:44,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:44,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406828263] [2019-12-18 12:52:44,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:44,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:52:44,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831169721] [2019-12-18 12:52:44,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:52:44,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:44,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:52:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:52:44,637 INFO L87 Difference]: Start difference. First operand 18152 states and 55874 transitions. Second operand 15 states. [2019-12-18 12:52:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:49,835 INFO L93 Difference]: Finished difference Result 36651 states and 111838 transitions. [2019-12-18 12:52:49,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 12:52:49,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 12:52:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:49,889 INFO L225 Difference]: With dead ends: 36651 [2019-12-18 12:52:49,889 INFO L226 Difference]: Without dead ends: 35965 [2019-12-18 12:52:49,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=609, Invalid=3551, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 12:52:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35965 states. [2019-12-18 12:52:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35965 to 20884. [2019-12-18 12:52:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20884 states. [2019-12-18 12:52:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20884 states to 20884 states and 64176 transitions. [2019-12-18 12:52:50,336 INFO L78 Accepts]: Start accepts. Automaton has 20884 states and 64176 transitions. Word has length 59 [2019-12-18 12:52:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:50,337 INFO L462 AbstractCegarLoop]: Abstraction has 20884 states and 64176 transitions. [2019-12-18 12:52:50,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:52:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20884 states and 64176 transitions. [2019-12-18 12:52:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:52:50,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:50,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:50,362 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 2 times [2019-12-18 12:52:50,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:50,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617804447] [2019-12-18 12:52:50,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:50,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617804447] [2019-12-18 12:52:50,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:50,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:52:50,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801035237] [2019-12-18 12:52:50,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:52:50,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:50,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:52:50,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:52:50,855 INFO L87 Difference]: Start difference. First operand 20884 states and 64176 transitions. Second operand 15 states. [2019-12-18 12:52:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:54,582 INFO L93 Difference]: Finished difference Result 36416 states and 110490 transitions. [2019-12-18 12:52:54,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 12:52:54,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 12:52:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:54,636 INFO L225 Difference]: With dead ends: 36416 [2019-12-18 12:52:54,637 INFO L226 Difference]: Without dead ends: 30117 [2019-12-18 12:52:54,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=526, Invalid=2444, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 12:52:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30117 states. [2019-12-18 12:52:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30117 to 17464. [2019-12-18 12:52:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17464 states. [2019-12-18 12:52:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17464 states to 17464 states and 53924 transitions. [2019-12-18 12:52:55,026 INFO L78 Accepts]: Start accepts. Automaton has 17464 states and 53924 transitions. Word has length 59 [2019-12-18 12:52:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:55,027 INFO L462 AbstractCegarLoop]: Abstraction has 17464 states and 53924 transitions. [2019-12-18 12:52:55,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:52:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17464 states and 53924 transitions. [2019-12-18 12:52:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:52:55,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:55,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:55,050 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1489995567, now seen corresponding path program 3 times [2019-12-18 12:52:55,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:55,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045172931] [2019-12-18 12:52:55,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:55,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045172931] [2019-12-18 12:52:55,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:55,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:52:55,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74341954] [2019-12-18 12:52:55,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:52:55,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:55,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:52:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:52:55,520 INFO L87 Difference]: Start difference. First operand 17464 states and 53924 transitions. Second operand 16 states. [2019-12-18 12:52:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:59,234 INFO L93 Difference]: Finished difference Result 28542 states and 86471 transitions. [2019-12-18 12:52:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 12:52:59,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 12:52:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:59,274 INFO L225 Difference]: With dead ends: 28542 [2019-12-18 12:52:59,274 INFO L226 Difference]: Without dead ends: 26960 [2019-12-18 12:52:59,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 12:52:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26960 states. [2019-12-18 12:52:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26960 to 17518. [2019-12-18 12:52:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17518 states. [2019-12-18 12:52:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17518 states to 17518 states and 54065 transitions. [2019-12-18 12:52:59,598 INFO L78 Accepts]: Start accepts. Automaton has 17518 states and 54065 transitions. Word has length 59 [2019-12-18 12:52:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:59,598 INFO L462 AbstractCegarLoop]: Abstraction has 17518 states and 54065 transitions. [2019-12-18 12:52:59,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:52:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17518 states and 54065 transitions. [2019-12-18 12:52:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:52:59,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:59,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:59,618 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:52:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1160825327, now seen corresponding path program 4 times [2019-12-18 12:52:59,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:59,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108645328] [2019-12-18 12:52:59,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:00,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108645328] [2019-12-18 12:53:00,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 12:53:00,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189154493] [2019-12-18 12:53:00,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 12:53:00,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 12:53:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:53:00,169 INFO L87 Difference]: Start difference. First operand 17518 states and 54065 transitions. Second operand 18 states. [2019-12-18 12:53:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:04,199 INFO L93 Difference]: Finished difference Result 29876 states and 90365 transitions. [2019-12-18 12:53:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 12:53:04,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-18 12:53:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:04,241 INFO L225 Difference]: With dead ends: 29876 [2019-12-18 12:53:04,241 INFO L226 Difference]: Without dead ends: 27492 [2019-12-18 12:53:04,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1495, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 12:53:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27492 states. [2019-12-18 12:53:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27492 to 17748. [2019-12-18 12:53:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17748 states. [2019-12-18 12:53:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17748 states to 17748 states and 54656 transitions. [2019-12-18 12:53:04,721 INFO L78 Accepts]: Start accepts. Automaton has 17748 states and 54656 transitions. Word has length 59 [2019-12-18 12:53:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:04,721 INFO L462 AbstractCegarLoop]: Abstraction has 17748 states and 54656 transitions. [2019-12-18 12:53:04,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 12:53:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17748 states and 54656 transitions. [2019-12-18 12:53:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:04,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:04,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:04,743 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash -718544815, now seen corresponding path program 5 times [2019-12-18 12:53:04,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:04,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862114235] [2019-12-18 12:53:04,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862114235] [2019-12-18 12:53:04,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:04,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:53:04,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717632312] [2019-12-18 12:53:04,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:53:04,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:53:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:53:04,951 INFO L87 Difference]: Start difference. First operand 17748 states and 54656 transitions. Second operand 12 states. [2019-12-18 12:53:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:07,545 INFO L93 Difference]: Finished difference Result 29227 states and 88921 transitions. [2019-12-18 12:53:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:53:07,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 12:53:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:07,584 INFO L225 Difference]: With dead ends: 29227 [2019-12-18 12:53:07,584 INFO L226 Difference]: Without dead ends: 24872 [2019-12-18 12:53:07,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:53:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24872 states. [2019-12-18 12:53:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24872 to 17500. [2019-12-18 12:53:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17500 states. [2019-12-18 12:53:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17500 states to 17500 states and 53936 transitions. [2019-12-18 12:53:07,907 INFO L78 Accepts]: Start accepts. Automaton has 17500 states and 53936 transitions. Word has length 59 [2019-12-18 12:53:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:07,907 INFO L462 AbstractCegarLoop]: Abstraction has 17500 states and 53936 transitions. [2019-12-18 12:53:07,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:53:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17500 states and 53936 transitions. [2019-12-18 12:53:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:07,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:07,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:07,928 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:07,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:07,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1925298671, now seen corresponding path program 6 times [2019-12-18 12:53:07,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:07,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559919554] [2019-12-18 12:53:07,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:08,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559919554] [2019-12-18 12:53:08,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:08,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:53:08,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208056197] [2019-12-18 12:53:08,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 12:53:08,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 12:53:08,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:53:08,126 INFO L87 Difference]: Start difference. First operand 17500 states and 53936 transitions. Second operand 13 states. [2019-12-18 12:53:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:10,430 INFO L93 Difference]: Finished difference Result 25109 states and 76888 transitions. [2019-12-18 12:53:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:53:10,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-18 12:53:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:10,467 INFO L225 Difference]: With dead ends: 25109 [2019-12-18 12:53:10,467 INFO L226 Difference]: Without dead ends: 24439 [2019-12-18 12:53:10,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:53:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24439 states. [2019-12-18 12:53:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24439 to 17420. [2019-12-18 12:53:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17420 states. [2019-12-18 12:53:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17420 states to 17420 states and 53704 transitions. [2019-12-18 12:53:10,781 INFO L78 Accepts]: Start accepts. Automaton has 17420 states and 53704 transitions. Word has length 59 [2019-12-18 12:53:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:10,781 INFO L462 AbstractCegarLoop]: Abstraction has 17420 states and 53704 transitions. [2019-12-18 12:53:10,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 12:53:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 17420 states and 53704 transitions. [2019-12-18 12:53:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:10,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:10,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:10,801 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1255480233, now seen corresponding path program 7 times [2019-12-18 12:53:10,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:10,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895782978] [2019-12-18 12:53:10,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:11,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895782978] [2019-12-18 12:53:11,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:11,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:53:11,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143093919] [2019-12-18 12:53:11,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:53:11,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:53:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:53:11,338 INFO L87 Difference]: Start difference. First operand 17420 states and 53704 transitions. Second operand 16 states. [2019-12-18 12:53:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:15,619 INFO L93 Difference]: Finished difference Result 31392 states and 95762 transitions. [2019-12-18 12:53:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 12:53:15,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 12:53:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:15,664 INFO L225 Difference]: With dead ends: 31392 [2019-12-18 12:53:15,664 INFO L226 Difference]: Without dead ends: 31094 [2019-12-18 12:53:15,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=433, Invalid=2429, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 12:53:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31094 states. [2019-12-18 12:53:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31094 to 18566. [2019-12-18 12:53:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18566 states. [2019-12-18 12:53:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 57010 transitions. [2019-12-18 12:53:16,046 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 57010 transitions. Word has length 59 [2019-12-18 12:53:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:16,046 INFO L462 AbstractCegarLoop]: Abstraction has 18566 states and 57010 transitions. [2019-12-18 12:53:16,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:53:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 57010 transitions. [2019-12-18 12:53:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:16,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:16,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:16,068 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1129996185, now seen corresponding path program 8 times [2019-12-18 12:53:16,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:16,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816614559] [2019-12-18 12:53:16,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:16,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816614559] [2019-12-18 12:53:16,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:16,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:16,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591405622] [2019-12-18 12:53:16,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:16,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:16,303 INFO L87 Difference]: Start difference. First operand 18566 states and 57010 transitions. Second operand 11 states. [2019-12-18 12:53:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:17,386 INFO L93 Difference]: Finished difference Result 32115 states and 98364 transitions. [2019-12-18 12:53:17,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:53:17,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 12:53:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:17,425 INFO L225 Difference]: With dead ends: 32115 [2019-12-18 12:53:17,425 INFO L226 Difference]: Without dead ends: 26659 [2019-12-18 12:53:17,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:53:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26659 states. [2019-12-18 12:53:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26659 to 17144. [2019-12-18 12:53:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17144 states. [2019-12-18 12:53:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17144 states to 17144 states and 52924 transitions. [2019-12-18 12:53:17,763 INFO L78 Accepts]: Start accepts. Automaton has 17144 states and 52924 transitions. Word has length 59 [2019-12-18 12:53:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:17,764 INFO L462 AbstractCegarLoop]: Abstraction has 17144 states and 52924 transitions. [2019-12-18 12:53:17,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17144 states and 52924 transitions. [2019-12-18 12:53:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:17,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:17,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:17,783 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2050883077, now seen corresponding path program 9 times [2019-12-18 12:53:17,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:17,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400408448] [2019-12-18 12:53:17,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:17,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400408448] [2019-12-18 12:53:17,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:17,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:17,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909077260] [2019-12-18 12:53:17,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:53:17,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:17,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:53:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:53:17,959 INFO L87 Difference]: Start difference. First operand 17144 states and 52924 transitions. Second operand 10 states. [2019-12-18 12:53:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:19,522 INFO L93 Difference]: Finished difference Result 22596 states and 69303 transitions. [2019-12-18 12:53:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:53:19,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 12:53:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:19,555 INFO L225 Difference]: With dead ends: 22596 [2019-12-18 12:53:19,555 INFO L226 Difference]: Without dead ends: 21826 [2019-12-18 12:53:19,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:53:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21826 states. [2019-12-18 12:53:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21826 to 16824. [2019-12-18 12:53:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16824 states. [2019-12-18 12:53:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16824 states to 16824 states and 52013 transitions. [2019-12-18 12:53:19,843 INFO L78 Accepts]: Start accepts. Automaton has 16824 states and 52013 transitions. Word has length 59 [2019-12-18 12:53:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:19,844 INFO L462 AbstractCegarLoop]: Abstraction has 16824 states and 52013 transitions. [2019-12-18 12:53:19,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:53:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 16824 states and 52013 transitions. [2019-12-18 12:53:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:19,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:19,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:19,864 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1795765639, now seen corresponding path program 10 times [2019-12-18 12:53:19,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:19,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106074024] [2019-12-18 12:53:19,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:20,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106074024] [2019-12-18 12:53:20,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:20,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:20,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937229310] [2019-12-18 12:53:20,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:20,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:20,005 INFO L87 Difference]: Start difference. First operand 16824 states and 52013 transitions. Second operand 11 states. [2019-12-18 12:53:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:21,278 INFO L93 Difference]: Finished difference Result 22041 states and 67945 transitions. [2019-12-18 12:53:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:53:21,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 12:53:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:21,314 INFO L225 Difference]: With dead ends: 22041 [2019-12-18 12:53:21,314 INFO L226 Difference]: Without dead ends: 21769 [2019-12-18 12:53:21,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:53:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21769 states. [2019-12-18 12:53:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21769 to 16678. [2019-12-18 12:53:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16678 states. [2019-12-18 12:53:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51651 transitions. [2019-12-18 12:53:21,649 INFO L78 Accepts]: Start accepts. Automaton has 16678 states and 51651 transitions. Word has length 59 [2019-12-18 12:53:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:21,649 INFO L462 AbstractCegarLoop]: Abstraction has 16678 states and 51651 transitions. [2019-12-18 12:53:21,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 16678 states and 51651 transitions. [2019-12-18 12:53:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:21,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:21,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:21,671 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 11 times [2019-12-18 12:53:21,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:21,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959956749] [2019-12-18 12:53:21,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:53:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:53:21,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:53:21,831 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:53:21,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= v_~__unbuffered_cnt~0_187 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t613~0.base_29| 4) |v_#length_31|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t613~0.base_29|)) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t613~0.offset_21|) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t613~0.base_29| 1)) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_29|) |v_ULTIMATE.start_main_~#t613~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~weak$$choice0~0_22) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t613~0.base_29|) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_21|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t613~0.base=|v_ULTIMATE.start_main_~#t613~0.base_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_29|, ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_~#t613~0.offset=|v_ULTIMATE.start_main_~#t613~0.offset_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_21|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_163, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_29|, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.offset, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t616~0.base, #NULL.offset, ULTIMATE.start_main_~#t613~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t616~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t613~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t614~0.offset, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t614~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:53:21,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t614~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12|) |v_ULTIMATE.start_main_~#t614~0.offset_10| 1)) |v_#memory_int_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t614~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t614~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t614~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t614~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t614~0.base] because there is no mapped edge [2019-12-18 12:53:21,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t615~0.base_13|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13|) 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t615~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t615~0.base_13|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13|) |v_ULTIMATE.start_main_~#t615~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t615~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t615~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 12:53:21,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 12:53:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10|) |v_ULTIMATE.start_main_~#t616~0.offset_10| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t616~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t616~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t616~0.offset_10| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t616~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t616~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, ULTIMATE.start_main_~#t616~0.base, #length] because there is no mapped edge [2019-12-18 12:53:21,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:53:21,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1606993367 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1606993367 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1606993367| ~y~0_In-1606993367) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-1606993367 |P3Thread1of1ForFork0_#t~ite32_Out-1606993367|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1606993367, ~y$w_buff1~0=~y$w_buff1~0_In-1606993367, ~y~0=~y~0_In-1606993367, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1606993367} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1606993367, ~y$w_buff1~0=~y$w_buff1~0_In-1606993367, ~y~0=~y~0_In-1606993367, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1606993367|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1606993367} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 12:53:21,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 12:53:21,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In407913715 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In407913715 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out407913715|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In407913715 |P3Thread1of1ForFork0_#t~ite34_Out407913715|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In407913715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In407913715} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In407913715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In407913715, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out407913715|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 12:53:21,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In282178431 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In282178431 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite28_Out282178431| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In282178431 |P2Thread1of1ForFork3_#t~ite28_Out282178431|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In282178431, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282178431} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In282178431, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282178431, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out282178431|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 12:53:21,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1029898344 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1029898344 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1029898344 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1029898344 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out1029898344| ~y$w_buff1_used~0_In1029898344) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out1029898344| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1029898344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1029898344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1029898344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1029898344} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1029898344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1029898344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1029898344, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1029898344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1029898344} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 12:53:21,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1690239668 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1690239668 256)))) (or (and (= ~y$r_buff0_thd3~0_In-1690239668 ~y$r_buff0_thd3~0_Out-1690239668) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-1690239668 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690239668, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1690239668} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1690239668|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690239668, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1690239668} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 12:53:21,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In11845788 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In11845788 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In11845788 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In11845788 256)))) (or (and (= ~y$r_buff1_thd3~0_In11845788 |P2Thread1of1ForFork3_#t~ite31_Out11845788|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out11845788|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In11845788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In11845788, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In11845788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11845788} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In11845788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In11845788, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In11845788, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out11845788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11845788} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 12:53:21,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 12:53:21,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-2023474519 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2023474519 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2023474519 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-2023474519 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-2023474519| ~y$w_buff1_used~0_In-2023474519) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-2023474519|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2023474519, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2023474519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2023474519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2023474519} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2023474519, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2023474519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2023474519, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-2023474519|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2023474519} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 12:53:21,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1490858797 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1490858797 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out-1490858797| ~y$r_buff0_thd4~0_In-1490858797) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1490858797| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1490858797, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1490858797} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1490858797, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1490858797, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1490858797|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 12:53:21,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1196767240 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1196767240 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1196767240 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1196767240 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out1196767240| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork0_#t~ite37_Out1196767240| ~y$r_buff1_thd4~0_In1196767240) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1196767240, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1196767240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196767240, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196767240} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1196767240, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1196767240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196767240, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1196767240|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196767240} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 12:53:21,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:53:21,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1885989219 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_In-1885989219| |P1Thread1of1ForFork2_#t~ite8_Out-1885989219|) (not .cse0) (= ~y$w_buff0~0_In-1885989219 |P1Thread1of1ForFork2_#t~ite9_Out-1885989219|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1885989219 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1885989219 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1885989219 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In-1885989219 256)) .cse1))) (= ~y$w_buff0~0_In-1885989219 |P1Thread1of1ForFork2_#t~ite8_Out-1885989219|) .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1885989219| |P1Thread1of1ForFork2_#t~ite8_Out-1885989219|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1885989219, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885989219, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1885989219|, ~y$w_buff0~0=~y$w_buff0~0_In-1885989219, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1885989219, ~weak$$choice2~0=~weak$$choice2~0_In-1885989219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1885989219} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1885989219, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1885989219|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885989219, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1885989219|, ~y$w_buff0~0=~y$w_buff0~0_In-1885989219, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1885989219, ~weak$$choice2~0=~weak$$choice2~0_In-1885989219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1885989219} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:53:21,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2105985554 256) 0))) (or (and (= ~y$w_buff0_used~0_In2105985554 |P1Thread1of1ForFork2_#t~ite15_Out2105985554|) (= |P1Thread1of1ForFork2_#t~ite14_In2105985554| |P1Thread1of1ForFork2_#t~ite14_Out2105985554|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2105985554 256)))) (or (= (mod ~y$w_buff0_used~0_In2105985554 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In2105985554 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In2105985554 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out2105985554| |P1Thread1of1ForFork2_#t~ite15_Out2105985554|) (= ~y$w_buff0_used~0_In2105985554 |P1Thread1of1ForFork2_#t~ite14_Out2105985554|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2105985554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2105985554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2105985554, ~weak$$choice2~0=~weak$$choice2~0_In2105985554, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In2105985554|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2105985554} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2105985554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2105985554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2105985554, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2105985554|, ~weak$$choice2~0=~weak$$choice2~0_In2105985554, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out2105985554|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2105985554} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 12:53:21,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 12:53:21,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1207146117 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_Out-1207146117| |P1Thread1of1ForFork2_#t~ite24_Out-1207146117|) (= ~y$r_buff1_thd2~0_In-1207146117 |P1Thread1of1ForFork2_#t~ite23_Out-1207146117|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1207146117 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1207146117 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1207146117 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1207146117 256) 0)))) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-1207146117| |P1Thread1of1ForFork2_#t~ite23_Out-1207146117|) (= ~y$r_buff1_thd2~0_In-1207146117 |P1Thread1of1ForFork2_#t~ite24_Out-1207146117|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1207146117, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1207146117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1207146117, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1207146117|, ~weak$$choice2~0=~weak$$choice2~0_In-1207146117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1207146117} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1207146117, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1207146117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1207146117, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1207146117|, ~weak$$choice2~0=~weak$$choice2~0_In-1207146117, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1207146117|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1207146117} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 12:53:21,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:53:21,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:53:21,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite43_Out-1346778406| |ULTIMATE.start_main_#t~ite42_Out-1346778406|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1346778406 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1346778406 256) 0))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-1346778406 |ULTIMATE.start_main_#t~ite42_Out-1346778406|) (not .cse2)) (and (= ~y~0_In-1346778406 |ULTIMATE.start_main_#t~ite42_Out-1346778406|) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1346778406, ~y~0=~y~0_In-1346778406, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1346778406, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1346778406} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1346778406, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1346778406|, ~y~0=~y~0_In-1346778406, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1346778406|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1346778406, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1346778406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:53:21,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1806258546 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1806258546 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1806258546| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1806258546| ~y$w_buff0_used~0_In1806258546) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1806258546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806258546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1806258546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806258546, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1806258546|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:53:21,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In626630349 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In626630349 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In626630349 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In626630349 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out626630349| ~y$w_buff1_used~0_In626630349)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out626630349|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In626630349, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In626630349, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In626630349, ~y$w_buff1_used~0=~y$w_buff1_used~0_In626630349} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In626630349, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In626630349, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In626630349, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out626630349|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In626630349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:53:21,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1570923552 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1570923552 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out1570923552| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out1570923552| ~y$r_buff0_thd0~0_In1570923552) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1570923552, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1570923552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1570923552, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1570923552, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1570923552|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 12:53:21,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1906819752 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1906819752 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1906819752 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1906819752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out1906819752| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite47_Out1906819752| ~y$r_buff1_thd0~0_In1906819752) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1906819752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1906819752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1906819752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1906819752} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1906819752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1906819752, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1906819752|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1906819752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1906819752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:53:21,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:53:21,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:53:21 BasicIcfg [2019-12-18 12:53:21,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:53:21,992 INFO L168 Benchmark]: Toolchain (without parser) took 182434.42 ms. Allocated memory was 137.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.8 MB in the beginning and 1.0 GB in the end (delta: -946.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,992 INFO L168 Benchmark]: CDTParser took 1.63 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.17 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.61 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,993 INFO L168 Benchmark]: Boogie Preprocessor took 41.17 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,993 INFO L168 Benchmark]: RCFGBuilder took 858.44 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.4 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,994 INFO L168 Benchmark]: TraceAbstraction took 180642.58 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.7 MB in the beginning and 1.0 GB in the end (delta: -947.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:53:21,995 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.17 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.61 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.17 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.44 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.4 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180642.58 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.7 MB in the beginning and 1.0 GB in the end (delta: -947.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t615, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] FCALL, FORK 0 pthread_create(&t616, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 180.2s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 76.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9362 SDtfs, 15212 SDslu, 45458 SDs, 0 SdLazy, 49594 SolverSat, 995 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 42 SyntacticMatches, 40 SemanticMatches, 747 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8205 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred 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: 57.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 297713 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1624 ConstructedInterpolants, 0 QuantifiedInterpolants, 419255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...