/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:37:13,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:37:13,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:37:13,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:37:13,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:37:13,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:37:13,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:37:13,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:37:13,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:37:13,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:37:13,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:37:13,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:37:13,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:37:13,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:37:13,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:37:13,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:37:13,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:37:13,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:37:13,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:37:13,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:37:13,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:37:13,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:37:13,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:37:13,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:37:13,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:37:13,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:37:13,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:37:13,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:37:13,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:37:13,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:37:13,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:37:13,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:37:13,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:37:13,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:37:13,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:37:13,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:37:13,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:37:13,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:37:13,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:37:13,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:37:13,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:37:13,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:37:13,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:37:13,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:37:13,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:37:13,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:37:13,391 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:37:13,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:37:13,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:37:13,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:37:13,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:37:13,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:37:13,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:37:13,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:37:13,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:37:13,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:37:13,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:37:13,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:37:13,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:37:13,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:37:13,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:37:13,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:37:13,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:37:13,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:37:13,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:37:13,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:37:13,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:37:13,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:37:13,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:37:13,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:37:13,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:37:13,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:37:13,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:37:13,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:37:13,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:37:13,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:37:13,709 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:37:13,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_pso.opt.i [2019-12-18 21:37:13,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9322665f0/e53d6f5e1952493bb4f118086298a4a6/FLAGda9fa8ea4 [2019-12-18 21:37:14,371 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:37:14,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_pso.opt.i [2019-12-18 21:37:14,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9322665f0/e53d6f5e1952493bb4f118086298a4a6/FLAGda9fa8ea4 [2019-12-18 21:37:14,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9322665f0/e53d6f5e1952493bb4f118086298a4a6 [2019-12-18 21:37:14,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:37:14,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:37:14,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:37:14,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:37:14,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:37:14,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:37:14" (1/1) ... [2019-12-18 21:37:14,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:14, skipping insertion in model container [2019-12-18 21:37:14,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:37:14" (1/1) ... [2019-12-18 21:37:14,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:37:14,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:37:15,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:37:15,300 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:37:15,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:37:15,449 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:37:15,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15 WrapperNode [2019-12-18 21:37:15,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:37:15,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:37:15,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:37:15,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:37:15,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:37:15,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:37:15,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:37:15,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:37:15,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (1/1) ... [2019-12-18 21:37:15,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:37:15,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:37:15,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:37:15,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:37:15,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (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 21:37:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:37:15,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:37:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:37:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:37:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:37:15,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:37:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:37:15,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:37:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:37:15,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:37:15,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:37:15,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:37:15,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:37:15,641 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 21:37:16,418 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:37:16,419 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:37:16,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:37:16 BoogieIcfgContainer [2019-12-18 21:37:16,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:37:16,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:37:16,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:37:16,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:37:16,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:37:14" (1/3) ... [2019-12-18 21:37:16,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7610a477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:37:16, skipping insertion in model container [2019-12-18 21:37:16,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:15" (2/3) ... [2019-12-18 21:37:16,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7610a477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:37:16, skipping insertion in model container [2019-12-18 21:37:16,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:37:16" (3/3) ... [2019-12-18 21:37:16,429 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_pso.opt.i [2019-12-18 21:37:16,440 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:37:16,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:37:16,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:37:16,451 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:37:16,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,588 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:37:16,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:37:16,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:37:16,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:37:16,645 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:37:16,645 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:37:16,645 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:37:16,645 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:37:16,646 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:37:16,646 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:37:16,662 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 21:37:16,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:37:16,753 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:37:16,754 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:37:16,775 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 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/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:37:16,804 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:37:16,854 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:37:16,854 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:37:16,865 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 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/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:37:16,891 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:37:16,893 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:37:20,323 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:37:20,448 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:37:20,479 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-18 21:37:20,479 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 21:37:20,483 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-18 21:37:44,200 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-18 21:37:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-18 21:37:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:37:44,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:44,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:37:44,208 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 21:37:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-18 21:37:44,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:44,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860109945] [2019-12-18 21:37:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:44,439 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 21:37:44,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860109945] [2019-12-18 21:37:44,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:44,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:37:44,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018014152] [2019-12-18 21:37:44,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:37:44,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:37:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:37:44,461 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-18 21:37:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:47,132 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-18 21:37:47,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:37:47,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:37:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:47,792 INFO L225 Difference]: With dead ends: 120110 [2019-12-18 21:37:47,792 INFO L226 Difference]: Without dead ends: 112648 [2019-12-18 21:37:47,800 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 21:37:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-18 21:37:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-18 21:37:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-18 21:38:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-18 21:38:03,235 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-18 21:38:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:03,235 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-18 21:38:03,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:38:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-18 21:38:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:38:03,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:03,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:03,247 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 21:38:03,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-18 21:38:03,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:03,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110113149] [2019-12-18 21:38:03,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:03,382 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 21:38:03,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110113149] [2019-12-18 21:38:03,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:03,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:38:03,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214195494] [2019-12-18 21:38:03,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:38:03,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:38:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:38:03,385 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-18 21:38:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:04,768 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-18 21:38:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:38:04,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:38:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:06,463 INFO L225 Difference]: With dead ends: 175220 [2019-12-18 21:38:06,463 INFO L226 Difference]: Without dead ends: 175171 [2019-12-18 21:38:06,464 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 21:38:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-18 21:38:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-18 21:38:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-18 21:38:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-18 21:38:21,203 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-18 21:38:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:21,203 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-18 21:38:21,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:38:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-18 21:38:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:38:21,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:21,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:21,207 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 21:38:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:21,208 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-18 21:38:21,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:21,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917250557] [2019-12-18 21:38:21,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:21,264 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 21:38:21,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917250557] [2019-12-18 21:38:21,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:21,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:38:21,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875274919] [2019-12-18 21:38:21,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:38:21,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:21,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:38:21,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:38:21,267 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-18 21:38:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:21,405 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-18 21:38:21,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:38:21,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:38:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:21,464 INFO L225 Difference]: With dead ends: 34935 [2019-12-18 21:38:21,464 INFO L226 Difference]: Without dead ends: 34935 [2019-12-18 21:38:21,464 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 21:38:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-18 21:38:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-18 21:38:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-18 21:38:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-18 21:38:27,161 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-18 21:38:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:27,161 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-18 21:38:27,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:38:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-18 21:38:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:38:27,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:27,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:27,164 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 21:38:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-18 21:38:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:27,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979217776] [2019-12-18 21:38:27,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:27,229 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 21:38:27,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979217776] [2019-12-18 21:38:27,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:27,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:38:27,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829592362] [2019-12-18 21:38:27,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:38:27,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:38:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:38:27,231 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-18 21:38:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:27,436 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-18 21:38:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:38:27,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:38:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:27,528 INFO L225 Difference]: With dead ends: 52469 [2019-12-18 21:38:27,528 INFO L226 Difference]: Without dead ends: 52469 [2019-12-18 21:38:27,528 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 21:38:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-18 21:38:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-18 21:38:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-18 21:38:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-18 21:38:28,353 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-18 21:38:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:28,354 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-18 21:38:28,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:38:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-18 21:38:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:38:28,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:28,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:28,358 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 21:38:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-18 21:38:28,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:28,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141807628] [2019-12-18 21:38:28,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:28,448 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 21:38:28,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141807628] [2019-12-18 21:38:28,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:28,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:38:28,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228683865] [2019-12-18 21:38:28,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:38:28,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:38:28,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:38:28,451 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-18 21:38:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:29,228 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-18 21:38:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:38:29,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:38:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:29,322 INFO L225 Difference]: With dead ends: 54128 [2019-12-18 21:38:29,323 INFO L226 Difference]: Without dead ends: 54128 [2019-12-18 21:38:29,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-18 21:38:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-18 21:38:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-18 21:38:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-18 21:38:30,207 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-18 21:38:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:30,207 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-18 21:38:30,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:38:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-18 21:38:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:38:30,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:30,222 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 21:38:30,222 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 21:38:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:30,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-18 21:38:30,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:30,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733025875] [2019-12-18 21:38:30,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:30,390 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 21:38:30,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733025875] [2019-12-18 21:38:30,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:30,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:38:30,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851999582] [2019-12-18 21:38:30,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:38:30,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:38:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:38:30,392 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-18 21:38:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:31,638 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-18 21:38:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:38:31,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:38:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:31,753 INFO L225 Difference]: With dead ends: 67629 [2019-12-18 21:38:31,754 INFO L226 Difference]: Without dead ends: 67622 [2019-12-18 21:38:31,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:38:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-18 21:38:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-18 21:38:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-18 21:38:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-18 21:38:32,705 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-18 21:38:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:32,706 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-18 21:38:32,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:38:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-18 21:38:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:38:32,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:32,724 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 21:38:32,724 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 21:38:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-18 21:38:32,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:32,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099305019] [2019-12-18 21:38:32,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:32,784 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 21:38:32,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099305019] [2019-12-18 21:38:32,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:32,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:38:32,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627174327] [2019-12-18 21:38:32,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:38:32,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:38:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:38:32,786 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-18 21:38:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:32,873 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-18 21:38:32,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:38:32,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:38:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:32,899 INFO L225 Difference]: With dead ends: 18428 [2019-12-18 21:38:32,899 INFO L226 Difference]: Without dead ends: 18428 [2019-12-18 21:38:32,900 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 21:38:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-18 21:38:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-18 21:38:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-18 21:38:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-18 21:38:33,462 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-18 21:38:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:33,463 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-18 21:38:33,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:38:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-18 21:38:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:38:33,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:33,477 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 21:38:33,477 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 21:38:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-18 21:38:33,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:33,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385972562] [2019-12-18 21:38:33,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:33,557 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 21:38:33,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385972562] [2019-12-18 21:38:33,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:33,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:38:33,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110694734] [2019-12-18 21:38:33,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:38:33,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:33,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:38:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:38:33,560 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-18 21:38:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:34,186 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-18 21:38:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:38:34,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:38:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:34,224 INFO L225 Difference]: With dead ends: 25507 [2019-12-18 21:38:34,224 INFO L226 Difference]: Without dead ends: 25507 [2019-12-18 21:38:34,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:38:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-18 21:38:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-18 21:38:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-18 21:38:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-18 21:38:34,595 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-18 21:38:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:34,596 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-18 21:38:34,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:38:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-18 21:38:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:38:34,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:34,620 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 21:38:34,620 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 21:38:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-18 21:38:34,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:34,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131081378] [2019-12-18 21:38:34,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:34,711 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 21:38:34,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131081378] [2019-12-18 21:38:34,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:34,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:38:34,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922074712] [2019-12-18 21:38:34,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:38:34,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:34,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:38:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:34,713 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-18 21:38:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:35,982 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-18 21:38:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:38:35,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:38:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:36,024 INFO L225 Difference]: With dead ends: 28486 [2019-12-18 21:38:36,025 INFO L226 Difference]: Without dead ends: 28486 [2019-12-18 21:38:36,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:38:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-18 21:38:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-18 21:38:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-18 21:38:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-18 21:38:36,575 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-18 21:38:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:36,575 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-18 21:38:36,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:38:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-18 21:38:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:38:36,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:36,602 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 21:38:36,602 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 21:38:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-18 21:38:36,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:36,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983622331] [2019-12-18 21:38:36,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:36,670 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 21:38:36,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983622331] [2019-12-18 21:38:36,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:36,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:38:36,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856482071] [2019-12-18 21:38:36,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:38:36,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:38:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:38:36,672 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-18 21:38:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:37,436 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-18 21:38:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:38:37,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:38:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:37,502 INFO L225 Difference]: With dead ends: 28283 [2019-12-18 21:38:37,502 INFO L226 Difference]: Without dead ends: 28283 [2019-12-18 21:38:37,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:38:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-18 21:38:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-18 21:38:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-18 21:38:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-18 21:38:38,092 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-18 21:38:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:38,092 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-18 21:38:38,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:38:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-18 21:38:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:38:38,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:38,122 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 21:38:38,123 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 21:38:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-18 21:38:38,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:38,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383795479] [2019-12-18 21:38:38,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:38,202 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 21:38:38,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383795479] [2019-12-18 21:38:38,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:38,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:38:38,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980415920] [2019-12-18 21:38:38,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:38:38,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:38:38,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:38:38,204 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 5 states. [2019-12-18 21:38:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:38,319 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-18 21:38:38,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:38:38,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:38:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:38,356 INFO L225 Difference]: With dead ends: 24998 [2019-12-18 21:38:38,356 INFO L226 Difference]: Without dead ends: 24998 [2019-12-18 21:38:38,358 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 21:38:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-18 21:38:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-18 21:38:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-18 21:38:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-18 21:38:38,742 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-18 21:38:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:38,742 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-18 21:38:38,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:38:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-18 21:38:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:38:39,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:39,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:38:39,036 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 21:38:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-18 21:38:39,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:39,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400778437] [2019-12-18 21:38:39,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:38:39,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400778437] [2019-12-18 21:38:39,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:39,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:38:39,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246846899] [2019-12-18 21:38:39,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:38:39,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:38:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:39,184 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 7 states. [2019-12-18 21:38:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:39,717 INFO L93 Difference]: Finished difference Result 67799 states and 211747 transitions. [2019-12-18 21:38:39,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:38:39,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:38:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:39,796 INFO L225 Difference]: With dead ends: 67799 [2019-12-18 21:38:39,796 INFO L226 Difference]: Without dead ends: 51948 [2019-12-18 21:38:39,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:38:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51948 states. [2019-12-18 21:38:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51948 to 27688. [2019-12-18 21:38:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-18 21:38:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-18 21:38:40,446 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-18 21:38:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:40,447 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-18 21:38:40,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:38:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-18 21:38:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:38:40,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:40,490 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 21:38:40,490 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 21:38:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-18 21:38:40,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:40,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948503830] [2019-12-18 21:38:40,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:40,596 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 21:38:40,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948503830] [2019-12-18 21:38:40,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:40,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:38:40,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218943391] [2019-12-18 21:38:40,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:38:40,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:38:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:40,599 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 7 states. [2019-12-18 21:38:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:41,333 INFO L93 Difference]: Finished difference Result 76922 states and 238949 transitions. [2019-12-18 21:38:41,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:38:41,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:38:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:41,432 INFO L225 Difference]: With dead ends: 76922 [2019-12-18 21:38:41,432 INFO L226 Difference]: Without dead ends: 54229 [2019-12-18 21:38:41,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:38:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54229 states. [2019-12-18 21:38:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54229 to 32348. [2019-12-18 21:38:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-18 21:38:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-18 21:38:42,426 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-18 21:38:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:42,426 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-18 21:38:42,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:38:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-18 21:38:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:38:42,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:42,462 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 21:38:42,462 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 21:38:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-18 21:38:42,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:42,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821757988] [2019-12-18 21:38:42,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:42,560 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 21:38:42,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821757988] [2019-12-18 21:38:42,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:42,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:38:42,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396269996] [2019-12-18 21:38:42,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:38:42,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:38:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:42,562 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 7 states. [2019-12-18 21:38:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:43,250 INFO L93 Difference]: Finished difference Result 65367 states and 203736 transitions. [2019-12-18 21:38:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:38:43,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:38:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:43,368 INFO L225 Difference]: With dead ends: 65367 [2019-12-18 21:38:43,368 INFO L226 Difference]: Without dead ends: 58008 [2019-12-18 21:38:43,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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 21:38:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58008 states. [2019-12-18 21:38:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58008 to 32656. [2019-12-18 21:38:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-18 21:38:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-18 21:38:44,607 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-18 21:38:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:44,607 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-18 21:38:44,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:38:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-18 21:38:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:38:44,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:44,643 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 21:38:44,643 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 21:38:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-18 21:38:44,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:44,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194203626] [2019-12-18 21:38:44,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:38:44,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194203626] [2019-12-18 21:38:44,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:44,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:38:44,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276709611] [2019-12-18 21:38:44,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:38:44,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:38:44,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:38:44,704 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-18 21:38:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:44,907 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-18 21:38:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:38:44,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:38:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:44,980 INFO L225 Difference]: With dead ends: 39410 [2019-12-18 21:38:44,980 INFO L226 Difference]: Without dead ends: 39410 [2019-12-18 21:38:44,981 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 21:38:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-18 21:38:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-18 21:38:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-18 21:38:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-18 21:38:45,553 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-18 21:38:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:45,553 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-18 21:38:45,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:38:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-18 21:38:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:45,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:45,592 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 21:38:45,593 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 21:38:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-18 21:38:45,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:45,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543185021] [2019-12-18 21:38:45,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:45,660 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 21:38:45,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543185021] [2019-12-18 21:38:45,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:45,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:38:45,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181082721] [2019-12-18 21:38:45,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:38:45,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:45,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:38:45,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:38:45,663 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 4 states. [2019-12-18 21:38:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:46,061 INFO L93 Difference]: Finished difference Result 53912 states and 170313 transitions. [2019-12-18 21:38:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:38:46,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:38:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:46,146 INFO L225 Difference]: With dead ends: 53912 [2019-12-18 21:38:46,146 INFO L226 Difference]: Without dead ends: 53912 [2019-12-18 21:38:46,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 21:38:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53912 states. [2019-12-18 21:38:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53912 to 37800. [2019-12-18 21:38:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37800 states. [2019-12-18 21:38:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 120622 transitions. [2019-12-18 21:38:47,213 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 120622 transitions. Word has length 65 [2019-12-18 21:38:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:47,213 INFO L462 AbstractCegarLoop]: Abstraction has 37800 states and 120622 transitions. [2019-12-18 21:38:47,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:38:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 120622 transitions. [2019-12-18 21:38:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:47,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:47,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:38:47,256 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 21:38:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-18 21:38:47,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:47,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417654530] [2019-12-18 21:38:47,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:47,309 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 21:38:47,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417654530] [2019-12-18 21:38:47,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:47,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:38:47,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96449038] [2019-12-18 21:38:47,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:38:47,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:38:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:38:47,311 INFO L87 Difference]: Start difference. First operand 37800 states and 120622 transitions. Second operand 3 states. [2019-12-18 21:38:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:47,605 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-18 21:38:47,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:38:47,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:38:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:47,688 INFO L225 Difference]: With dead ends: 53096 [2019-12-18 21:38:47,689 INFO L226 Difference]: Without dead ends: 53096 [2019-12-18 21:38:47,689 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 21:38:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-18 21:38:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-18 21:38:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-18 21:38:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-18 21:38:48,382 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-18 21:38:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:48,383 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-18 21:38:48,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:38:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-18 21:38:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:48,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:48,427 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 21:38:48,428 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 21:38:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1218113347, now seen corresponding path program 3 times [2019-12-18 21:38:48,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:48,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596176175] [2019-12-18 21:38:48,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:48,496 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 21:38:48,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596176175] [2019-12-18 21:38:48,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:48,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:38:48,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556016851] [2019-12-18 21:38:48,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:38:48,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:38:48,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:38:48,498 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 4 states. [2019-12-18 21:38:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:48,865 INFO L93 Difference]: Finished difference Result 47614 states and 149860 transitions. [2019-12-18 21:38:48,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:38:48,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:38:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:48,945 INFO L225 Difference]: With dead ends: 47614 [2019-12-18 21:38:48,945 INFO L226 Difference]: Without dead ends: 47614 [2019-12-18 21:38:48,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:38:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47614 states. [2019-12-18 21:38:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 38055. [2019-12-18 21:38:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-18 21:38:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 121477 transitions. [2019-12-18 21:38:49,921 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 121477 transitions. Word has length 65 [2019-12-18 21:38:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:49,921 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 121477 transitions. [2019-12-18 21:38:49,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:38:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 121477 transitions. [2019-12-18 21:38:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:49,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:49,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:49,967 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 21:38:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:49,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 4 times [2019-12-18 21:38:49,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:49,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819011093] [2019-12-18 21:38:49,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:50,050 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 21:38:50,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819011093] [2019-12-18 21:38:50,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:50,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:38:50,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534814532] [2019-12-18 21:38:50,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:38:50,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:38:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:50,053 INFO L87 Difference]: Start difference. First operand 38055 states and 121477 transitions. Second operand 7 states. [2019-12-18 21:38:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:50,635 INFO L93 Difference]: Finished difference Result 80005 states and 251266 transitions. [2019-12-18 21:38:50,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:38:50,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:38:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:50,802 INFO L225 Difference]: With dead ends: 80005 [2019-12-18 21:38:50,803 INFO L226 Difference]: Without dead ends: 73765 [2019-12-18 21:38:50,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:38:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73765 states. [2019-12-18 21:38:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73765 to 38119. [2019-12-18 21:38:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38119 states. [2019-12-18 21:38:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38119 states to 38119 states and 121695 transitions. [2019-12-18 21:38:52,255 INFO L78 Accepts]: Start accepts. Automaton has 38119 states and 121695 transitions. Word has length 65 [2019-12-18 21:38:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:52,255 INFO L462 AbstractCegarLoop]: Abstraction has 38119 states and 121695 transitions. [2019-12-18 21:38:52,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:38:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 38119 states and 121695 transitions. [2019-12-18 21:38:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:52,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:52,299 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 21:38:52,299 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 21:38:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 5 times [2019-12-18 21:38:52,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:52,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529967545] [2019-12-18 21:38:52,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:38:52,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529967545] [2019-12-18 21:38:52,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:52,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:38:52,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050913101] [2019-12-18 21:38:52,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:38:52,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:38:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:38:52,405 INFO L87 Difference]: Start difference. First operand 38119 states and 121695 transitions. Second operand 7 states. [2019-12-18 21:38:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:53,095 INFO L93 Difference]: Finished difference Result 60800 states and 193788 transitions. [2019-12-18 21:38:53,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:38:53,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:38:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:53,190 INFO L225 Difference]: With dead ends: 60800 [2019-12-18 21:38:53,190 INFO L226 Difference]: Without dead ends: 60800 [2019-12-18 21:38:53,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:38:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60800 states. [2019-12-18 21:38:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60800 to 39093. [2019-12-18 21:38:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39093 states. [2019-12-18 21:38:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39093 states to 39093 states and 124695 transitions. [2019-12-18 21:38:54,008 INFO L78 Accepts]: Start accepts. Automaton has 39093 states and 124695 transitions. Word has length 65 [2019-12-18 21:38:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:54,008 INFO L462 AbstractCegarLoop]: Abstraction has 39093 states and 124695 transitions. [2019-12-18 21:38:54,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:38:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39093 states and 124695 transitions. [2019-12-18 21:38:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:54,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:54,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:54,051 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 21:38:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 6 times [2019-12-18 21:38:54,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:54,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576722520] [2019-12-18 21:38:54,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:38:54,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576722520] [2019-12-18 21:38:54,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:54,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:38:54,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055075798] [2019-12-18 21:38:54,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:38:54,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:54,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:38:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:38:54,118 INFO L87 Difference]: Start difference. First operand 39093 states and 124695 transitions. Second operand 4 states. [2019-12-18 21:38:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:54,357 INFO L93 Difference]: Finished difference Result 47014 states and 149097 transitions. [2019-12-18 21:38:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:38:54,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:38:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:54,425 INFO L225 Difference]: With dead ends: 47014 [2019-12-18 21:38:54,425 INFO L226 Difference]: Without dead ends: 47014 [2019-12-18 21:38:54,426 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 21:38:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-12-18 21:38:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 36010. [2019-12-18 21:38:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-18 21:38:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-18 21:38:55,388 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-18 21:38:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:55,388 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-18 21:38:55,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:38:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-18 21:38:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:38:55,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:55,433 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 21:38:55,433 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 21:38:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-18 21:38:55,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:55,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426424522] [2019-12-18 21:38:55,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:55,593 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 21:38:55,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426424522] [2019-12-18 21:38:55,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:55,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:38:55,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660792231] [2019-12-18 21:38:55,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:38:55,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:55,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:38:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:38:55,595 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 11 states. [2019-12-18 21:38:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:59,060 INFO L93 Difference]: Finished difference Result 68669 states and 212574 transitions. [2019-12-18 21:38:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 21:38:59,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 21:38:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:59,163 INFO L225 Difference]: With dead ends: 68669 [2019-12-18 21:38:59,164 INFO L226 Difference]: Without dead ends: 68309 [2019-12-18 21:38:59,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 21:38:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68309 states. [2019-12-18 21:39:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68309 to 39224. [2019-12-18 21:39:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39224 states. [2019-12-18 21:39:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39224 states to 39224 states and 124058 transitions. [2019-12-18 21:39:00,421 INFO L78 Accepts]: Start accepts. Automaton has 39224 states and 124058 transitions. Word has length 65 [2019-12-18 21:39:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:00,421 INFO L462 AbstractCegarLoop]: Abstraction has 39224 states and 124058 transitions. [2019-12-18 21:39:00,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39224 states and 124058 transitions. [2019-12-18 21:39:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:00,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:00,465 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 21:39:00,465 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 21:39:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1132128568, now seen corresponding path program 2 times [2019-12-18 21:39:00,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:00,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548476536] [2019-12-18 21:39:00,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:00,530 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 21:39:00,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548476536] [2019-12-18 21:39:00,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:00,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:00,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22997971] [2019-12-18 21:39:00,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:00,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:00,532 INFO L87 Difference]: Start difference. First operand 39224 states and 124058 transitions. Second operand 3 states. [2019-12-18 21:39:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:00,692 INFO L93 Difference]: Finished difference Result 39224 states and 124057 transitions. [2019-12-18 21:39:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:00,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:39:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:00,752 INFO L225 Difference]: With dead ends: 39224 [2019-12-18 21:39:00,752 INFO L226 Difference]: Without dead ends: 39224 [2019-12-18 21:39:00,752 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 21:39:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39224 states. [2019-12-18 21:39:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39224 to 34165. [2019-12-18 21:39:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34165 states. [2019-12-18 21:39:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34165 states to 34165 states and 109837 transitions. [2019-12-18 21:39:01,367 INFO L78 Accepts]: Start accepts. Automaton has 34165 states and 109837 transitions. Word has length 65 [2019-12-18 21:39:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:01,367 INFO L462 AbstractCegarLoop]: Abstraction has 34165 states and 109837 transitions. [2019-12-18 21:39:01,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 34165 states and 109837 transitions. [2019-12-18 21:39:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:39:01,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:01,407 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 21:39:01,408 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 21:39:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-18 21:39:01,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:01,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696137008] [2019-12-18 21:39:01,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:01,476 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 21:39:01,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696137008] [2019-12-18 21:39:01,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:01,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:01,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119219171] [2019-12-18 21:39:01,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:01,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:01,478 INFO L87 Difference]: Start difference. First operand 34165 states and 109837 transitions. Second operand 3 states. [2019-12-18 21:39:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:01,613 INFO L93 Difference]: Finished difference Result 26883 states and 84812 transitions. [2019-12-18 21:39:01,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:01,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:39:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:01,671 INFO L225 Difference]: With dead ends: 26883 [2019-12-18 21:39:01,671 INFO L226 Difference]: Without dead ends: 26883 [2019-12-18 21:39:01,671 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 21:39:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26883 states. [2019-12-18 21:39:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26883 to 24445. [2019-12-18 21:39:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24445 states. [2019-12-18 21:39:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24445 states to 24445 states and 76956 transitions. [2019-12-18 21:39:02,074 INFO L78 Accepts]: Start accepts. Automaton has 24445 states and 76956 transitions. Word has length 66 [2019-12-18 21:39:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:02,075 INFO L462 AbstractCegarLoop]: Abstraction has 24445 states and 76956 transitions. [2019-12-18 21:39:02,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24445 states and 76956 transitions. [2019-12-18 21:39:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:02,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:02,100 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 21:39:02,100 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 21:39:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-18 21:39:02,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:02,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519177067] [2019-12-18 21:39:02,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:02,263 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 21:39:02,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519177067] [2019-12-18 21:39:02,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:02,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:39:02,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312617101] [2019-12-18 21:39:02,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:39:02,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:02,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:39:02,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:39:02,265 INFO L87 Difference]: Start difference. First operand 24445 states and 76956 transitions. Second operand 10 states. [2019-12-18 21:39:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:03,791 INFO L93 Difference]: Finished difference Result 35770 states and 112408 transitions. [2019-12-18 21:39:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:39:03,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:39:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:03,833 INFO L225 Difference]: With dead ends: 35770 [2019-12-18 21:39:03,833 INFO L226 Difference]: Without dead ends: 29107 [2019-12-18 21:39:03,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:39:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29107 states. [2019-12-18 21:39:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29107 to 24793. [2019-12-18 21:39:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24793 states. [2019-12-18 21:39:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24793 states to 24793 states and 77927 transitions. [2019-12-18 21:39:04,237 INFO L78 Accepts]: Start accepts. Automaton has 24793 states and 77927 transitions. Word has length 67 [2019-12-18 21:39:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:04,237 INFO L462 AbstractCegarLoop]: Abstraction has 24793 states and 77927 transitions. [2019-12-18 21:39:04,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:39:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24793 states and 77927 transitions. [2019-12-18 21:39:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:04,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:04,262 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 21:39:04,262 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 21:39:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-18 21:39:04,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:04,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539086765] [2019-12-18 21:39:04,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:04,439 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 21:39:04,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539086765] [2019-12-18 21:39:04,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:04,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:39:04,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513500915] [2019-12-18 21:39:04,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:39:04,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:39:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:39:04,441 INFO L87 Difference]: Start difference. First operand 24793 states and 77927 transitions. Second operand 10 states. [2019-12-18 21:39:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:05,898 INFO L93 Difference]: Finished difference Result 36351 states and 113461 transitions. [2019-12-18 21:39:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:39:05,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:39:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:05,942 INFO L225 Difference]: With dead ends: 36351 [2019-12-18 21:39:05,943 INFO L226 Difference]: Without dead ends: 31235 [2019-12-18 21:39:05,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:39:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31235 states. [2019-12-18 21:39:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31235 to 25341. [2019-12-18 21:39:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25341 states. [2019-12-18 21:39:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25341 states to 25341 states and 79330 transitions. [2019-12-18 21:39:06,393 INFO L78 Accepts]: Start accepts. Automaton has 25341 states and 79330 transitions. Word has length 67 [2019-12-18 21:39:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:06,393 INFO L462 AbstractCegarLoop]: Abstraction has 25341 states and 79330 transitions. [2019-12-18 21:39:06,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:39:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 25341 states and 79330 transitions. [2019-12-18 21:39:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:06,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:06,422 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 21:39:06,422 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 21:39:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-18 21:39:06,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:06,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396702368] [2019-12-18 21:39:06,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:06,569 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 21:39:06,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396702368] [2019-12-18 21:39:06,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:06,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:39:06,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004421183] [2019-12-18 21:39:06,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:39:06,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:39:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:06,571 INFO L87 Difference]: Start difference. First operand 25341 states and 79330 transitions. Second operand 11 states. [2019-12-18 21:39:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:08,031 INFO L93 Difference]: Finished difference Result 34775 states and 108389 transitions. [2019-12-18 21:39:08,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:39:08,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:39:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:08,078 INFO L225 Difference]: With dead ends: 34775 [2019-12-18 21:39:08,078 INFO L226 Difference]: Without dead ends: 30764 [2019-12-18 21:39:08,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:39:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30764 states. [2019-12-18 21:39:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30764 to 24977. [2019-12-18 21:39:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24977 states. [2019-12-18 21:39:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24977 states to 24977 states and 78189 transitions. [2019-12-18 21:39:08,722 INFO L78 Accepts]: Start accepts. Automaton has 24977 states and 78189 transitions. Word has length 67 [2019-12-18 21:39:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:08,722 INFO L462 AbstractCegarLoop]: Abstraction has 24977 states and 78189 transitions. [2019-12-18 21:39:08,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 24977 states and 78189 transitions. [2019-12-18 21:39:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:08,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:08,749 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 21:39:08,749 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 21:39:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-18 21:39:08,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:08,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555320481] [2019-12-18 21:39:08,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:08,922 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 21:39:08,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555320481] [2019-12-18 21:39:08,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:08,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:39:08,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414124296] [2019-12-18 21:39:08,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:39:08,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:39:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:08,924 INFO L87 Difference]: Start difference. First operand 24977 states and 78189 transitions. Second operand 11 states. [2019-12-18 21:39:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:10,134 INFO L93 Difference]: Finished difference Result 50910 states and 159815 transitions. [2019-12-18 21:39:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:39:10,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:39:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:10,204 INFO L225 Difference]: With dead ends: 50910 [2019-12-18 21:39:10,204 INFO L226 Difference]: Without dead ends: 48380 [2019-12-18 21:39:10,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:39:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48380 states. [2019-12-18 21:39:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48380 to 28441. [2019-12-18 21:39:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28441 states. [2019-12-18 21:39:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28441 states to 28441 states and 89144 transitions. [2019-12-18 21:39:10,824 INFO L78 Accepts]: Start accepts. Automaton has 28441 states and 89144 transitions. Word has length 67 [2019-12-18 21:39:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:10,824 INFO L462 AbstractCegarLoop]: Abstraction has 28441 states and 89144 transitions. [2019-12-18 21:39:10,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28441 states and 89144 transitions. [2019-12-18 21:39:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:10,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:10,856 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 21:39:10,856 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 21:39:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-18 21:39:10,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:10,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768478326] [2019-12-18 21:39:10,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:11,055 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 21:39:11,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768478326] [2019-12-18 21:39:11,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:11,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:39:11,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278357964] [2019-12-18 21:39:11,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:39:11,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:11,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:39:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:11,057 INFO L87 Difference]: Start difference. First operand 28441 states and 89144 transitions. Second operand 11 states. [2019-12-18 21:39:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:12,126 INFO L93 Difference]: Finished difference Result 48988 states and 153129 transitions. [2019-12-18 21:39:12,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:39:12,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:39:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:12,184 INFO L225 Difference]: With dead ends: 48988 [2019-12-18 21:39:12,184 INFO L226 Difference]: Without dead ends: 40641 [2019-12-18 21:39:12,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:39:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40641 states. [2019-12-18 21:39:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40641 to 23551. [2019-12-18 21:39:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23551 states. [2019-12-18 21:39:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23551 states to 23551 states and 73524 transitions. [2019-12-18 21:39:12,953 INFO L78 Accepts]: Start accepts. Automaton has 23551 states and 73524 transitions. Word has length 67 [2019-12-18 21:39:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:12,954 INFO L462 AbstractCegarLoop]: Abstraction has 23551 states and 73524 transitions. [2019-12-18 21:39:12,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 23551 states and 73524 transitions. [2019-12-18 21:39:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:12,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:12,977 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 21:39:12,977 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 21:39:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 6 times [2019-12-18 21:39:12,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:12,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614994431] [2019-12-18 21:39:12,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:13,189 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 21:39:13,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614994431] [2019-12-18 21:39:13,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:13,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:39:13,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163627065] [2019-12-18 21:39:13,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:39:13,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:39:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:39:13,192 INFO L87 Difference]: Start difference. First operand 23551 states and 73524 transitions. Second operand 12 states. [2019-12-18 21:39:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:14,475 INFO L93 Difference]: Finished difference Result 40683 states and 126906 transitions. [2019-12-18 21:39:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:39:14,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 21:39:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:14,534 INFO L225 Difference]: With dead ends: 40683 [2019-12-18 21:39:14,534 INFO L226 Difference]: Without dead ends: 40440 [2019-12-18 21:39:14,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:39:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40440 states. [2019-12-18 21:39:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40440 to 23375. [2019-12-18 21:39:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23375 states. [2019-12-18 21:39:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23375 states to 23375 states and 73052 transitions. [2019-12-18 21:39:15,031 INFO L78 Accepts]: Start accepts. Automaton has 23375 states and 73052 transitions. Word has length 67 [2019-12-18 21:39:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:15,032 INFO L462 AbstractCegarLoop]: Abstraction has 23375 states and 73052 transitions. [2019-12-18 21:39:15,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:39:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23375 states and 73052 transitions. [2019-12-18 21:39:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:15,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:15,057 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 21:39:15,057 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 21:39:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 7 times [2019-12-18 21:39:15,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:15,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818991424] [2019-12-18 21:39:15,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:39:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:39:15,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:39:15,203 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:39:15,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1306~0.base_21| 1)) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1306~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1306~0.base_21|) |v_ULTIMATE.start_main_~#t1306~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_ULTIMATE.start_main_~#t1306~0.offset_16| 0) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1306~0.base_21| 4)) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1306~0.base_21|) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1306~0.base_21|)) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1308~0.base=|v_ULTIMATE.start_main_~#t1308~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t1307~0.offset=|v_ULTIMATE.start_main_~#t1307~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_~#t1307~0.base=|v_ULTIMATE.start_main_~#t1307~0.base_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1306~0.base=|v_ULTIMATE.start_main_~#t1306~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t1306~0.offset=|v_ULTIMATE.start_main_~#t1306~0.offset_16|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1308~0.offset=|v_ULTIMATE.start_main_~#t1308~0.offset_15|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1308~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1307~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1307~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1306~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1306~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1308~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:39:15,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1307~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1307~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1307~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1307~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1307~0.base_11|) |v_ULTIMATE.start_main_~#t1307~0.offset_9| 1))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1307~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1307~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1307~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1307~0.base=|v_ULTIMATE.start_main_~#t1307~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1307~0.offset=|v_ULTIMATE.start_main_~#t1307~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1307~0.base, #length, ULTIMATE.start_main_~#t1307~0.offset] because there is no mapped edge [2019-12-18 21:39:15,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:39:15,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1960359188 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1960359188 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1960359188| ~z~0_In-1960359188) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1960359188| ~z$w_buff1~0_In-1960359188)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1960359188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960359188, ~z$w_buff1~0=~z$w_buff1~0_In-1960359188, ~z~0=~z~0_In-1960359188} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1960359188|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1960359188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960359188, ~z$w_buff1~0=~z$w_buff1~0_In-1960359188, ~z~0=~z~0_In-1960359188} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 21:39:15,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 21:39:15,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1308~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1308~0.base_13| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1308~0.base_13|) |v_ULTIMATE.start_main_~#t1308~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1308~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1308~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1308~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1308~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1308~0.base=|v_ULTIMATE.start_main_~#t1308~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1308~0.offset=|v_ULTIMATE.start_main_~#t1308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1308~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1308~0.offset] because there is no mapped edge [2019-12-18 21:39:15,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1694945734 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1694945734 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1694945734| 0)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1694945734| ~z$w_buff0_used~0_In-1694945734) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694945734, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1694945734} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694945734, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1694945734|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1694945734} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:39:15,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1880098780 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1880098780 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1880098780 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1880098780 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1880098780| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1880098780| ~z$w_buff1_used~0_In-1880098780) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1880098780, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1880098780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1880098780, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1880098780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1880098780, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1880098780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1880098780, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1880098780|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1880098780} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:39:15,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1402876772 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1402876772 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1402876772| ~z$r_buff0_thd2~0_In1402876772)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1402876772| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1402876772, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1402876772} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1402876772, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1402876772|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1402876772} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:39:15,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2087976039 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out2087976039| |P2Thread1of1ForFork0_#t~ite27_Out2087976039|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2087976039 256) 0))) (or (= (mod ~z$w_buff0_used~0_In2087976039 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In2087976039 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In2087976039 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite26_Out2087976039| ~z$w_buff0_used~0_In2087976039)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In2087976039| |P2Thread1of1ForFork0_#t~ite26_Out2087976039|) (= |P2Thread1of1ForFork0_#t~ite27_Out2087976039| ~z$w_buff0_used~0_In2087976039)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In2087976039|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2087976039, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2087976039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2087976039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2087976039, ~weak$$choice2~0=~weak$$choice2~0_In2087976039} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out2087976039|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out2087976039|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2087976039, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2087976039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2087976039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2087976039, ~weak$$choice2~0=~weak$$choice2~0_In2087976039} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 21:39:15,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:39:15,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In239988643 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In239988643 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In239988643 |P0Thread1of1ForFork1_#t~ite5_Out239988643|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out239988643|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In239988643, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In239988643} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out239988643|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In239988643, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In239988643} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:39:15,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:39:15,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out996196459| |P2Thread1of1ForFork0_#t~ite38_Out996196459|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In996196459 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In996196459 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In996196459 |P2Thread1of1ForFork0_#t~ite38_Out996196459|) .cse1 (not .cse2)) (and .cse1 (= ~z~0_In996196459 |P2Thread1of1ForFork0_#t~ite38_Out996196459|) (or .cse2 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In996196459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In996196459, ~z$w_buff1~0=~z$w_buff1~0_In996196459, ~z~0=~z~0_In996196459} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out996196459|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out996196459|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In996196459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In996196459, ~z$w_buff1~0=~z$w_buff1~0_In996196459, ~z~0=~z~0_In996196459} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:39:15,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1299842775 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1299842775 256) 0))) (or (and (= ~z$w_buff0_used~0_In1299842775 |P2Thread1of1ForFork0_#t~ite40_Out1299842775|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1299842775|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1299842775, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1299842775} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1299842775, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1299842775|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1299842775} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:39:15,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-14938633 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-14938633 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-14938633 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-14938633 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-14938633| ~z$w_buff1_used~0_In-14938633)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-14938633| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-14938633, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-14938633, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-14938633, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-14938633} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-14938633, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-14938633, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-14938633, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-14938633, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-14938633|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:39:15,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In437405289 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In437405289 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out437405289|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out437405289| ~z$r_buff0_thd3~0_In437405289) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In437405289, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In437405289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In437405289, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In437405289, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out437405289|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:39:15,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-1696680686 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1696680686 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1696680686 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1696680686 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1696680686| 0)) (and (= ~z$r_buff1_thd3~0_In-1696680686 |P2Thread1of1ForFork0_#t~ite43_Out-1696680686|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696680686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1696680686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696680686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1696680686} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1696680686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696680686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1696680686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696680686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1696680686} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:39:15,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:39:15,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1236098237 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1236098237 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1236098237 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1236098237 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1236098237 |P0Thread1of1ForFork1_#t~ite6_Out1236098237|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1236098237|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1236098237, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1236098237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236098237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1236098237} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1236098237, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1236098237|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1236098237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236098237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1236098237} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:39:15,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2042418963 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2042418963 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out2042418963)) (and (= ~z$r_buff0_thd1~0_In2042418963 ~z$r_buff0_thd1~0_Out2042418963) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2042418963, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2042418963} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2042418963, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2042418963|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2042418963} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:39:15,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-916517680 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-916517680 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-916517680 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-916517680 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In-916517680 |P0Thread1of1ForFork1_#t~ite8_Out-916517680|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-916517680|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-916517680, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-916517680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-916517680, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-916517680} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-916517680|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-916517680, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-916517680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-916517680, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-916517680} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:39:15,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:39:15,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1151939890 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1151939890 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1151939890 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1151939890 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1151939890|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1151939890 |P1Thread1of1ForFork2_#t~ite14_Out-1151939890|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151939890, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1151939890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151939890, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1151939890} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151939890, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1151939890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151939890, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1151939890|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1151939890} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:39:15,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:39:15,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:39:15,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1895892577 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1895892577 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1895892577| |ULTIMATE.start_main_#t~ite47_Out-1895892577|))) (or (and (= ~z~0_In-1895892577 |ULTIMATE.start_main_#t~ite47_Out-1895892577|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1895892577 |ULTIMATE.start_main_#t~ite47_Out-1895892577|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1895892577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1895892577, ~z$w_buff1~0=~z$w_buff1~0_In-1895892577, ~z~0=~z~0_In-1895892577} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1895892577, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1895892577|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1895892577, ~z$w_buff1~0=~z$w_buff1~0_In-1895892577, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1895892577|, ~z~0=~z~0_In-1895892577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:39:15,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2139557008 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2139557008 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2139557008|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-2139557008 |ULTIMATE.start_main_#t~ite49_Out-2139557008|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2139557008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139557008} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2139557008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139557008, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2139557008|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:39:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1750799436 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1750799436 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1750799436 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1750799436 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1750799436| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out1750799436| ~z$w_buff1_used~0_In1750799436) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1750799436, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1750799436, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1750799436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1750799436} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1750799436|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1750799436, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1750799436, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1750799436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1750799436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:39:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1820299221 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1820299221 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1820299221 |ULTIMATE.start_main_#t~ite51_Out1820299221|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1820299221|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1820299221, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1820299221} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1820299221, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1820299221|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1820299221} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:39:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-2057155690 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-2057155690 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2057155690 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2057155690 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-2057155690|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-2057155690 |ULTIMATE.start_main_#t~ite52_Out-2057155690|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2057155690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2057155690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2057155690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2057155690} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2057155690|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2057155690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2057155690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2057155690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2057155690} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:39:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:39:15,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:39:15 BasicIcfg [2019-12-18 21:39:15,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:39:15,329 INFO L168 Benchmark]: Toolchain (without parser) took 120655.07 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,330 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.24 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,330 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.53 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,332 INFO L168 Benchmark]: Boogie Preprocessor took 40.81 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,333 INFO L168 Benchmark]: RCFGBuilder took 869.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 100.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,334 INFO L168 Benchmark]: TraceAbstraction took 118905.65 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 21:39:15,341 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.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.24 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.53 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.81 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 100.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118905.65 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1306, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1307, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1308, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7416 SDtfs, 8897 SDslu, 28619 SDs, 0 SdLazy, 14355 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 56.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 366486 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1555 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1458 ConstructedInterpolants, 0 QuantifiedInterpolants, 287876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...