/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:27:58,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:27:58,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:27:58,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:27:58,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:27:58,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:27:58,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:27:58,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:27:58,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:27:58,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:27:58,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:27:58,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:27:58,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:27:58,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:27:58,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:27:58,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:27:58,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:27:58,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:27:58,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:27:58,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:27:58,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:27:58,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:27:58,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:27:58,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:27:58,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:27:58,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:27:58,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:27:58,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:27:58,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:27:58,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:27:58,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:27:58,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:27:58,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:27:58,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:27:58,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:27:58,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:27:58,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:27:58,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:27:58,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:27:58,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:27:58,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:27:58,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:27:58,288 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:27:58,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:27:58,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:27:58,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:27:58,290 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:27:58,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:27:58,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:27:58,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:27:58,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:27:58,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:27:58,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:27:58,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:27:58,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:27:58,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:27:58,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:27:58,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:27:58,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:27:58,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:27:58,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:27:58,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:27:58,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:27:58,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:27:58,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:27:58,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:27:58,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:27:58,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:27:58,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:27:58,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:27:58,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:27:58,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:27:58,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:27:58,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:27:58,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:27:58,616 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:27:58,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-18 16:27:58,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f65e669/a59871fde9264b63a821fec557763e5a/FLAG2c4cdc644 [2019-12-18 16:27:59,253 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:27:59,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-18 16:27:59,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f65e669/a59871fde9264b63a821fec557763e5a/FLAG2c4cdc644 [2019-12-18 16:27:59,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f65e669/a59871fde9264b63a821fec557763e5a [2019-12-18 16:27:59,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:27:59,529 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:27:59,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:27:59,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:27:59,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:27:59,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:27:59" (1/1) ... [2019-12-18 16:27:59,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1954d7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:27:59, skipping insertion in model container [2019-12-18 16:27:59,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:27:59" (1/1) ... [2019-12-18 16:27:59,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:27:59,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:28:00,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:28:00,223 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:28:00,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:28:00,396 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:28:00,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00 WrapperNode [2019-12-18 16:28:00,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:28:00,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:28:00,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:28:00,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:28:00,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:28:00,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:28:00,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:28:00,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:28:00,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (1/1) ... [2019-12-18 16:28:00,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:28:00,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:28:00,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:28:00,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:28:00,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (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 16:28:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:28:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:28:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:28:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:28:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:28:00,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:28:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:28:00,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:28:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:28:00,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:28:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:28:00,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:28:00,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:28:00,578 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 16:28:01,425 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:28:01,425 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:28:01,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:28:01 BoogieIcfgContainer [2019-12-18 16:28:01,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:28:01,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:28:01,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:28:01,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:28:01,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:27:59" (1/3) ... [2019-12-18 16:28:01,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd0f216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:28:01, skipping insertion in model container [2019-12-18 16:28:01,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:28:00" (2/3) ... [2019-12-18 16:28:01,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd0f216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:28:01, skipping insertion in model container [2019-12-18 16:28:01,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:28:01" (3/3) ... [2019-12-18 16:28:01,440 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_power.oepc.i [2019-12-18 16:28:01,451 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:28:01,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:28:01,463 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:28:01,465 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:28:01,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,572 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,572 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,607 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,609 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:28:01,649 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:28:01,670 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:28:01,670 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:28:01,670 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:28:01,670 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:28:01,670 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:28:01,671 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:28:01,671 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:28:01,671 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:28:01,687 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 16:28:01,689 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 16:28:01,799 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 16:28:01,799 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:28:01,821 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:28:01,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 16:28:01,922 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 16:28:01,922 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:28:01,932 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:28:01,954 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:28:01,955 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:28:07,313 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 16:28:07,452 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 16:28:07,594 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-18 16:28:07,594 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 16:28:07,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-18 16:28:26,386 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-18 16:28:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-18 16:28:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:28:26,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:28:26,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:28:26,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:28:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:28:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-18 16:28:26,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:28:26,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075722072] [2019-12-18 16:28:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:28:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:28:26,633 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 16:28:26,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075722072] [2019-12-18 16:28:26,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:28:26,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:28:26,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659977482] [2019-12-18 16:28:26,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:28:26,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:28:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:28:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:28:26,658 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-18 16:28:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:28:27,719 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-18 16:28:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:28:27,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:28:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:28:31,388 INFO L225 Difference]: With dead ends: 116858 [2019-12-18 16:28:31,388 INFO L226 Difference]: Without dead ends: 110138 [2019-12-18 16:28:31,389 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 16:28:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-18 16:28:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-18 16:28:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-18 16:28:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-18 16:28:43,083 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-18 16:28:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:28:43,083 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-18 16:28:43,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:28:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-18 16:28:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:28:43,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:28:43,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:28:43,087 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:28:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:28:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-18 16:28:43,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:28:43,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622627235] [2019-12-18 16:28:43,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:28:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:28:43,195 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 16:28:43,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622627235] [2019-12-18 16:28:43,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:28:43,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:28:43,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5724802] [2019-12-18 16:28:43,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:28:43,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:28:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:28:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:28:43,198 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-18 16:28:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:28:44,351 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-18 16:28:44,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:28:44,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:28:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:28:50,205 INFO L225 Difference]: With dead ends: 170904 [2019-12-18 16:28:50,205 INFO L226 Difference]: Without dead ends: 170855 [2019-12-18 16:28:50,206 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 16:28:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-18 16:28:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-18 16:28:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-18 16:28:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-18 16:28:59,834 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-18 16:28:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:28:59,835 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-18 16:28:59,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:28:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-18 16:28:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:28:59,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:28:59,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:28:59,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:28:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:28:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-18 16:28:59,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:28:59,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073230266] [2019-12-18 16:28:59,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:28:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:28:59,908 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 16:28:59,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073230266] [2019-12-18 16:28:59,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:28:59,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:28:59,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499168003] [2019-12-18 16:28:59,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:28:59,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:28:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:28:59,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:28:59,910 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-18 16:29:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:00,040 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-18 16:29:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:00,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:29:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:00,097 INFO L225 Difference]: With dead ends: 33673 [2019-12-18 16:29:00,097 INFO L226 Difference]: Without dead ends: 33673 [2019-12-18 16:29:00,098 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 16:29:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-18 16:29:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-18 16:29:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-18 16:29:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-18 16:29:00,719 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-18 16:29:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:00,719 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-18 16:29:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-18 16:29:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:29:00,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:00,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:00,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-18 16:29:00,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:00,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302722398] [2019-12-18 16:29:00,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:00,836 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 16:29:00,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302722398] [2019-12-18 16:29:00,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:00,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:29:00,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211310158] [2019-12-18 16:29:00,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:29:00,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:29:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:29:00,843 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-18 16:29:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:01,221 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-18 16:29:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:29:01,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:29:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:01,785 INFO L225 Difference]: With dead ends: 42056 [2019-12-18 16:29:01,785 INFO L226 Difference]: Without dead ends: 42056 [2019-12-18 16:29: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=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:29:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-18 16:29:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-18 16:29:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-18 16:29:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-18 16:29:02,480 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-18 16:29:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:02,481 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-18 16:29:02,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:29:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-18 16:29:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:29:02,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:02,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:02,489 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-18 16:29:02,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:02,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848373313] [2019-12-18 16:29:02,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:02,638 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 16:29:02,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848373313] [2019-12-18 16:29:02,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:02,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:02,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065906875] [2019-12-18 16:29:02,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:29:02,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:29:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:29:02,641 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-18 16:29:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:03,251 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-18 16:29:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:29:03,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:29:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:03,325 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 16:29:03,325 INFO L226 Difference]: Without dead ends: 48530 [2019-12-18 16:29:03,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:29:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-18 16:29:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-18 16:29:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-18 16:29:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-18 16:29:04,405 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-18 16:29:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:04,406 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-18 16:29:04,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:29:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-18 16:29:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:29:04,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:04,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:04,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-18 16:29:04,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:04,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289446358] [2019-12-18 16:29:04,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:04,470 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 16:29:04,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289446358] [2019-12-18 16:29:04,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:04,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:04,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268666559] [2019-12-18 16:29:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:29:04,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:29:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:29:04,472 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-18 16:29:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:04,543 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-18 16:29:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:29:04,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:29:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:04,569 INFO L225 Difference]: With dead ends: 14576 [2019-12-18 16:29:04,569 INFO L226 Difference]: Without dead ends: 14576 [2019-12-18 16:29:04,570 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 16:29:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-18 16:29:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-18 16:29:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-18 16:29:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-18 16:29:04,790 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-18 16:29:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:04,790 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-18 16:29:04,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:29:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-18 16:29:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:29:04,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:04,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:04,801 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-18 16:29:04,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:04,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700398856] [2019-12-18 16:29:04,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:04,840 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 16:29:04,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700398856] [2019-12-18 16:29:04,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:04,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:04,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882590482] [2019-12-18 16:29:04,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:29:04,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:29:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:04,842 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-18 16:29:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:04,937 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-18 16:29:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:04,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:29:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:04,966 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 16:29:04,967 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 16:29:04,967 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 16:29:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 16:29:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 16:29:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 16:29:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-18 16:29:05,244 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-18 16:29:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:05,244 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-18 16:29:05,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-18 16:29:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:29:05,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:05,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:05,256 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-18 16:29:05,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:05,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519571663] [2019-12-18 16:29:05,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:05,296 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 16:29:05,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519571663] [2019-12-18 16:29:05,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:05,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:05,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946304928] [2019-12-18 16:29:05,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:29:05,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:05,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:29:05,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:05,298 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-18 16:29:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:05,383 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-18 16:29:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:05,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:29:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:05,412 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 16:29:05,412 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 16:29:05,413 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 16:29:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 16:29:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 16:29:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 16:29:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-18 16:29:05,703 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-18 16:29:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:05,704 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-18 16:29:05,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-18 16:29:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:29:05,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:05,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:05,717 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-18 16:29:05,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:05,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376925440] [2019-12-18 16:29:05,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:05,817 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 16:29:05,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376925440] [2019-12-18 16:29:05,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:05,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:29:05,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331904000] [2019-12-18 16:29:05,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:29:05,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:29:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:29:05,821 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-18 16:29:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:06,609 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-18 16:29:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:29:06,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 16:29:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:06,665 INFO L225 Difference]: With dead ends: 31275 [2019-12-18 16:29:06,666 INFO L226 Difference]: Without dead ends: 31275 [2019-12-18 16:29:06,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:29:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-18 16:29:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-18 16:29:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-18 16:29:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-18 16:29:07,024 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-18 16:29:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:07,024 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-18 16:29:07,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:29:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-18 16:29:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:29:07,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:07,038 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 16:29:07,039 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-18 16:29:07,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:07,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572366785] [2019-12-18 16:29:07,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:07,111 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 16:29:07,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572366785] [2019-12-18 16:29:07,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:07,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:29:07,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319327133] [2019-12-18 16:29:07,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:29:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:29:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:29:07,114 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-18 16:29:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:07,723 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-18 16:29:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:29:07,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 16:29:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:07,765 INFO L225 Difference]: With dead ends: 30618 [2019-12-18 16:29:07,765 INFO L226 Difference]: Without dead ends: 30618 [2019-12-18 16:29:07,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:29:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-18 16:29:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-18 16:29:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-18 16:29:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-18 16:29:08,136 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-18 16:29:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:08,137 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-18 16:29:08,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:29:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-18 16:29:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:29:08,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:08,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:08,157 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-18 16:29:08,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:08,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736223836] [2019-12-18 16:29:08,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:08,224 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 16:29:08,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736223836] [2019-12-18 16:29:08,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:08,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:08,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439148959] [2019-12-18 16:29:08,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:29:08,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:29:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:29:08,227 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-18 16:29:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:08,625 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-18 16:29:08,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:29:08,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 16:29:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:08,670 INFO L225 Difference]: With dead ends: 23829 [2019-12-18 16:29:08,670 INFO L226 Difference]: Without dead ends: 23829 [2019-12-18 16:29:08,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:29:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-18 16:29:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-18 16:29:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-18 16:29:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-18 16:29:09,301 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-18 16:29:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:09,302 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-18 16:29:09,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:29:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-18 16:29:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:29:09,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:09,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:09,324 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-18 16:29:09,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:09,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092485455] [2019-12-18 16:29:09,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:09,404 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 16:29:09,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092485455] [2019-12-18 16:29:09,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:09,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:29:09,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424651979] [2019-12-18 16:29:09,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:29:09,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:09,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:29:09,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:29:09,406 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-18 16:29:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:10,736 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-18 16:29:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:29:10,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 16:29:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:10,800 INFO L225 Difference]: With dead ends: 39715 [2019-12-18 16:29:10,800 INFO L226 Difference]: Without dead ends: 39715 [2019-12-18 16:29:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:29:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-18 16:29:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-18 16:29:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-18 16:29:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-18 16:29:11,268 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-18 16:29:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:11,268 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-18 16:29:11,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:29:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-18 16:29:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:29:11,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:11,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:11,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-18 16:29:11,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:11,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545488021] [2019-12-18 16:29:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:11,396 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 16:29:11,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545488021] [2019-12-18 16:29:11,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:11,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:29:11,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813449617] [2019-12-18 16:29:11,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:29:11,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:11,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:29:11,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:29:11,399 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 8 states. [2019-12-18 16:29:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:13,164 INFO L93 Difference]: Finished difference Result 46968 states and 136953 transitions. [2019-12-18 16:29:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:29:13,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 16:29:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:13,228 INFO L225 Difference]: With dead ends: 46968 [2019-12-18 16:29:13,228 INFO L226 Difference]: Without dead ends: 46968 [2019-12-18 16:29:13,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:29:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46968 states. [2019-12-18 16:29:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46968 to 20735. [2019-12-18 16:29:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 16:29:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61975 transitions. [2019-12-18 16:29:14,017 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61975 transitions. Word has length 33 [2019-12-18 16:29:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:14,018 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61975 transitions. [2019-12-18 16:29:14,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:29:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61975 transitions. [2019-12-18 16:29:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:29:14,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:14,034 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] [2019-12-18 16:29:14,034 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-18 16:29:14,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:14,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111549812] [2019-12-18 16:29:14,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:14,154 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 16:29:14,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111549812] [2019-12-18 16:29:14,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:14,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:29:14,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024368827] [2019-12-18 16:29:14,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:29:14,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:14,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:29:14,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:29:14,156 INFO L87 Difference]: Start difference. First operand 20735 states and 61975 transitions. Second operand 7 states. [2019-12-18 16:29:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:15,559 INFO L93 Difference]: Finished difference Result 36504 states and 106979 transitions. [2019-12-18 16:29:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:29:15,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 16:29:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:15,612 INFO L225 Difference]: With dead ends: 36504 [2019-12-18 16:29:15,612 INFO L226 Difference]: Without dead ends: 36504 [2019-12-18 16:29:15,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:29:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36504 states. [2019-12-18 16:29:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36504 to 19450. [2019-12-18 16:29:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-12-18 16:29:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 58223 transitions. [2019-12-18 16:29:16,045 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 58223 transitions. Word has length 34 [2019-12-18 16:29:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:16,045 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 58223 transitions. [2019-12-18 16:29:16,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:29:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 58223 transitions. [2019-12-18 16:29:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:29:16,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:16,065 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] [2019-12-18 16:29:16,065 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:16,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-18 16:29:16,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:16,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050637782] [2019-12-18 16:29:16,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:16,169 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 16:29:16,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050637782] [2019-12-18 16:29:16,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:16,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:29:16,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613348260] [2019-12-18 16:29:16,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:29:16,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:29:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:29:16,171 INFO L87 Difference]: Start difference. First operand 19450 states and 58223 transitions. Second operand 8 states. [2019-12-18 16:29:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:17,840 INFO L93 Difference]: Finished difference Result 41529 states and 120361 transitions. [2019-12-18 16:29:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:29:17,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 16:29:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:17,939 INFO L225 Difference]: With dead ends: 41529 [2019-12-18 16:29:17,939 INFO L226 Difference]: Without dead ends: 41529 [2019-12-18 16:29:17,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:29:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41529 states. [2019-12-18 16:29:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41529 to 17750. [2019-12-18 16:29:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-18 16:29:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 53183 transitions. [2019-12-18 16:29:19,119 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 53183 transitions. Word has length 34 [2019-12-18 16:29:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:19,119 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 53183 transitions. [2019-12-18 16:29:19,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:29:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 53183 transitions. [2019-12-18 16:29:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:29:19,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:19,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:19,143 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-18 16:29:19,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:19,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588206871] [2019-12-18 16:29:19,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:19,200 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 16:29:19,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588206871] [2019-12-18 16:29:19,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:19,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:19,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584245561] [2019-12-18 16:29:19,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:29:19,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:29:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:29:19,205 INFO L87 Difference]: Start difference. First operand 17750 states and 53183 transitions. Second operand 4 states. [2019-12-18 16:29:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:19,334 INFO L93 Difference]: Finished difference Result 30219 states and 90879 transitions. [2019-12-18 16:29:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:29:19,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 16:29:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:19,361 INFO L225 Difference]: With dead ends: 30219 [2019-12-18 16:29:19,361 INFO L226 Difference]: Without dead ends: 15274 [2019-12-18 16:29:19,362 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 16:29:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-18 16:29:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15208. [2019-12-18 16:29:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-18 16:29:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44774 transitions. [2019-12-18 16:29:19,603 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44774 transitions. Word has length 39 [2019-12-18 16:29:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:19,603 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44774 transitions. [2019-12-18 16:29:19,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:29:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44774 transitions. [2019-12-18 16:29:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:29:19,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:19,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] [2019-12-18 16:29:19,618 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:19,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-18 16:29:19,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:19,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574331147] [2019-12-18 16:29:19,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:19,662 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 16:29:19,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574331147] [2019-12-18 16:29:19,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:19,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:29:19,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257841658] [2019-12-18 16:29:19,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:29:19,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:29:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:19,665 INFO L87 Difference]: Start difference. First operand 15208 states and 44774 transitions. Second operand 3 states. [2019-12-18 16:29:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:19,719 INFO L93 Difference]: Finished difference Result 15207 states and 44772 transitions. [2019-12-18 16:29:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:19,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:29:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:19,745 INFO L225 Difference]: With dead ends: 15207 [2019-12-18 16:29:19,745 INFO L226 Difference]: Without dead ends: 15207 [2019-12-18 16:29:19,745 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 16:29:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2019-12-18 16:29:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 15207. [2019-12-18 16:29:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15207 states. [2019-12-18 16:29:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 44772 transitions. [2019-12-18 16:29:19,976 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 44772 transitions. Word has length 39 [2019-12-18 16:29:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:19,976 INFO L462 AbstractCegarLoop]: Abstraction has 15207 states and 44772 transitions. [2019-12-18 16:29:19,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 44772 transitions. [2019-12-18 16:29:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:29:19,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:19,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:19,990 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-18 16:29:19,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:19,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849520711] [2019-12-18 16:29:19,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:20,033 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 16:29:20,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849520711] [2019-12-18 16:29:20,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:20,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:20,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006339877] [2019-12-18 16:29:20,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:29:20,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:29:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:29:20,036 INFO L87 Difference]: Start difference. First operand 15207 states and 44772 transitions. Second operand 4 states. [2019-12-18 16:29:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:20,146 INFO L93 Difference]: Finished difference Result 24324 states and 71986 transitions. [2019-12-18 16:29:20,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:29:20,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 16:29:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:20,166 INFO L225 Difference]: With dead ends: 24324 [2019-12-18 16:29:20,166 INFO L226 Difference]: Without dead ends: 11139 [2019-12-18 16:29:20,167 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 16:29:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11139 states. [2019-12-18 16:29:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11139 to 11082. [2019-12-18 16:29:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-12-18 16:29:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 31786 transitions. [2019-12-18 16:29:20,359 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 31786 transitions. Word has length 40 [2019-12-18 16:29:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:20,360 INFO L462 AbstractCegarLoop]: Abstraction has 11082 states and 31786 transitions. [2019-12-18 16:29:20,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:29:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 31786 transitions. [2019-12-18 16:29:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:29:20,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:20,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:20,370 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-18 16:29:20,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:20,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940927333] [2019-12-18 16:29:20,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:20,416 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 16:29:20,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940927333] [2019-12-18 16:29:20,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:20,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:29:20,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332945188] [2019-12-18 16:29:20,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:29:20,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:29:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:29:20,418 INFO L87 Difference]: Start difference. First operand 11082 states and 31786 transitions. Second operand 5 states. [2019-12-18 16:29:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:20,476 INFO L93 Difference]: Finished difference Result 10120 states and 29645 transitions. [2019-12-18 16:29:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:29:20,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:29:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:20,491 INFO L225 Difference]: With dead ends: 10120 [2019-12-18 16:29:20,491 INFO L226 Difference]: Without dead ends: 7230 [2019-12-18 16:29:20,492 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 16:29:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-18 16:29:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-18 16:29:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-18 16:29:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-18 16:29:20,636 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-18 16:29:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:20,637 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-18 16:29:20,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:29:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-18 16:29:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:29:20,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:20,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:20,645 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-18 16:29:20,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:20,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100173263] [2019-12-18 16:29:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:20,726 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 16:29:20,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100173263] [2019-12-18 16:29:20,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:20,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:29:20,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548848314] [2019-12-18 16:29:20,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:29:20,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:20,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:29:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:29:20,728 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-18 16:29:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:21,032 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-18 16:29:21,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:29:21,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:29:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:21,054 INFO L225 Difference]: With dead ends: 14425 [2019-12-18 16:29:21,054 INFO L226 Difference]: Without dead ends: 10624 [2019-12-18 16:29:21,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:29:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-18 16:29:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-18 16:29:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-18 16:29:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-18 16:29:21,278 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-18 16:29:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:21,278 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-18 16:29:21,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:29:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-18 16:29:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:29:21,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:21,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:21,292 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-18 16:29:21,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:21,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660971062] [2019-12-18 16:29:21,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:21,389 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 16:29:21,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660971062] [2019-12-18 16:29:21,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:21,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:29:21,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875093256] [2019-12-18 16:29:21,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:29:21,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:21,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:29:21,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:29:21,390 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-18 16:29:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:21,671 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-18 16:29:21,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:29:21,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:29:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:21,689 INFO L225 Difference]: With dead ends: 16977 [2019-12-18 16:29:21,690 INFO L226 Difference]: Without dead ends: 12608 [2019-12-18 16:29:21,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:29:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-18 16:29:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-18 16:29:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-18 16:29:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-18 16:29:22,085 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-18 16:29:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:22,086 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-18 16:29:22,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:29:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-18 16:29:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:29:22,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:22,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:22,097 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-18 16:29:22,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:22,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435448370] [2019-12-18 16:29:22,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:22,223 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 16:29:22,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435448370] [2019-12-18 16:29:22,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:22,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:29:22,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017824025] [2019-12-18 16:29:22,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:29:22,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:29:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:29:22,225 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-18 16:29:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:23,242 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-18 16:29:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:29:23,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:29:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:23,281 INFO L225 Difference]: With dead ends: 29742 [2019-12-18 16:29:23,281 INFO L226 Difference]: Without dead ends: 27534 [2019-12-18 16:29:23,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:29:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-18 16:29:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-18 16:29:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-18 16:29:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-18 16:29:23,555 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-18 16:29:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:23,556 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-18 16:29:23,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:29:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-18 16:29:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:29:23,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:23,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:23,568 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-18 16:29:23,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:23,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746100948] [2019-12-18 16:29:23,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:23,662 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 16:29:23,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746100948] [2019-12-18 16:29:23,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:23,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:29:23,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335892751] [2019-12-18 16:29:23,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:29:23,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:29:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:29:23,664 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-18 16:29:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:24,571 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-18 16:29:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:29:24,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:29:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:24,606 INFO L225 Difference]: With dead ends: 23762 [2019-12-18 16:29:24,606 INFO L226 Difference]: Without dead ends: 22008 [2019-12-18 16:29:24,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:29:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-18 16:29:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-18 16:29:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-18 16:29:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-18 16:29:24,854 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-18 16:29:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:24,855 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-18 16:29:24,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:29:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-18 16:29:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:29:24,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:24,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:24,867 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-18 16:29:24,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:24,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116638295] [2019-12-18 16:29:24,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:24,951 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 16:29:24,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116638295] [2019-12-18 16:29:24,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:24,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:29:24,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116941867] [2019-12-18 16:29:24,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:29:24,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:29:24,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:24,954 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-18 16:29:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:24,994 INFO L93 Difference]: Finished difference Result 8225 states and 25321 transitions. [2019-12-18 16:29:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:24,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:29:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:25,008 INFO L225 Difference]: With dead ends: 8225 [2019-12-18 16:29:25,008 INFO L226 Difference]: Without dead ends: 8225 [2019-12-18 16:29:25,008 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 16:29:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2019-12-18 16:29:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 8225. [2019-12-18 16:29:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8225 states. [2019-12-18 16:29:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 25321 transitions. [2019-12-18 16:29:25,213 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 25321 transitions. Word has length 64 [2019-12-18 16:29:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:25,213 INFO L462 AbstractCegarLoop]: Abstraction has 8225 states and 25321 transitions. [2019-12-18 16:29:25,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 25321 transitions. [2019-12-18 16:29:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:29:25,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:25,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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:25,226 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash 415532239, now seen corresponding path program 1 times [2019-12-18 16:29:25,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:25,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348428827] [2019-12-18 16:29:25,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:25,308 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 16:29:25,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348428827] [2019-12-18 16:29:25,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:25,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:29:25,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134163819] [2019-12-18 16:29:25,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:29:25,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:25,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:29:25,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:25,310 INFO L87 Difference]: Start difference. First operand 8225 states and 25321 transitions. Second operand 3 states. [2019-12-18 16:29:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:25,425 INFO L93 Difference]: Finished difference Result 9677 states and 29688 transitions. [2019-12-18 16:29:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:25,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:29:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:25,446 INFO L225 Difference]: With dead ends: 9677 [2019-12-18 16:29:25,446 INFO L226 Difference]: Without dead ends: 9677 [2019-12-18 16:29:25,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-12-18 16:29:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8621. [2019-12-18 16:29:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8621 states. [2019-12-18 16:29:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8621 states to 8621 states and 26608 transitions. [2019-12-18 16:29:25,732 INFO L78 Accepts]: Start accepts. Automaton has 8621 states and 26608 transitions. Word has length 65 [2019-12-18 16:29:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:25,733 INFO L462 AbstractCegarLoop]: Abstraction has 8621 states and 26608 transitions. [2019-12-18 16:29:25,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8621 states and 26608 transitions. [2019-12-18 16:29:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:29:25,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:25,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:25,748 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash -436961782, now seen corresponding path program 1 times [2019-12-18 16:29:25,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:25,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376053406] [2019-12-18 16:29:25,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:25,852 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 16:29:25,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376053406] [2019-12-18 16:29:25,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:25,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:29:25,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996527091] [2019-12-18 16:29:25,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:29:25,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:25,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:29:25,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:29:25,855 INFO L87 Difference]: Start difference. First operand 8621 states and 26608 transitions. Second operand 4 states. [2019-12-18 16:29:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:26,198 INFO L93 Difference]: Finished difference Result 8489 states and 26091 transitions. [2019-12-18 16:29:26,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:29:26,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 16:29:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:26,212 INFO L225 Difference]: With dead ends: 8489 [2019-12-18 16:29:26,212 INFO L226 Difference]: Without dead ends: 8489 [2019-12-18 16:29:26,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 16:29:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8489 states. [2019-12-18 16:29:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8489 to 8093. [2019-12-18 16:29:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8093 states. [2019-12-18 16:29:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8093 states to 8093 states and 24804 transitions. [2019-12-18 16:29:26,393 INFO L78 Accepts]: Start accepts. Automaton has 8093 states and 24804 transitions. Word has length 66 [2019-12-18 16:29:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:26,394 INFO L462 AbstractCegarLoop]: Abstraction has 8093 states and 24804 transitions. [2019-12-18 16:29:26,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:29:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8093 states and 24804 transitions. [2019-12-18 16:29:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:29:26,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:26,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:26,406 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1846241215, now seen corresponding path program 1 times [2019-12-18 16:29:26,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:26,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171310945] [2019-12-18 16:29:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:26,579 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 16:29:26,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171310945] [2019-12-18 16:29:26,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:26,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:29:26,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158399123] [2019-12-18 16:29:26,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:29:26,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:29:26,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:29:26,582 INFO L87 Difference]: Start difference. First operand 8093 states and 24804 transitions. Second operand 3 states. [2019-12-18 16:29:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:26,642 INFO L93 Difference]: Finished difference Result 8092 states and 24802 transitions. [2019-12-18 16:29:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:29:26,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:29:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:26,664 INFO L225 Difference]: With dead ends: 8092 [2019-12-18 16:29:26,664 INFO L226 Difference]: Without dead ends: 8092 [2019-12-18 16:29:26,665 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 16:29:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8092 states. [2019-12-18 16:29:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8092 to 8092. [2019-12-18 16:29:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8092 states. [2019-12-18 16:29:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 24802 transitions. [2019-12-18 16:29:26,930 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 24802 transitions. Word has length 66 [2019-12-18 16:29:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:26,931 INFO L462 AbstractCegarLoop]: Abstraction has 8092 states and 24802 transitions. [2019-12-18 16:29:26,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:29:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 24802 transitions. [2019-12-18 16:29:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:26,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:26,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:26,948 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-18 16:29:26,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:26,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240431782] [2019-12-18 16:29:26,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:27,142 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 16:29:27,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240431782] [2019-12-18 16:29:27,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:27,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:29:27,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185413284] [2019-12-18 16:29:27,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:29:27,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:27,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:29:27,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:29:27,145 INFO L87 Difference]: Start difference. First operand 8092 states and 24802 transitions. Second operand 9 states. [2019-12-18 16:29:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:28,210 INFO L93 Difference]: Finished difference Result 16004 states and 48332 transitions. [2019-12-18 16:29:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:29:28,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 16:29:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:28,235 INFO L225 Difference]: With dead ends: 16004 [2019-12-18 16:29:28,235 INFO L226 Difference]: Without dead ends: 11673 [2019-12-18 16:29:28,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:29:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11673 states. [2019-12-18 16:29:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11673 to 8750. [2019-12-18 16:29:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-18 16:29:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 26571 transitions. [2019-12-18 16:29:28,419 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 26571 transitions. Word has length 67 [2019-12-18 16:29:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:28,419 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 26571 transitions. [2019-12-18 16:29:28,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:29:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 26571 transitions. [2019-12-18 16:29:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:28,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:28,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:28,430 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-18 16:29:28,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:28,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119428889] [2019-12-18 16:29:28,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:28,624 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 16:29:28,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119428889] [2019-12-18 16:29:28,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:28,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:29:28,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436641926] [2019-12-18 16:29:28,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:29:28,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:29:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:29:28,626 INFO L87 Difference]: Start difference. First operand 8750 states and 26571 transitions. Second operand 10 states. [2019-12-18 16:29:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:30,076 INFO L93 Difference]: Finished difference Result 15111 states and 44497 transitions. [2019-12-18 16:29:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:29:30,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:29:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:30,096 INFO L225 Difference]: With dead ends: 15111 [2019-12-18 16:29:30,096 INFO L226 Difference]: Without dead ends: 13108 [2019-12-18 16:29:30,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:29:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2019-12-18 16:29:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 8934. [2019-12-18 16:29:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-18 16:29:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 26943 transitions. [2019-12-18 16:29:30,276 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 26943 transitions. Word has length 67 [2019-12-18 16:29:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:30,276 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 26943 transitions. [2019-12-18 16:29:30,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:29:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 26943 transitions. [2019-12-18 16:29:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:30,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:30,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:30,287 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1716057561, now seen corresponding path program 3 times [2019-12-18 16:29:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:30,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036449662] [2019-12-18 16:29:30,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:30,456 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 16:29:30,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036449662] [2019-12-18 16:29:30,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:30,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:29:30,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657813524] [2019-12-18 16:29:30,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:29:30,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:29:30,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:29:30,458 INFO L87 Difference]: Start difference. First operand 8934 states and 26943 transitions. Second operand 11 states. [2019-12-18 16:29:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:32,291 INFO L93 Difference]: Finished difference Result 14284 states and 41754 transitions. [2019-12-18 16:29:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:29:32,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:29:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:32,311 INFO L225 Difference]: With dead ends: 14284 [2019-12-18 16:29:32,311 INFO L226 Difference]: Without dead ends: 13261 [2019-12-18 16:29:32,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:29:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2019-12-18 16:29:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 8750. [2019-12-18 16:29:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-18 16:29:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 26453 transitions. [2019-12-18 16:29:32,701 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 26453 transitions. Word has length 67 [2019-12-18 16:29:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:32,701 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 26453 transitions. [2019-12-18 16:29:32,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:29:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 26453 transitions. [2019-12-18 16:29:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:32,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:32,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:32,710 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-18 16:29:32,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:32,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771396253] [2019-12-18 16:29:32,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:32,900 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 16:29:32,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771396253] [2019-12-18 16:29:32,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:32,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:29:32,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179913660] [2019-12-18 16:29:32,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:29:32,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:29:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:29:32,902 INFO L87 Difference]: Start difference. First operand 8750 states and 26453 transitions. Second operand 12 states. [2019-12-18 16:29:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:35,217 INFO L93 Difference]: Finished difference Result 17438 states and 51575 transitions. [2019-12-18 16:29:35,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:29:35,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 16:29:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:35,236 INFO L225 Difference]: With dead ends: 17438 [2019-12-18 16:29:35,236 INFO L226 Difference]: Without dead ends: 12737 [2019-12-18 16:29:35,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:29:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12737 states. [2019-12-18 16:29:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12737 to 8590. [2019-12-18 16:29:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8590 states. [2019-12-18 16:29:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 25864 transitions. [2019-12-18 16:29:35,389 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 25864 transitions. Word has length 67 [2019-12-18 16:29:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:35,389 INFO L462 AbstractCegarLoop]: Abstraction has 8590 states and 25864 transitions. [2019-12-18 16:29:35,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:29:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 25864 transitions. [2019-12-18 16:29:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:35,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:35,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:35,398 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 575406353, now seen corresponding path program 5 times [2019-12-18 16:29:35,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:35,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906559421] [2019-12-18 16:29:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:35,649 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 16:29:35,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906559421] [2019-12-18 16:29:35,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:35,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:29:35,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367754714] [2019-12-18 16:29:35,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:29:35,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:35,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:29:35,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:29:35,651 INFO L87 Difference]: Start difference. First operand 8590 states and 25864 transitions. Second operand 11 states. [2019-12-18 16:29:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:36,641 INFO L93 Difference]: Finished difference Result 14134 states and 41685 transitions. [2019-12-18 16:29:36,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 16:29:36,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:29:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:36,656 INFO L225 Difference]: With dead ends: 14134 [2019-12-18 16:29:36,656 INFO L226 Difference]: Without dead ends: 11211 [2019-12-18 16:29:36,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:29:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11211 states. [2019-12-18 16:29:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11211 to 8276. [2019-12-18 16:29:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2019-12-18 16:29:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 24994 transitions. [2019-12-18 16:29:36,806 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 24994 transitions. Word has length 67 [2019-12-18 16:29:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:36,806 INFO L462 AbstractCegarLoop]: Abstraction has 8276 states and 24994 transitions. [2019-12-18 16:29:36,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:29:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 24994 transitions. [2019-12-18 16:29:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:36,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:36,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:36,815 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 6 times [2019-12-18 16:29:36,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:36,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606111924] [2019-12-18 16:29:36,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:36,983 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 16:29:36,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606111924] [2019-12-18 16:29:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:36,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:29:36,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063418256] [2019-12-18 16:29:36,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:29:36,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:29:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:29:36,986 INFO L87 Difference]: Start difference. First operand 8276 states and 24994 transitions. Second operand 10 states. [2019-12-18 16:29:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:38,159 INFO L93 Difference]: Finished difference Result 10920 states and 32038 transitions. [2019-12-18 16:29:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:29:38,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:29:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:38,174 INFO L225 Difference]: With dead ends: 10920 [2019-12-18 16:29:38,174 INFO L226 Difference]: Without dead ends: 10445 [2019-12-18 16:29:38,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:29:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2019-12-18 16:29:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 8116. [2019-12-18 16:29:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2019-12-18 16:29:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 24515 transitions. [2019-12-18 16:29:38,331 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 24515 transitions. Word has length 67 [2019-12-18 16:29:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:38,331 INFO L462 AbstractCegarLoop]: Abstraction has 8116 states and 24515 transitions. [2019-12-18 16:29:38,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:29:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 24515 transitions. [2019-12-18 16:29:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:38,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:38,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:38,341 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 7 times [2019-12-18 16:29:38,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:38,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207061370] [2019-12-18 16:29:38,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:38,463 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 16:29:38,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207061370] [2019-12-18 16:29:38,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:38,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:29:38,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476830151] [2019-12-18 16:29:38,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:29:38,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:29:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:29:38,468 INFO L87 Difference]: Start difference. First operand 8116 states and 24515 transitions. Second operand 10 states. [2019-12-18 16:29:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:39,736 INFO L93 Difference]: Finished difference Result 10960 states and 32212 transitions. [2019-12-18 16:29:39,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:29:39,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:29:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:39,750 INFO L225 Difference]: With dead ends: 10960 [2019-12-18 16:29:39,750 INFO L226 Difference]: Without dead ends: 10717 [2019-12-18 16:29:39,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:29:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2019-12-18 16:29:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 8132. [2019-12-18 16:29:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8132 states. [2019-12-18 16:29:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 24559 transitions. [2019-12-18 16:29:39,888 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 24559 transitions. Word has length 67 [2019-12-18 16:29:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:39,888 INFO L462 AbstractCegarLoop]: Abstraction has 8132 states and 24559 transitions. [2019-12-18 16:29:39,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:29:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 24559 transitions. [2019-12-18 16:29:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:39,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:39,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:29:39,898 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:39,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 8 times [2019-12-18 16:29:39,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:39,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169949599] [2019-12-18 16:29:39,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:29:40,090 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 16:29:40,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169949599] [2019-12-18 16:29:40,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:29:40,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:29:40,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690388425] [2019-12-18 16:29:40,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:29:40,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:29:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:29:40,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:29:40,091 INFO L87 Difference]: Start difference. First operand 8132 states and 24559 transitions. Second operand 12 states. [2019-12-18 16:29:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:29:41,777 INFO L93 Difference]: Finished difference Result 11719 states and 34211 transitions. [2019-12-18 16:29:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:29:41,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 16:29:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:29:41,793 INFO L225 Difference]: With dead ends: 11719 [2019-12-18 16:29:41,793 INFO L226 Difference]: Without dead ends: 11476 [2019-12-18 16:29:41,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:29:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11476 states. [2019-12-18 16:29:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11476 to 7956. [2019-12-18 16:29:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7956 states. [2019-12-18 16:29:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7956 states to 7956 states and 24075 transitions. [2019-12-18 16:29:41,945 INFO L78 Accepts]: Start accepts. Automaton has 7956 states and 24075 transitions. Word has length 67 [2019-12-18 16:29:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:29:41,945 INFO L462 AbstractCegarLoop]: Abstraction has 7956 states and 24075 transitions. [2019-12-18 16:29:41,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:29:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7956 states and 24075 transitions. [2019-12-18 16:29:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:29:41,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:29:41,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:41,954 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:29:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:29:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 9 times [2019-12-18 16:29:41,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:29:41,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237159031] [2019-12-18 16:29:41,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:29:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:29:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:29:42,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:29:42,116 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:29:42,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_29|) |v_ULTIMATE.start_main_~#t385~0.offset_22| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t385~0.base_29|)) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t385~0.base_29| 4)) (= 0 v_~a$r_buff1_thd2~0_129) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t385~0.base_29| 1)) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= 0 |v_ULTIMATE.start_main_~#t385~0.offset_22|) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t385~0.base_29|) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_29|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_22|, ULTIMATE.start_main_~#t385~0.offset=|v_ULTIMATE.start_main_~#t385~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t385~0.base=|v_ULTIMATE.start_main_~#t385~0.base_29|, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t387~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t386~0.offset, ULTIMATE.start_main_~#t385~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t385~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t387~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 16:29:42,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t386~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t386~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12|) |v_ULTIMATE.start_main_~#t386~0.offset_10| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t386~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_12|, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t386~0.offset] because there is no mapped edge [2019-12-18 16:29:42,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t387~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t387~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t387~0.base_13| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13|) |v_ULTIMATE.start_main_~#t387~0.offset_11| 2))) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t387~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_13|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t387~0.base, ULTIMATE.start_main_~#t387~0.offset] because there is no mapped edge [2019-12-18 16:29:42,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff0_thd1~0_In1686466093 ~a$r_buff1_thd1~0_Out1686466093) (= ~a$r_buff0_thd0~0_In1686466093 ~a$r_buff1_thd0~0_Out1686466093) (= 1 ~x~0_Out1686466093) (= ~a$r_buff1_thd2~0_Out1686466093 ~a$r_buff0_thd2~0_In1686466093) (= ~y~0_In1686466093 ~__unbuffered_p0_EBX~0_Out1686466093) (= ~a$r_buff1_thd3~0_Out1686466093 ~a$r_buff0_thd3~0_In1686466093) (= ~x~0_Out1686466093 ~__unbuffered_p0_EAX~0_Out1686466093) (= 1 ~a$r_buff0_thd1~0_Out1686466093) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1686466093 0))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1686466093, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1686466093, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1686466093, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1686466093, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1686466093, ~y~0=~y~0_In1686466093} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1686466093, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1686466093, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1686466093, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1686466093, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1686466093, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1686466093, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1686466093, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1686466093, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1686466093, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1686466093, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1686466093, ~y~0=~y~0_In1686466093, ~x~0=~x~0_Out1686466093} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 16:29:42,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-433959418 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-433959418 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-433959418 |P0Thread1of1ForFork1_#t~ite5_Out-433959418|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-433959418| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-433959418, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-433959418} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-433959418|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-433959418, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-433959418} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:29:42,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-116566015 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-116566015 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-116566015 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-116566015 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-116566015|)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-116566015 |P0Thread1of1ForFork1_#t~ite6_Out-116566015|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-116566015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-116566015, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-116566015, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-116566015} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-116566015|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-116566015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-116566015, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-116566015, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-116566015} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:29:42,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In2064551679 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In2064551679 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out2064551679| ~a$w_buff1~0_In2064551679) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out2064551679| ~a~0_In2064551679)))) InVars {~a~0=~a~0_In2064551679, ~a$w_buff1~0=~a$w_buff1~0_In2064551679, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2064551679, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2064551679} OutVars{~a~0=~a~0_In2064551679, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2064551679|, ~a$w_buff1~0=~a$w_buff1~0_In2064551679, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2064551679, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2064551679} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:29:42,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:29:42,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1560481598 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1560481598 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1560481598 ~a$r_buff0_thd1~0_In1560481598)) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out1560481598 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1560481598, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1560481598} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1560481598|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1560481598, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1560481598} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:29:42,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1707073136 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1707073136 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1707073136 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1707073136 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1707073136| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1707073136| ~a$r_buff1_thd1~0_In-1707073136)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1707073136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1707073136, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1707073136, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1707073136} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1707073136|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1707073136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1707073136, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1707073136, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1707073136} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:29:42,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:29:42,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1229630880 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1229630880 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1229630880| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1229630880| ~a$w_buff0_used~0_In1229630880)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1229630880, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1229630880} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1229630880, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1229630880, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1229630880|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:29:42,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In554490540 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out554490540| |P2Thread1of1ForFork0_#t~ite21_Out554490540|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In554490540 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In554490540 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In554490540 256)) .cse1) (= (mod ~a$w_buff0_used~0_In554490540 256) 0))) (= |P2Thread1of1ForFork0_#t~ite20_Out554490540| ~a$w_buff0~0_In554490540)) (and (= |P2Thread1of1ForFork0_#t~ite20_In554490540| |P2Thread1of1ForFork0_#t~ite20_Out554490540|) (not .cse0) (= ~a$w_buff0~0_In554490540 |P2Thread1of1ForFork0_#t~ite21_Out554490540|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In554490540, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In554490540, ~a$w_buff0_used~0=~a$w_buff0_used~0_In554490540, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In554490540, ~a$w_buff1_used~0=~a$w_buff1_used~0_In554490540, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In554490540|, ~weak$$choice2~0=~weak$$choice2~0_In554490540} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out554490540|, ~a$w_buff0~0=~a$w_buff0~0_In554490540, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In554490540, ~a$w_buff0_used~0=~a$w_buff0_used~0_In554490540, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In554490540, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out554490540|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In554490540, ~weak$$choice2~0=~weak$$choice2~0_In554490540} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:29:42,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1834083004 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1834083004 256)))) (or (and (= (mod ~a$w_buff1_used~0_In1834083004 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In1834083004 256) 0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In1834083004 256) 0)))) .cse1 (= ~a$w_buff1~0_In1834083004 |P2Thread1of1ForFork0_#t~ite23_Out1834083004|) (= |P2Thread1of1ForFork0_#t~ite24_Out1834083004| |P2Thread1of1ForFork0_#t~ite23_Out1834083004|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1834083004| |P2Thread1of1ForFork0_#t~ite23_Out1834083004|) (= ~a$w_buff1~0_In1834083004 |P2Thread1of1ForFork0_#t~ite24_Out1834083004|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1834083004, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1834083004|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1834083004, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1834083004, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1834083004, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1834083004, ~weak$$choice2~0=~weak$$choice2~0_In1834083004} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1834083004, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1834083004|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1834083004|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1834083004, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1834083004, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1834083004, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1834083004, ~weak$$choice2~0=~weak$$choice2~0_In1834083004} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 16:29:42,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1074347599 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-1074347599| |P2Thread1of1ForFork0_#t~ite26_Out-1074347599|) (= ~a$w_buff0_used~0_In-1074347599 |P2Thread1of1ForFork0_#t~ite27_Out-1074347599|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1074347599 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1074347599 256) 0) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In-1074347599 256)) .cse1) (= (mod ~a$w_buff0_used~0_In-1074347599 256) 0))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1074347599| |P2Thread1of1ForFork0_#t~ite26_Out-1074347599|) (= ~a$w_buff0_used~0_In-1074347599 |P2Thread1of1ForFork0_#t~ite26_Out-1074347599|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1074347599|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1074347599, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1074347599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1074347599, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1074347599, ~weak$$choice2~0=~weak$$choice2~0_In-1074347599} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1074347599|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1074347599|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1074347599, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1074347599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1074347599, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1074347599, ~weak$$choice2~0=~weak$$choice2~0_In-1074347599} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 16:29:42,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:29:42,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 16:29:42,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1749049955 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1749049955 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1749049955| ~a~0_In-1749049955) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1749049955| ~a$w_buff1~0_In-1749049955) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-1749049955, ~a$w_buff1~0=~a$w_buff1~0_In-1749049955, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1749049955, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1749049955} OutVars{~a~0=~a~0_In-1749049955, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1749049955|, ~a$w_buff1~0=~a$w_buff1~0_In-1749049955, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1749049955, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1749049955} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:29:42,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:29:42,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In8749647 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In8749647 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out8749647|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In8749647 |P2Thread1of1ForFork0_#t~ite40_Out8749647|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In8749647, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In8749647} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out8749647|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In8749647, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In8749647} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:29:42,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In383746843 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In383746843 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In383746843 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In383746843 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In383746843 |P2Thread1of1ForFork0_#t~ite41_Out383746843|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out383746843|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In383746843, ~a$w_buff0_used~0=~a$w_buff0_used~0_In383746843, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In383746843, ~a$w_buff1_used~0=~a$w_buff1_used~0_In383746843} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In383746843, ~a$w_buff0_used~0=~a$w_buff0_used~0_In383746843, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In383746843, ~a$w_buff1_used~0=~a$w_buff1_used~0_In383746843, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out383746843|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:29:42,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-471013230 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-471013230 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-471013230| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-471013230| ~a$r_buff0_thd3~0_In-471013230)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-471013230, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-471013230} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-471013230, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-471013230, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-471013230|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:29:42,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1601273386 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1601273386 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1601273386 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1601273386 256)))) (or (and (= ~a$r_buff1_thd3~0_In-1601273386 |P2Thread1of1ForFork0_#t~ite43_Out-1601273386|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1601273386|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1601273386, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1601273386, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1601273386, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1601273386} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1601273386|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1601273386, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1601273386, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1601273386, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1601273386} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:29:42,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In925027491 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In925027491 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In925027491 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In925027491 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In925027491 |P1Thread1of1ForFork2_#t~ite12_Out925027491|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out925027491|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In925027491, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In925027491, ~a$w_buff0_used~0=~a$w_buff0_used~0_In925027491, ~a$w_buff1_used~0=~a$w_buff1_used~0_In925027491} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In925027491, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In925027491, ~a$w_buff0_used~0=~a$w_buff0_used~0_In925027491, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out925027491|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In925027491} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:29:42,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1647012315 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1647012315 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1647012315|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1647012315 |P1Thread1of1ForFork2_#t~ite13_Out1647012315|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1647012315, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1647012315} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1647012315, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1647012315, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1647012315|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:29:42,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1540596574 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1540596574 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1540596574 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1540596574 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1540596574| ~a$r_buff1_thd2~0_In-1540596574) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1540596574|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1540596574, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1540596574, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540596574, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540596574} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1540596574, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1540596574, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540596574, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540596574, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1540596574|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:29:42,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:29:42,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:29:42,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:29:42,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-968650927 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-968650927 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In-968650927 |ULTIMATE.start_main_#t~ite47_Out-968650927|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-968650927| ~a~0_In-968650927) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-968650927, ~a$w_buff1~0=~a$w_buff1~0_In-968650927, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-968650927, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-968650927} OutVars{~a~0=~a~0_In-968650927, ~a$w_buff1~0=~a$w_buff1~0_In-968650927, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-968650927|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-968650927, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-968650927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:29:42,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:29:42,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1916197010 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1916197010 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1916197010| ~a$w_buff0_used~0_In1916197010) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1916197010| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1916197010, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1916197010} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1916197010, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1916197010|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1916197010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:29:42,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In750914899 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In750914899 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In750914899 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In750914899 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out750914899| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out750914899| ~a$w_buff1_used~0_In750914899) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In750914899, ~a$w_buff0_used~0=~a$w_buff0_used~0_In750914899, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In750914899, ~a$w_buff1_used~0=~a$w_buff1_used~0_In750914899} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out750914899|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In750914899, ~a$w_buff0_used~0=~a$w_buff0_used~0_In750914899, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In750914899, ~a$w_buff1_used~0=~a$w_buff1_used~0_In750914899} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:29:42,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In887216158 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In887216158 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out887216158| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out887216158| ~a$r_buff0_thd0~0_In887216158)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In887216158, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In887216158} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out887216158|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In887216158, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In887216158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:29:42,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-2063588253 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-2063588253 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-2063588253 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2063588253 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-2063588253| ~a$r_buff1_thd0~0_In-2063588253) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out-2063588253| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2063588253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2063588253, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2063588253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2063588253} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2063588253|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2063588253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2063588253, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2063588253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2063588253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:29:42,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:29:42,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:29:42 BasicIcfg [2019-12-18 16:29:42,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:29:42,247 INFO L168 Benchmark]: Toolchain (without parser) took 102718.78 ms. Allocated memory was 143.1 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,248 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.46 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 152.6 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.55 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,249 INFO L168 Benchmark]: Boogie Preprocessor took 39.60 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,250 INFO L168 Benchmark]: RCFGBuilder took 927.42 ms. Allocated memory is still 201.3 MB. Free memory was 147.4 MB in the beginning and 96.4 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,250 INFO L168 Benchmark]: TraceAbstraction took 100816.79 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 95.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 16:29:42,252 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.46 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 152.6 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.55 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.60 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 927.42 ms. Allocated memory is still 201.3 MB. Free memory was 147.4 MB in the beginning and 96.4 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100816.79 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 95.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 100.4s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 37.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7733 SDtfs, 10873 SDslu, 25467 SDs, 0 SdLazy, 17190 SolverSat, 573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 64 SyntacticMatches, 21 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 215205 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1644 NumberOfCodeBlocks, 1644 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1542 ConstructedInterpolants, 0 QuantifiedInterpolants, 333847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...