/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:31:45,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:31:45,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:31:45,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:31:45,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:31:45,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:31:45,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:31:45,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:31:45,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:31:45,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:31:45,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:31:45,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:31:45,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:31:45,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:31:45,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:31:45,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:31:45,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:31:45,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:31:45,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:31:45,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:31:45,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:31:45,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:31:45,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:31:45,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:31:45,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:31:45,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:31:45,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:31:45,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:31:45,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:31:45,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:31:45,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:31:45,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:31:45,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:31:45,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:31:45,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:31:45,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:31:45,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:31:45,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:31:45,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:31:45,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:31:45,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:31:45,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:31:45,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:31:45,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:31:45,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:31:45,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:31:45,370 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:31:45,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:31:45,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:31:45,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:31:45,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:31:45,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:31:45,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:31:45,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:31:45,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:31:45,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:31:45,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:31:45,373 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:31:45,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:31:45,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:31:45,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:31:45,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:31:45,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:31:45,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:31:45,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:31:45,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:31:45,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:31:45,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:31:45,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:31:45,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:31:45,375 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:31:45,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:31:45,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:31:45,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:31:45,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:31:45,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:31:45,710 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:31:45,711 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 12:31:45,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22321befa/b8acb3fa5fa3476f9a317d318c116d82/FLAG1824401a8 [2019-12-18 12:31:46,343 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:31:46,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-18 12:31:46,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22321befa/b8acb3fa5fa3476f9a317d318c116d82/FLAG1824401a8 [2019-12-18 12:31:46,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22321befa/b8acb3fa5fa3476f9a317d318c116d82 [2019-12-18 12:31:46,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:31:46,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:31:46,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:31:46,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:31:46,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:31:46,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:31:46" (1/1) ... [2019-12-18 12:31:46,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:46, skipping insertion in model container [2019-12-18 12:31:46,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:31:46" (1/1) ... [2019-12-18 12:31:46,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:31:46,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:31:47,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:31:47,276 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:31:47,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:31:47,440 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:31:47,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47 WrapperNode [2019-12-18 12:31:47,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:31:47,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:31:47,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:31:47,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:31:47,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:31:47,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:31:47,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:31:47,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:31:47,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... [2019-12-18 12:31:47,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:31:47,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:31:47,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:31:47,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:31:47,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:31:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:31:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:31:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:31:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:31:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:31:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:31:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:31:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:31:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:31:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:31:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:31:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:31:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:31:47,622 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:31:48,635 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:31:48,635 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:31:48,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:48 BoogieIcfgContainer [2019-12-18 12:31:48,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:31:48,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:31:48,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:31:48,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:31:48,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:31:46" (1/3) ... [2019-12-18 12:31:48,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d8bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:31:48, skipping insertion in model container [2019-12-18 12:31:48,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:47" (2/3) ... [2019-12-18 12:31:48,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d8bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:31:48, skipping insertion in model container [2019-12-18 12:31:48,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:48" (3/3) ... [2019-12-18 12:31:48,646 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_power.oepc.i [2019-12-18 12:31:48,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:31:48,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:31:48,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:31:48,666 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:31:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,719 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,719 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,746 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,746 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,775 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,777 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:31:48,807 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:31:48,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:31:48,829 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:31:48,829 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:31:48,829 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:31:48,829 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:31:48,829 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:31:48,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:31:48,829 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:31:48,847 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:31:48,849 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:31:48,960 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:31:48,960 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:31:48,984 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 12:31:49,011 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:31:49,077 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:31:49,078 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:31:49,088 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 12:31:49,110 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:31:49,111 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:31:53,731 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-18 12:31:54,471 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:31:54,625 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:31:54,776 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-18 12:31:54,776 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:31:54,780 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-18 12:32:13,285 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-18 12:32:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-18 12:32:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:32:13,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:13,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:32:13,294 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 12:32:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-18 12:32:13,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:13,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165907860] [2019-12-18 12:32:13,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:13,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165907860] [2019-12-18 12:32:13,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:13,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:32:13,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037950095] [2019-12-18 12:32:13,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:32:13,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:13,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:32:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:13,547 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-18 12:32:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:14,580 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-18 12:32:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:32:14,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:32:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:18,360 INFO L225 Difference]: With dead ends: 116858 [2019-12-18 12:32:18,361 INFO L226 Difference]: Without dead ends: 110138 [2019-12-18 12:32:18,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-18 12:32:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-18 12:32:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-18 12:32:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-18 12:32:30,395 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-18 12:32:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:30,396 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-18 12:32:30,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:32:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-18 12:32:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:32:30,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:30,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:32:30,400 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 12:32:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-18 12:32:30,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:30,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817243977] [2019-12-18 12:32:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:30,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817243977] [2019-12-18 12:32:30,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:30,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:32:30,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612237211] [2019-12-18 12:32:30,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:32:30,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:32:30,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:32:30,545 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-18 12:32:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:31,695 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-18 12:32:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:32:31,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:32:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:32,283 INFO L225 Difference]: With dead ends: 170904 [2019-12-18 12:32:32,284 INFO L226 Difference]: Without dead ends: 170855 [2019-12-18 12:32:32,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:32:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-18 12:32:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-18 12:32:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-18 12:32:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-18 12:32:45,441 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-18 12:32:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:45,441 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-18 12:32:45,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:32:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-18 12:32:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:32:45,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:45,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:32:45,449 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 12:32:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-18 12:32:45,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:45,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403454186] [2019-12-18 12:32:45,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:45,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403454186] [2019-12-18 12:32:45,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:45,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:32:45,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683960579] [2019-12-18 12:32:45,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:32:45,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:32:45,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:45,525 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-18 12:32:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:45,658 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-18 12:32:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:32:45,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:32:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:45,716 INFO L225 Difference]: With dead ends: 33673 [2019-12-18 12:32:45,716 INFO L226 Difference]: Without dead ends: 33673 [2019-12-18 12:32:45,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-18 12:32:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-18 12:32:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-18 12:32:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-18 12:32:51,207 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-18 12:32:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:51,207 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-18 12:32:51,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:32:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-18 12:32:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:32:51,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:51,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:32:51,211 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 12:32:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-18 12:32:51,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:51,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256264194] [2019-12-18 12:32:51,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256264194] [2019-12-18 12:32:51,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:32:51,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596977465] [2019-12-18 12:32:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:32:51,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:32:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:32:51,289 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-18 12:32:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:51,668 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-18 12:32:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:32:51,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:32:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:51,738 INFO L225 Difference]: With dead ends: 42056 [2019-12-18 12:32:51,738 INFO L226 Difference]: Without dead ends: 42056 [2019-12-18 12:32:51,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:32:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-18 12:32:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-18 12:32:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-18 12:32:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-18 12:32:52,851 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-18 12:32:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:52,851 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-18 12:32:52,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:32:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-18 12:32:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:32:52,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:52,860 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 12:32:52,860 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 12:32:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-18 12:32:52,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:52,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230905188] [2019-12-18 12:32:52,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:52,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230905188] [2019-12-18 12:32:52,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:52,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:32:52,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807586453] [2019-12-18 12:32:52,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:32:52,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:32:52,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:32:52,976 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-18 12:32:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:53,572 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-18 12:32:53,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:32:53,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:32:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:53,651 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 12:32:53,652 INFO L226 Difference]: Without dead ends: 48530 [2019-12-18 12:32:53,652 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 12:32:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-18 12:32:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-18 12:32:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-18 12:32:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-18 12:32:54,370 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-18 12:32:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:54,370 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-18 12:32:54,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:32:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-18 12:32:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:32:54,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:54,383 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 12:32:54,384 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 12:32:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-18 12:32:54,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:54,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602227342] [2019-12-18 12:32:54,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:54,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602227342] [2019-12-18 12:32:54,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:54,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:32:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447467966] [2019-12-18 12:32:54,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:32:54,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:32:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:32:54,445 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-18 12:32:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:54,507 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-18 12:32:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:32:54,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:32:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:54,531 INFO L225 Difference]: With dead ends: 14576 [2019-12-18 12:32:54,531 INFO L226 Difference]: Without dead ends: 14576 [2019-12-18 12:32:54,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:32:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-18 12:32:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-18 12:32:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-18 12:32:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-18 12:32:55,069 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-18 12:32:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:55,070 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-18 12:32:55,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:32:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-18 12:32:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:32:55,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:55,080 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 12:32:55,080 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 12:32:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-18 12:32:55,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:55,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080781983] [2019-12-18 12:32:55,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:55,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080781983] [2019-12-18 12:32:55,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:55,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:32:55,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072450290] [2019-12-18 12:32:55,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:32:55,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:32:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:55,130 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-18 12:32:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:55,230 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-18 12:32:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:32:55,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:32:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:55,260 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:32:55,261 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:32:55,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:32:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:32:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:32:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-18 12:32:55,550 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-18 12:32:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:55,551 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-18 12:32:55,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:32:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-18 12:32:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:32:55,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:55,563 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 12:32:55,563 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 12:32:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-18 12:32:55,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:55,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090322814] [2019-12-18 12:32:55,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:55,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090322814] [2019-12-18 12:32:55,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:55,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:32:55,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041365311] [2019-12-18 12:32:55,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:32:55,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:55,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:32:55,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:55,611 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-18 12:32:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:55,719 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-18 12:32:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:32:55,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:32:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:55,748 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:32:55,748 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:32:55,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:32:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:32:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:32:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-18 12:32:56,021 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-18 12:32:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:56,021 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-18 12:32:56,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:32:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-18 12:32:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:32:56,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:56,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] [2019-12-18 12:32:56,034 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 12:32:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:56,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-18 12:32:56,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:56,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389280133] [2019-12-18 12:32:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:56,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389280133] [2019-12-18 12:32:56,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:56,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:32:56,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93786241] [2019-12-18 12:32:56,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:32:56,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:32:56,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:32:56,124 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-18 12:32:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:56,701 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-18 12:32:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:32:56,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:32:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:56,753 INFO L225 Difference]: With dead ends: 31275 [2019-12-18 12:32:56,753 INFO L226 Difference]: Without dead ends: 31275 [2019-12-18 12:32:56,754 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 12:32:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-18 12:32:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-18 12:32:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-18 12:32:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-18 12:32:57,120 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-18 12:32:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:57,121 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-18 12:32:57,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:32:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-18 12:32:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:32:57,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:57,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:32:57,418 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 12:32:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-18 12:32:57,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:57,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276756866] [2019-12-18 12:32:57,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:57,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276756866] [2019-12-18 12:32:57,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:57,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:32:57,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963869285] [2019-12-18 12:32:57,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:32:57,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:32:57,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:32:57,507 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-18 12:32:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:58,158 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-18 12:32:58,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:32:58,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:32:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:58,203 INFO L225 Difference]: With dead ends: 30618 [2019-12-18 12:32:58,203 INFO L226 Difference]: Without dead ends: 30618 [2019-12-18 12:32:58,204 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 12:32:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-18 12:32:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-18 12:32:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-18 12:32:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-18 12:32:58,577 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-18 12:32:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:58,578 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-18 12:32:58,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:32:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-18 12:32:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:32:58,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:58,598 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 12:32:58,599 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 12:32:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-18 12:32:58,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:58,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131631011] [2019-12-18 12:32:58,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:58,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131631011] [2019-12-18 12:32:58,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:58,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:32:58,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133490571] [2019-12-18 12:32:58,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:32:58,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:32:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:32:58,676 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-18 12:32:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:59,183 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-18 12:32:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:32:59,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:32:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:59,228 INFO L225 Difference]: With dead ends: 23829 [2019-12-18 12:32:59,229 INFO L226 Difference]: Without dead ends: 23829 [2019-12-18 12:32:59,229 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 12:32:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-18 12:32:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-18 12:32:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-18 12:32:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-18 12:32:59,591 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-18 12:32:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:59,591 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-18 12:32:59,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:32:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-18 12:32:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:32:59,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:59,614 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 12:32:59,615 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 12:32:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-18 12:32:59,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:59,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859453757] [2019-12-18 12:32:59,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:32:59,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859453757] [2019-12-18 12:32:59,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:59,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:32:59,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831423826] [2019-12-18 12:32:59,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:32:59,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:59,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:32:59,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:32:59,749 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-18 12:33:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:01,158 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-18 12:33:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:33:01,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:33:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:01,504 INFO L225 Difference]: With dead ends: 39715 [2019-12-18 12:33:01,504 INFO L226 Difference]: Without dead ends: 39715 [2019-12-18 12:33:01,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:33:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-18 12:33:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-18 12:33:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-18 12:33:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-18 12:33:01,913 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-18 12:33:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:01,913 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-18 12:33:01,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-18 12:33:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:33:01,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:01,932 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 12:33:01,932 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 12:33:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-18 12:33:01,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:01,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068478372] [2019-12-18 12:33:01,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:02,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068478372] [2019-12-18 12:33:02,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:02,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:02,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905994303] [2019-12-18 12:33:02,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:33:02,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:02,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:33:02,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:33:02,059 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 8 states. [2019-12-18 12:33:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:03,762 INFO L93 Difference]: Finished difference Result 46968 states and 136953 transitions. [2019-12-18 12:33:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:33:03,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:33:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:03,825 INFO L225 Difference]: With dead ends: 46968 [2019-12-18 12:33:03,826 INFO L226 Difference]: Without dead ends: 46968 [2019-12-18 12:33:03,826 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 12:33:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46968 states. [2019-12-18 12:33:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46968 to 20735. [2019-12-18 12:33:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 12:33:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61975 transitions. [2019-12-18 12:33:04,301 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61975 transitions. Word has length 33 [2019-12-18 12:33:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:04,301 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61975 transitions. [2019-12-18 12:33:04,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:33:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61975 transitions. [2019-12-18 12:33:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:33:04,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:04,320 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 12:33:04,321 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 12:33:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-18 12:33:04,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:04,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308662807] [2019-12-18 12:33:04,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:04,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308662807] [2019-12-18 12:33:04,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:04,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:33:04,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928397282] [2019-12-18 12:33:04,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:04,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:04,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:04,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:04,426 INFO L87 Difference]: Start difference. First operand 20735 states and 61975 transitions. Second operand 7 states. [2019-12-18 12:33:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:05,998 INFO L93 Difference]: Finished difference Result 36504 states and 106979 transitions. [2019-12-18 12:33:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:33:05,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:33:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:06,048 INFO L225 Difference]: With dead ends: 36504 [2019-12-18 12:33:06,048 INFO L226 Difference]: Without dead ends: 36504 [2019-12-18 12:33:06,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:33:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36504 states. [2019-12-18 12:33:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36504 to 19450. [2019-12-18 12:33:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-12-18 12:33:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 58223 transitions. [2019-12-18 12:33:06,442 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 58223 transitions. Word has length 34 [2019-12-18 12:33:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:06,442 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 58223 transitions. [2019-12-18 12:33:06,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 58223 transitions. [2019-12-18 12:33:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:33:06,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:06,461 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 12:33:06,462 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 12:33:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-18 12:33:06,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:06,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568929267] [2019-12-18 12:33:06,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:06,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568929267] [2019-12-18 12:33:06,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:06,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:06,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577564497] [2019-12-18 12:33:06,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:33:06,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:33:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:33:06,568 INFO L87 Difference]: Start difference. First operand 19450 states and 58223 transitions. Second operand 8 states. [2019-12-18 12:33:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:08,212 INFO L93 Difference]: Finished difference Result 41529 states and 120361 transitions. [2019-12-18 12:33:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:33:08,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:33:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:08,298 INFO L225 Difference]: With dead ends: 41529 [2019-12-18 12:33:08,298 INFO L226 Difference]: Without dead ends: 41529 [2019-12-18 12:33:08,301 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 12:33:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41529 states. [2019-12-18 12:33:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41529 to 17750. [2019-12-18 12:33:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-18 12:33:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 53183 transitions. [2019-12-18 12:33:08,826 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 53183 transitions. Word has length 34 [2019-12-18 12:33:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:08,826 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 53183 transitions. [2019-12-18 12:33:08,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:33:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 53183 transitions. [2019-12-18 12:33:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:33:08,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:08,850 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 12:33:08,850 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 12:33:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-18 12:33:08,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:08,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860061129] [2019-12-18 12:33:08,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:08,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860061129] [2019-12-18 12:33:08,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:08,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:08,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041959646] [2019-12-18 12:33:08,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:08,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:08,901 INFO L87 Difference]: Start difference. First operand 17750 states and 53183 transitions. Second operand 4 states. [2019-12-18 12:33:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:09,002 INFO L93 Difference]: Finished difference Result 30219 states and 90879 transitions. [2019-12-18 12:33:09,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:09,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 12:33:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:09,023 INFO L225 Difference]: With dead ends: 30219 [2019-12-18 12:33:09,023 INFO L226 Difference]: Without dead ends: 15274 [2019-12-18 12:33:09,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-18 12:33:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15208. [2019-12-18 12:33:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-18 12:33:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44774 transitions. [2019-12-18 12:33:09,496 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44774 transitions. Word has length 39 [2019-12-18 12:33:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:09,496 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44774 transitions. [2019-12-18 12:33:09,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44774 transitions. [2019-12-18 12:33:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:33:09,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:09,511 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 12:33:09,511 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 12:33:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-18 12:33:09,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:09,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849208479] [2019-12-18 12:33:09,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:09,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849208479] [2019-12-18 12:33:09,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:09,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:33:09,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125233207] [2019-12-18 12:33:09,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:09,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:09,554 INFO L87 Difference]: Start difference. First operand 15208 states and 44774 transitions. Second operand 3 states. [2019-12-18 12:33:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:09,612 INFO L93 Difference]: Finished difference Result 15207 states and 44772 transitions. [2019-12-18 12:33:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:09,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:33:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:09,638 INFO L225 Difference]: With dead ends: 15207 [2019-12-18 12:33:09,639 INFO L226 Difference]: Without dead ends: 15207 [2019-12-18 12:33:09,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2019-12-18 12:33:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 15207. [2019-12-18 12:33:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15207 states. [2019-12-18 12:33:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 44772 transitions. [2019-12-18 12:33:09,858 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 44772 transitions. Word has length 39 [2019-12-18 12:33:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:09,858 INFO L462 AbstractCegarLoop]: Abstraction has 15207 states and 44772 transitions. [2019-12-18 12:33:09,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 44772 transitions. [2019-12-18 12:33:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:33:09,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:09,872 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 12:33:09,872 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 12:33:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-18 12:33:09,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:09,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856075629] [2019-12-18 12:33:09,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856075629] [2019-12-18 12:33:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:09,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464190570] [2019-12-18 12:33:09,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:09,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:09,924 INFO L87 Difference]: Start difference. First operand 15207 states and 44772 transitions. Second operand 4 states. [2019-12-18 12:33:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:10,051 INFO L93 Difference]: Finished difference Result 24324 states and 71986 transitions. [2019-12-18 12:33:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:10,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:33:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:10,076 INFO L225 Difference]: With dead ends: 24324 [2019-12-18 12:33:10,076 INFO L226 Difference]: Without dead ends: 11139 [2019-12-18 12:33:10,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11139 states. [2019-12-18 12:33:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11139 to 11082. [2019-12-18 12:33:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-12-18 12:33:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 31786 transitions. [2019-12-18 12:33:10,303 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 31786 transitions. Word has length 40 [2019-12-18 12:33:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:10,303 INFO L462 AbstractCegarLoop]: Abstraction has 11082 states and 31786 transitions. [2019-12-18 12:33:10,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 31786 transitions. [2019-12-18 12:33:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:33:10,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:10,317 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 12:33:10,317 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 12:33:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-18 12:33:10,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:10,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224202426] [2019-12-18 12:33:10,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:10,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224202426] [2019-12-18 12:33:10,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:10,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:33:10,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467855123] [2019-12-18 12:33:10,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:33:10,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:33:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:10,376 INFO L87 Difference]: Start difference. First operand 11082 states and 31786 transitions. Second operand 5 states. [2019-12-18 12:33:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:10,435 INFO L93 Difference]: Finished difference Result 10120 states and 29645 transitions. [2019-12-18 12:33:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:33:10,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:33:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:10,448 INFO L225 Difference]: With dead ends: 10120 [2019-12-18 12:33:10,448 INFO L226 Difference]: Without dead ends: 7230 [2019-12-18 12:33:10,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-18 12:33:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-18 12:33:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-18 12:33:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-18 12:33:10,566 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-18 12:33:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:10,566 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-18 12:33:10,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:33:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-18 12:33:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:33:10,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:10,574 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 12:33:10,574 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 12:33:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-18 12:33:10,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:10,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78131921] [2019-12-18 12:33:10,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:10,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78131921] [2019-12-18 12:33:10,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:10,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:10,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119835398] [2019-12-18 12:33:10,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:10,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:10,659 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-18 12:33:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:10,917 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-18 12:33:10,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:33:10,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:33:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:10,934 INFO L225 Difference]: With dead ends: 14425 [2019-12-18 12:33:10,934 INFO L226 Difference]: Without dead ends: 10624 [2019-12-18 12:33:10,934 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 12:33:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-18 12:33:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-18 12:33:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-18 12:33:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-18 12:33:11,087 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-18 12:33:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:11,087 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-18 12:33:11,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-18 12:33:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:33:11,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:11,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 12:33:11,097 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 12:33:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-18 12:33:11,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:11,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063492459] [2019-12-18 12:33:11,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:11,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063492459] [2019-12-18 12:33:11,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:11,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:11,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673238656] [2019-12-18 12:33:11,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:11,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:11,181 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-18 12:33:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:11,475 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-18 12:33:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:33:11,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:33:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:11,496 INFO L225 Difference]: With dead ends: 16977 [2019-12-18 12:33:11,497 INFO L226 Difference]: Without dead ends: 12608 [2019-12-18 12:33:11,497 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 12:33:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-18 12:33:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-18 12:33:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-18 12:33:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-18 12:33:11,676 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-18 12:33:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:11,676 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-18 12:33:11,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-18 12:33:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:33:11,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:11,688 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 12:33:11,688 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 12:33:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-18 12:33:11,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:11,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637236014] [2019-12-18 12:33:11,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:11,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637236014] [2019-12-18 12:33:11,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:11,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:11,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429044033] [2019-12-18 12:33:11,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:11,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:11,803 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-18 12:33:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:12,976 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-18 12:33:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:33:12,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:33:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:13,016 INFO L225 Difference]: With dead ends: 29742 [2019-12-18 12:33:13,016 INFO L226 Difference]: Without dead ends: 27534 [2019-12-18 12:33:13,017 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 12:33:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-18 12:33:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-18 12:33:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-18 12:33:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-18 12:33:13,301 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-18 12:33:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:13,301 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-18 12:33:13,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-18 12:33:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:33:13,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:13,313 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 12:33:13,313 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 12:33:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:13,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-18 12:33:13,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:13,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292219309] [2019-12-18 12:33:13,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:13,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292219309] [2019-12-18 12:33:13,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:13,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:13,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44019879] [2019-12-18 12:33:13,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:13,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:13,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:13,418 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-18 12:33:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:14,366 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-18 12:33:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:33:14,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:33:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:14,398 INFO L225 Difference]: With dead ends: 23762 [2019-12-18 12:33:14,398 INFO L226 Difference]: Without dead ends: 22008 [2019-12-18 12:33:14,399 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 12:33:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-18 12:33:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-18 12:33:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-18 12:33:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-18 12:33:14,636 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-18 12:33:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:14,637 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-18 12:33:14,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-18 12:33:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:33:14,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:14,649 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 12:33:14,649 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 12:33:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-18 12:33:14,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:14,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864214192] [2019-12-18 12:33:14,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:14,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864214192] [2019-12-18 12:33:14,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:14,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:14,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675585160] [2019-12-18 12:33:14,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:14,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:14,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:14,747 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-18 12:33:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:14,788 INFO L93 Difference]: Finished difference Result 8225 states and 25321 transitions. [2019-12-18 12:33:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:14,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:33:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:14,802 INFO L225 Difference]: With dead ends: 8225 [2019-12-18 12:33:14,803 INFO L226 Difference]: Without dead ends: 8225 [2019-12-18 12:33:14,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2019-12-18 12:33:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 8225. [2019-12-18 12:33:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8225 states. [2019-12-18 12:33:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 25321 transitions. [2019-12-18 12:33:14,985 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 25321 transitions. Word has length 64 [2019-12-18 12:33:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:14,986 INFO L462 AbstractCegarLoop]: Abstraction has 8225 states and 25321 transitions. [2019-12-18 12:33:14,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 25321 transitions. [2019-12-18 12:33:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:33:14,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:14,994 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 12:33:14,994 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 12:33:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash 415532239, now seen corresponding path program 1 times [2019-12-18 12:33:14,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:14,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067816762] [2019-12-18 12:33:14,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:15,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067816762] [2019-12-18 12:33:15,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:15,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:15,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628814907] [2019-12-18 12:33:15,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:15,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:15,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:15,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:15,044 INFO L87 Difference]: Start difference. First operand 8225 states and 25321 transitions. Second operand 3 states. [2019-12-18 12:33:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:15,122 INFO L93 Difference]: Finished difference Result 9677 states and 29688 transitions. [2019-12-18 12:33:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:15,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:33:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:15,139 INFO L225 Difference]: With dead ends: 9677 [2019-12-18 12:33:15,139 INFO L226 Difference]: Without dead ends: 9677 [2019-12-18 12:33:15,140 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 12:33:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-12-18 12:33:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8621. [2019-12-18 12:33:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8621 states. [2019-12-18 12:33:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8621 states to 8621 states and 26608 transitions. [2019-12-18 12:33:15,362 INFO L78 Accepts]: Start accepts. Automaton has 8621 states and 26608 transitions. Word has length 65 [2019-12-18 12:33:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:15,363 INFO L462 AbstractCegarLoop]: Abstraction has 8621 states and 26608 transitions. [2019-12-18 12:33:15,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8621 states and 26608 transitions. [2019-12-18 12:33:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:15,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:15,379 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 12:33:15,379 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 12:33:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash -436961782, now seen corresponding path program 1 times [2019-12-18 12:33:15,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:15,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498270881] [2019-12-18 12:33:15,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:15,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498270881] [2019-12-18 12:33:15,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:15,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:15,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493228609] [2019-12-18 12:33:15,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:15,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:15,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:15,478 INFO L87 Difference]: Start difference. First operand 8621 states and 26608 transitions. Second operand 4 states. [2019-12-18 12:33:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:15,609 INFO L93 Difference]: Finished difference Result 8489 states and 26091 transitions. [2019-12-18 12:33:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:15,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:33:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:15,628 INFO L225 Difference]: With dead ends: 8489 [2019-12-18 12:33:15,628 INFO L226 Difference]: Without dead ends: 8489 [2019-12-18 12:33:15,629 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 12:33:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8489 states. [2019-12-18 12:33:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8489 to 8093. [2019-12-18 12:33:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8093 states. [2019-12-18 12:33:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8093 states to 8093 states and 24804 transitions. [2019-12-18 12:33:15,897 INFO L78 Accepts]: Start accepts. Automaton has 8093 states and 24804 transitions. Word has length 66 [2019-12-18 12:33:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:15,898 INFO L462 AbstractCegarLoop]: Abstraction has 8093 states and 24804 transitions. [2019-12-18 12:33:15,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8093 states and 24804 transitions. [2019-12-18 12:33:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:15,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:15,915 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 12:33:15,916 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 12:33:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1846241215, now seen corresponding path program 1 times [2019-12-18 12:33:15,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:15,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396899811] [2019-12-18 12:33:15,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:16,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396899811] [2019-12-18 12:33:16,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:16,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:16,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124133316] [2019-12-18 12:33:16,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:16,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:16,039 INFO L87 Difference]: Start difference. First operand 8093 states and 24804 transitions. Second operand 3 states. [2019-12-18 12:33:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:16,258 INFO L93 Difference]: Finished difference Result 8092 states and 24802 transitions. [2019-12-18 12:33:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:16,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:33:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:16,272 INFO L225 Difference]: With dead ends: 8092 [2019-12-18 12:33:16,273 INFO L226 Difference]: Without dead ends: 8092 [2019-12-18 12:33:16,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8092 states. [2019-12-18 12:33:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8092 to 8092. [2019-12-18 12:33:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8092 states. [2019-12-18 12:33:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 24802 transitions. [2019-12-18 12:33:16,450 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 24802 transitions. Word has length 66 [2019-12-18 12:33:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:16,450 INFO L462 AbstractCegarLoop]: Abstraction has 8092 states and 24802 transitions. [2019-12-18 12:33:16,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 24802 transitions. [2019-12-18 12:33:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:16,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:16,458 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 12:33:16,459 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 12:33:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-18 12:33:16,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:16,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707023685] [2019-12-18 12:33:16,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:16,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707023685] [2019-12-18 12:33:16,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:16,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:33:16,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422792314] [2019-12-18 12:33:16,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:16,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:16,579 INFO L87 Difference]: Start difference. First operand 8092 states and 24802 transitions. Second operand 9 states. [2019-12-18 12:33:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:17,651 INFO L93 Difference]: Finished difference Result 16004 states and 48332 transitions. [2019-12-18 12:33:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:33:17,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:33:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:17,669 INFO L225 Difference]: With dead ends: 16004 [2019-12-18 12:33:17,669 INFO L226 Difference]: Without dead ends: 11673 [2019-12-18 12:33:17,670 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 12:33:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11673 states. [2019-12-18 12:33:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11673 to 8750. [2019-12-18 12:33:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-18 12:33:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 26571 transitions. [2019-12-18 12:33:17,820 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 26571 transitions. Word has length 67 [2019-12-18 12:33:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:17,820 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 26571 transitions. [2019-12-18 12:33:17,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 26571 transitions. [2019-12-18 12:33:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:17,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:17,829 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 12:33:17,829 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 12:33:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-18 12:33:17,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:17,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114202402] [2019-12-18 12:33:17,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:17,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114202402] [2019-12-18 12:33:17,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:17,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:17,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59187000] [2019-12-18 12:33:17,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:33:17,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:33:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:33:17,987 INFO L87 Difference]: Start difference. First operand 8750 states and 26571 transitions. Second operand 10 states. [2019-12-18 12:33:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:19,428 INFO L93 Difference]: Finished difference Result 15111 states and 44497 transitions. [2019-12-18 12:33:19,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:33:19,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:33:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:19,446 INFO L225 Difference]: With dead ends: 15111 [2019-12-18 12:33:19,446 INFO L226 Difference]: Without dead ends: 13108 [2019-12-18 12:33:19,447 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 12:33:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2019-12-18 12:33:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 8934. [2019-12-18 12:33:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-18 12:33:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 26943 transitions. [2019-12-18 12:33:19,608 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 26943 transitions. Word has length 67 [2019-12-18 12:33:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:19,608 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 26943 transitions. [2019-12-18 12:33:19,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:33:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 26943 transitions. [2019-12-18 12:33:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:19,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:19,618 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 12:33:19,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1716057561, now seen corresponding path program 3 times [2019-12-18 12:33:19,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:19,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758500182] [2019-12-18 12:33:19,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:19,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758500182] [2019-12-18 12:33:19,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:19,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:33:19,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106991285] [2019-12-18 12:33:19,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:33:19,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:19,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:33:19,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:33:19,795 INFO L87 Difference]: Start difference. First operand 8934 states and 26943 transitions. Second operand 11 states. [2019-12-18 12:33:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:21,517 INFO L93 Difference]: Finished difference Result 14284 states and 41754 transitions. [2019-12-18 12:33:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:33:21,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:33:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:21,536 INFO L225 Difference]: With dead ends: 14284 [2019-12-18 12:33:21,536 INFO L226 Difference]: Without dead ends: 13261 [2019-12-18 12:33:21,537 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 12:33:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2019-12-18 12:33:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 8750. [2019-12-18 12:33:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-18 12:33:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 26453 transitions. [2019-12-18 12:33:21,698 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 26453 transitions. Word has length 67 [2019-12-18 12:33:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:21,698 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 26453 transitions. [2019-12-18 12:33:21,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:33:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 26453 transitions. [2019-12-18 12:33:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:21,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:21,707 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 12:33:21,707 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 12:33:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-18 12:33:21,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:21,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302709967] [2019-12-18 12:33:21,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:22,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302709967] [2019-12-18 12:33:22,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:22,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:33:22,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480196766] [2019-12-18 12:33:22,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:33:22,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:33:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:33:22,154 INFO L87 Difference]: Start difference. First operand 8750 states and 26453 transitions. Second operand 12 states. [2019-12-18 12:33:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:24,316 INFO L93 Difference]: Finished difference Result 17438 states and 51575 transitions. [2019-12-18 12:33:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:33:24,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:33:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:24,335 INFO L225 Difference]: With dead ends: 17438 [2019-12-18 12:33:24,336 INFO L226 Difference]: Without dead ends: 12737 [2019-12-18 12:33:24,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:33:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12737 states. [2019-12-18 12:33:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12737 to 8590. [2019-12-18 12:33:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8590 states. [2019-12-18 12:33:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 25864 transitions. [2019-12-18 12:33:24,502 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 25864 transitions. Word has length 67 [2019-12-18 12:33:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:24,502 INFO L462 AbstractCegarLoop]: Abstraction has 8590 states and 25864 transitions. [2019-12-18 12:33:24,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:33:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 25864 transitions. [2019-12-18 12:33:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:24,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:24,512 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 12:33:24,513 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 12:33:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash 575406353, now seen corresponding path program 5 times [2019-12-18 12:33:24,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:24,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279009650] [2019-12-18 12:33:24,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:24,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279009650] [2019-12-18 12:33:24,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:24,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:33:24,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113107247] [2019-12-18 12:33:24,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:33:24,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:33:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:33:24,821 INFO L87 Difference]: Start difference. First operand 8590 states and 25864 transitions. Second operand 11 states. [2019-12-18 12:33:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:25,946 INFO L93 Difference]: Finished difference Result 14134 states and 41685 transitions. [2019-12-18 12:33:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:33:25,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:33:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:25,972 INFO L225 Difference]: With dead ends: 14134 [2019-12-18 12:33:25,972 INFO L226 Difference]: Without dead ends: 11211 [2019-12-18 12:33:25,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:33:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11211 states. [2019-12-18 12:33:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11211 to 8276. [2019-12-18 12:33:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2019-12-18 12:33:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 24994 transitions. [2019-12-18 12:33:26,262 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 24994 transitions. Word has length 67 [2019-12-18 12:33:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:26,263 INFO L462 AbstractCegarLoop]: Abstraction has 8276 states and 24994 transitions. [2019-12-18 12:33:26,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:33:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 24994 transitions. [2019-12-18 12:33:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:26,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:26,280 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 12:33:26,280 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 12:33:26,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:26,281 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 6 times [2019-12-18 12:33:26,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:26,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659235327] [2019-12-18 12:33:26,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:26,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659235327] [2019-12-18 12:33:26,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:26,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:26,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673240229] [2019-12-18 12:33:26,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:33:26,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:33:26,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:33:26,444 INFO L87 Difference]: Start difference. First operand 8276 states and 24994 transitions. Second operand 10 states. [2019-12-18 12:33:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:27,565 INFO L93 Difference]: Finished difference Result 10920 states and 32038 transitions. [2019-12-18 12:33:27,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:33:27,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:33:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:27,584 INFO L225 Difference]: With dead ends: 10920 [2019-12-18 12:33:27,584 INFO L226 Difference]: Without dead ends: 10445 [2019-12-18 12:33:27,584 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 12:33:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2019-12-18 12:33:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 8116. [2019-12-18 12:33:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2019-12-18 12:33:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 24515 transitions. [2019-12-18 12:33:27,722 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 24515 transitions. Word has length 67 [2019-12-18 12:33:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:27,723 INFO L462 AbstractCegarLoop]: Abstraction has 8116 states and 24515 transitions. [2019-12-18 12:33:27,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:33:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 24515 transitions. [2019-12-18 12:33:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:27,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:27,731 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 12:33:27,731 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 12:33:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 7 times [2019-12-18 12:33:27,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447927226] [2019-12-18 12:33:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:27,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447927226] [2019-12-18 12:33:27,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:27,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:27,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787238871] [2019-12-18 12:33:27,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:33:27,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:33:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:33:27,875 INFO L87 Difference]: Start difference. First operand 8116 states and 24515 transitions. Second operand 10 states. [2019-12-18 12:33:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:29,091 INFO L93 Difference]: Finished difference Result 10960 states and 32212 transitions. [2019-12-18 12:33:29,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:33:29,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:33:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:29,107 INFO L225 Difference]: With dead ends: 10960 [2019-12-18 12:33:29,107 INFO L226 Difference]: Without dead ends: 10717 [2019-12-18 12:33:29,108 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 12:33:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2019-12-18 12:33:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 8132. [2019-12-18 12:33:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8132 states. [2019-12-18 12:33:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 24559 transitions. [2019-12-18 12:33:29,250 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 24559 transitions. Word has length 67 [2019-12-18 12:33:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:29,251 INFO L462 AbstractCegarLoop]: Abstraction has 8132 states and 24559 transitions. [2019-12-18 12:33:29,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:33:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 24559 transitions. [2019-12-18 12:33:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:29,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:29,260 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 12:33:29,260 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 12:33:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 8 times [2019-12-18 12:33:29,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:29,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516860039] [2019-12-18 12:33:29,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:29,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516860039] [2019-12-18 12:33:29,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:29,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:33:29,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549040255] [2019-12-18 12:33:29,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:33:29,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:33:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:33:29,453 INFO L87 Difference]: Start difference. First operand 8132 states and 24559 transitions. Second operand 12 states. [2019-12-18 12:33:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:31,096 INFO L93 Difference]: Finished difference Result 11719 states and 34211 transitions. [2019-12-18 12:33:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:33:31,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:33:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:31,112 INFO L225 Difference]: With dead ends: 11719 [2019-12-18 12:33:31,113 INFO L226 Difference]: Without dead ends: 11476 [2019-12-18 12:33:31,113 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 12:33:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11476 states. [2019-12-18 12:33:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11476 to 7956. [2019-12-18 12:33:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7956 states. [2019-12-18 12:33:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7956 states to 7956 states and 24075 transitions. [2019-12-18 12:33:31,249 INFO L78 Accepts]: Start accepts. Automaton has 7956 states and 24075 transitions. Word has length 67 [2019-12-18 12:33:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:31,249 INFO L462 AbstractCegarLoop]: Abstraction has 7956 states and 24075 transitions. [2019-12-18 12:33:31,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:33:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7956 states and 24075 transitions. [2019-12-18 12:33:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:31,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:31,257 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 12:33:31,257 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 12:33:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 9 times [2019-12-18 12:33:31,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:31,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392326751] [2019-12-18 12:33:31,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:33:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:33:31,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:33:31,395 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:33:31,399 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 12:33:31,400 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 12:33:31,401 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 12:33:31,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~y~0_In2079721439 ~__unbuffered_p0_EBX~0_Out2079721439) (= ~x~0_Out2079721439 ~__unbuffered_p0_EAX~0_Out2079721439) (= ~x~0_Out2079721439 1) (= ~a$r_buff1_thd2~0_Out2079721439 ~a$r_buff0_thd2~0_In2079721439) (= ~a$r_buff1_thd3~0_Out2079721439 ~a$r_buff0_thd3~0_In2079721439) (= ~a$r_buff0_thd1~0_In2079721439 ~a$r_buff1_thd1~0_Out2079721439) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2079721439 0)) (= ~a$r_buff0_thd1~0_Out2079721439 1) (= ~a$r_buff1_thd0~0_Out2079721439 ~a$r_buff0_thd0~0_In2079721439)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2079721439, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2079721439, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2079721439, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2079721439, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2079721439, ~y~0=~y~0_In2079721439} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out2079721439, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out2079721439, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out2079721439, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out2079721439, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2079721439, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2079721439, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2079721439, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2079721439, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2079721439, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out2079721439, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2079721439, ~y~0=~y~0_In2079721439, ~x~0=~x~0_Out2079721439} 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 12:33:31,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-491384244 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-491384244 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-491384244 |P0Thread1of1ForFork1_#t~ite5_Out-491384244|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-491384244| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-491384244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-491384244} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-491384244|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-491384244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-491384244} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:33:31,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd1~0_In1932267190 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1932267190 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1932267190 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1932267190 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1932267190 |P0Thread1of1ForFork1_#t~ite6_Out1932267190|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1932267190|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1932267190, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1932267190, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1932267190, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1932267190} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1932267190|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1932267190, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1932267190, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1932267190, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1932267190} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:33:31,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1771647901 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1771647901 256) 0))) (or (and (= ~a~0_In-1771647901 |P1Thread1of1ForFork2_#t~ite9_Out-1771647901|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-1771647901 |P1Thread1of1ForFork2_#t~ite9_Out-1771647901|)))) InVars {~a~0=~a~0_In-1771647901, ~a$w_buff1~0=~a$w_buff1~0_In-1771647901, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1771647901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1771647901} OutVars{~a~0=~a~0_In-1771647901, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1771647901|, ~a$w_buff1~0=~a$w_buff1~0_In-1771647901, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1771647901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1771647901} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:33:31,406 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 12:33:31,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1704766843 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1704766843 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1704766843 ~a$r_buff0_thd1~0_Out-1704766843)) (and (= 0 ~a$r_buff0_thd1~0_Out-1704766843) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1704766843, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1704766843} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1704766843|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1704766843, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1704766843} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:33:31,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1961562402 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1961562402 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1961562402 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1961562402 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1961562402|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In1961562402 |P0Thread1of1ForFork1_#t~ite8_Out1961562402|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1961562402, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1961562402, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1961562402, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1961562402} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1961562402|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1961562402, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1961562402, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1961562402, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1961562402} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:33:31,407 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 12:33:31,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1166115743 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1166115743 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1166115743 |P1Thread1of1ForFork2_#t~ite11_Out-1166115743|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1166115743|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1166115743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1166115743} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1166115743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1166115743, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1166115743|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:33:31,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1467066351 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out1467066351| |P2Thread1of1ForFork0_#t~ite21_Out1467066351|) (= |P2Thread1of1ForFork0_#t~ite20_Out1467066351| ~a$w_buff0~0_In1467066351) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1467066351 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In1467066351 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In1467066351 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In1467066351 256)) .cse0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1467066351| ~a$w_buff0~0_In1467066351) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In1467066351| |P2Thread1of1ForFork0_#t~ite20_Out1467066351|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1467066351, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1467066351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1467066351, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1467066351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1467066351, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1467066351|, ~weak$$choice2~0=~weak$$choice2~0_In1467066351} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1467066351|, ~a$w_buff0~0=~a$w_buff0~0_In1467066351, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1467066351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1467066351, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1467066351, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1467066351|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1467066351, ~weak$$choice2~0=~weak$$choice2~0_In1467066351} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:33:31,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1690354004 256) 0))) (or (and (= ~a$w_buff1~0_In-1690354004 |P2Thread1of1ForFork0_#t~ite24_Out-1690354004|) (= |P2Thread1of1ForFork0_#t~ite23_In-1690354004| |P2Thread1of1ForFork0_#t~ite23_Out-1690354004|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1690354004| |P2Thread1of1ForFork0_#t~ite23_Out-1690354004|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1690354004 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1690354004 256) 0) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1690354004 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1690354004 256)))) (= ~a$w_buff1~0_In-1690354004 |P2Thread1of1ForFork0_#t~ite23_Out-1690354004|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1690354004, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1690354004|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1690354004, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1690354004, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1690354004, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1690354004, ~weak$$choice2~0=~weak$$choice2~0_In-1690354004} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1690354004, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1690354004|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1690354004|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1690354004, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1690354004, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1690354004, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1690354004, ~weak$$choice2~0=~weak$$choice2~0_In-1690354004} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:33:31,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In645657460 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In645657460| |P2Thread1of1ForFork0_#t~ite26_Out645657460|) (= |P2Thread1of1ForFork0_#t~ite27_Out645657460| ~a$w_buff0_used~0_In645657460)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In645657460 256) 0))) (or (= (mod ~a$w_buff0_used~0_In645657460 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In645657460 256)) .cse1) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In645657460 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out645657460| |P2Thread1of1ForFork0_#t~ite26_Out645657460|) (= |P2Thread1of1ForFork0_#t~ite26_Out645657460| ~a$w_buff0_used~0_In645657460)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In645657460|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In645657460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In645657460, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In645657460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In645657460, ~weak$$choice2~0=~weak$$choice2~0_In645657460} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out645657460|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out645657460|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In645657460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In645657460, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In645657460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In645657460, ~weak$$choice2~0=~weak$$choice2~0_In645657460} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:33:31,412 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 12:33:31,413 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 12:33:31,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-500748477 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-500748477 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-500748477| ~a$w_buff1~0_In-500748477) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-500748477| ~a~0_In-500748477)))) InVars {~a~0=~a~0_In-500748477, ~a$w_buff1~0=~a$w_buff1~0_In-500748477, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-500748477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-500748477} OutVars{~a~0=~a~0_In-500748477, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-500748477|, ~a$w_buff1~0=~a$w_buff1~0_In-500748477, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-500748477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-500748477} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:33:31,414 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 12:33:31,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In664070211 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In664070211 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In664070211 |P2Thread1of1ForFork0_#t~ite40_Out664070211|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out664070211|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In664070211, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In664070211} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out664070211|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In664070211, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In664070211} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:33:31,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1206074332 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1206074332 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1206074332 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1206074332 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1206074332| ~a$w_buff1_used~0_In-1206074332) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1206074332|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1206074332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206074332, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1206074332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1206074332} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1206074332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206074332, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1206074332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1206074332, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1206074332|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:33:31,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In771297754 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In771297754 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out771297754|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In771297754 |P2Thread1of1ForFork0_#t~ite42_Out771297754|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In771297754, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In771297754} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In771297754, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In771297754, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out771297754|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:33:31,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In-959969101 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-959969101 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-959969101 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-959969101 256) 0))) (or (and (= ~a$r_buff1_thd3~0_In-959969101 |P2Thread1of1ForFork0_#t~ite43_Out-959969101|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-959969101| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-959969101, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-959969101, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-959969101, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-959969101} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-959969101|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-959969101, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-959969101, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-959969101, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-959969101} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:33:31,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1774735172 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1774735172 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1774735172 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1774735172 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1774735172| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1774735172| ~a$w_buff1_used~0_In-1774735172)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1774735172, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1774735172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1774735172, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1774735172} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1774735172, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1774735172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1774735172, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1774735172|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1774735172} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:33:31,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-750140976 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-750140976 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-750140976|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-750140976 |P1Thread1of1ForFork2_#t~ite13_Out-750140976|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-750140976, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-750140976} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-750140976, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-750140976, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-750140976|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:33:31,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-2078758206 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2078758206 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-2078758206 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-2078758206 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-2078758206| ~a$r_buff1_thd2~0_In-2078758206) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2078758206|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2078758206, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2078758206, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2078758206, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2078758206} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2078758206, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2078758206, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2078758206, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2078758206, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2078758206|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:33:31,418 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 12:33:31,419 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 12:33:31,419 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 12:33:31,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2118081964 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In2118081964 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out2118081964| ~a~0_In2118081964) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In2118081964 |ULTIMATE.start_main_#t~ite47_Out2118081964|)))) InVars {~a~0=~a~0_In2118081964, ~a$w_buff1~0=~a$w_buff1~0_In2118081964, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2118081964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2118081964} OutVars{~a~0=~a~0_In2118081964, ~a$w_buff1~0=~a$w_buff1~0_In2118081964, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2118081964|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2118081964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2118081964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:33:31,421 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 12:33:31,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In344269919 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In344269919 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out344269919| ~a$w_buff0_used~0_In344269919)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out344269919|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In344269919, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In344269919} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In344269919, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out344269919|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In344269919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:33:31,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-663929763 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-663929763 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-663929763 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-663929763 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-663929763|)) (and (= ~a$w_buff1_used~0_In-663929763 |ULTIMATE.start_main_#t~ite50_Out-663929763|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-663929763, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-663929763, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-663929763, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-663929763} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-663929763|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-663929763, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-663929763, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-663929763, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-663929763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:33:31,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1696905692 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1696905692 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1696905692|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1696905692 |ULTIMATE.start_main_#t~ite51_Out1696905692|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1696905692, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1696905692} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1696905692|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1696905692, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1696905692} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:33:31,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In-1949730776 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1949730776 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1949730776 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1949730776 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1949730776| ~a$r_buff1_thd0~0_In-1949730776) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out-1949730776| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1949730776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1949730776, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1949730776, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1949730776} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1949730776|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1949730776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1949730776, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1949730776, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1949730776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:33:31,425 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 12:33:31,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:33:31 BasicIcfg [2019-12-18 12:33:31,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:33:31,509 INFO L168 Benchmark]: Toolchain (without parser) took 104895.58 ms. Allocated memory was 137.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,510 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.89 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 155.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.98 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,511 INFO L168 Benchmark]: Boogie Preprocessor took 40.95 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,511 INFO L168 Benchmark]: RCFGBuilder took 1093.25 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 100.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,512 INFO L168 Benchmark]: TraceAbstraction took 102869.94 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:33:31,514 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.53 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.89 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 155.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.98 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.95 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1093.25 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 100.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102869.94 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 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.7s, 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: 102.5s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7733 SDtfs, 10873 SDslu, 25467 SDs, 0 SdLazy, 17190 SolverSat, 573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 4.8s 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: 40.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 215205 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1644 NumberOfCodeBlocks, 1644 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1542 ConstructedInterpolants, 0 QuantifiedInterpolants, 333975 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...