/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/mix036_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:13:20,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:13:20,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:13:20,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:13:20,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:13:20,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:13:20,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:13:20,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:13:20,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:13:20,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:13:20,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:13:20,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:13:20,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:13:20,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:13:20,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:13:20,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:13:20,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:13:20,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:13:20,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:13:20,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:13:20,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:13:20,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:13:20,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:13:20,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:13:20,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:13:20,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:13:20,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:13:20,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:13:20,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:13:20,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:13:20,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:13:20,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:13:20,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:13:20,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:13:20,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:13:20,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:13:20,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:13:20,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:13:20,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:13:20,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:13:20,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:13:20,426 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:13:20,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:13:20,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:13:20,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:13:20,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:13:20,441 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:13:20,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:13:20,441 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:13:20,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:13:20,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:13:20,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:13:20,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:13:20,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:13:20,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:13:20,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:13:20,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:13:20,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:13:20,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:13:20,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:13:20,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:13:20,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:13:20,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:13:20,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:13:20,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:13:20,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:13:20,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:13:20,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:13:20,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:13:20,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:13:20,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:13:20,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:13:20,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:13:20,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:13:20,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:13:20,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:13:20,741 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:13:20,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-18 21:13:20,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74052c8c4/66d57cd917c544da8905a042e9b6bef8/FLAG22a0f9175 [2019-12-18 21:13:21,387 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:13:21,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-18 21:13:21,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74052c8c4/66d57cd917c544da8905a042e9b6bef8/FLAG22a0f9175 [2019-12-18 21:13:21,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74052c8c4/66d57cd917c544da8905a042e9b6bef8 [2019-12-18 21:13:21,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:13:21,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:13:21,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:13:21,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:13:21,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:13:21,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:13:21" (1/1) ... [2019-12-18 21:13:21,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:21, skipping insertion in model container [2019-12-18 21:13:21,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:13:21" (1/1) ... [2019-12-18 21:13:21,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:13:21,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:13:22,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:13:22,371 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:13:22,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:13:22,510 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:13:22,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22 WrapperNode [2019-12-18 21:13:22,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:13:22,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:13:22,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:13:22,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:13:22,522 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:13:22" (1/1) ... [2019-12-18 21:13:22,543 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:13:22" (1/1) ... [2019-12-18 21:13:22,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:13:22,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:13:22,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:13:22,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:13:22,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (1/1) ... [2019-12-18 21:13:22,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:13:22,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:13:22,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:13:22,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:13:22,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (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:13:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:13:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:13:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:13:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:13:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:13:22,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:13:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:13:22,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:13:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:13:22,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:13:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:13:22,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:13:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:13:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:13:22,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:13:22,719 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:13:23,505 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:13:23,505 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:13:23,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:13:23 BoogieIcfgContainer [2019-12-18 21:13:23,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:13:23,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:13:23,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:13:23,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:13:23,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:13:21" (1/3) ... [2019-12-18 21:13:23,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da99c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:13:23, skipping insertion in model container [2019-12-18 21:13:23,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:22" (2/3) ... [2019-12-18 21:13:23,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da99c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:13:23, skipping insertion in model container [2019-12-18 21:13:23,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:13:23" (3/3) ... [2019-12-18 21:13:23,516 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_rmo.opt.i [2019-12-18 21:13:23,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:13:23,526 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:13:23,533 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:13:23,534 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:13:23,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,635 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,635 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,654 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,654 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,666 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,667 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,676 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:23,700 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:13:23,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:13:23,724 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:13:23,724 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:13:23,724 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:13:23,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:13:23,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:13:23,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:13:23,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:13:23,742 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-18 21:13:23,744 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 21:13:23,842 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 21:13:23,842 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:13:23,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:13:23,891 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 21:13:23,946 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 21:13:23,946 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:13:23,961 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:13:23,982 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 21:13:23,983 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:13:27,524 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:13:27,644 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:13:28,075 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-18 21:13:28,217 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-18 21:13:28,240 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77566 [2019-12-18 21:13:28,240 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 21:13:28,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 21:14:05,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 177426 states. [2019-12-18 21:14:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 177426 states. [2019-12-18 21:14:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:14:05,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:05,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:05,658 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1556658876, now seen corresponding path program 1 times [2019-12-18 21:14:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:05,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100299071] [2019-12-18 21:14:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:05,931 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:14:05,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100299071] [2019-12-18 21:14:05,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:05,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:14:05,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880485563] [2019-12-18 21:14:05,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:14:05,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:14:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:14:05,956 INFO L87 Difference]: Start difference. First operand 177426 states. Second operand 3 states. [2019-12-18 21:14:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:10,596 INFO L93 Difference]: Finished difference Result 174206 states and 838758 transitions. [2019-12-18 21:14:10,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:14:10,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:14:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:11,539 INFO L225 Difference]: With dead ends: 174206 [2019-12-18 21:14:11,539 INFO L226 Difference]: Without dead ends: 164066 [2019-12-18 21:14:11,540 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:14:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164066 states. [2019-12-18 21:14:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164066 to 164066. [2019-12-18 21:14:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164066 states. [2019-12-18 21:14:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164066 states to 164066 states and 788968 transitions. [2019-12-18 21:14:29,853 INFO L78 Accepts]: Start accepts. Automaton has 164066 states and 788968 transitions. Word has length 7 [2019-12-18 21:14:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 164066 states and 788968 transitions. [2019-12-18 21:14:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:14:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 164066 states and 788968 transitions. [2019-12-18 21:14:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:14:29,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:29,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:29,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1187468255, now seen corresponding path program 1 times [2019-12-18 21:14:29,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:29,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233323749] [2019-12-18 21:14:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:29,966 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:14:29,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233323749] [2019-12-18 21:14:29,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:29,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802805769] [2019-12-18 21:14:29,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:14:29,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:14:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:14:29,970 INFO L87 Difference]: Start difference. First operand 164066 states and 788968 transitions. Second operand 3 states. [2019-12-18 21:14:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:36,230 INFO L93 Difference]: Finished difference Result 103562 states and 449532 transitions. [2019-12-18 21:14:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:14:36,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:14:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:36,559 INFO L225 Difference]: With dead ends: 103562 [2019-12-18 21:14:36,559 INFO L226 Difference]: Without dead ends: 103562 [2019-12-18 21:14:36,560 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:14:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103562 states. [2019-12-18 21:14:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103562 to 103562. [2019-12-18 21:14:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103562 states. [2019-12-18 21:14:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103562 states to 103562 states and 449532 transitions. [2019-12-18 21:14:42,351 INFO L78 Accepts]: Start accepts. Automaton has 103562 states and 449532 transitions. Word has length 15 [2019-12-18 21:14:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:42,352 INFO L462 AbstractCegarLoop]: Abstraction has 103562 states and 449532 transitions. [2019-12-18 21:14:42,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:14:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 103562 states and 449532 transitions. [2019-12-18 21:14:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:14:42,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:42,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:14:42,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash -444517235, now seen corresponding path program 1 times [2019-12-18 21:14:42,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:42,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903436980] [2019-12-18 21:14:42,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:42,461 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:14:42,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903436980] [2019-12-18 21:14:42,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:42,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:42,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120086867] [2019-12-18 21:14:42,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:42,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:42,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:42,463 INFO L87 Difference]: Start difference. First operand 103562 states and 449532 transitions. Second operand 4 states. [2019-12-18 21:14:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:48,230 INFO L93 Difference]: Finished difference Result 160711 states and 667320 transitions. [2019-12-18 21:14:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:14:48,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:14:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:48,942 INFO L225 Difference]: With dead ends: 160711 [2019-12-18 21:14:48,942 INFO L226 Difference]: Without dead ends: 160592 [2019-12-18 21:14:48,943 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:14:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160592 states. [2019-12-18 21:14:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160592 to 146257. [2019-12-18 21:14:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146257 states. [2019-12-18 21:14:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146257 states to 146257 states and 614556 transitions. [2019-12-18 21:14:58,082 INFO L78 Accepts]: Start accepts. Automaton has 146257 states and 614556 transitions. Word has length 15 [2019-12-18 21:14:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:58,083 INFO L462 AbstractCegarLoop]: Abstraction has 146257 states and 614556 transitions. [2019-12-18 21:14:58,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 146257 states and 614556 transitions. [2019-12-18 21:14:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:14:58,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:58,087 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:14:58,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash -798602882, now seen corresponding path program 1 times [2019-12-18 21:14:58,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:58,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439732299] [2019-12-18 21:14:58,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:58,162 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:14:58,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439732299] [2019-12-18 21:14:58,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:58,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:14:58,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702367421] [2019-12-18 21:14:58,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:58,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:58,164 INFO L87 Difference]: Start difference. First operand 146257 states and 614556 transitions. Second operand 4 states. [2019-12-18 21:14:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:58,352 INFO L93 Difference]: Finished difference Result 39473 states and 140838 transitions. [2019-12-18 21:14:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:14:58,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:14:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:58,449 INFO L225 Difference]: With dead ends: 39473 [2019-12-18 21:14:58,450 INFO L226 Difference]: Without dead ends: 39473 [2019-12-18 21:14:58,451 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:14:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2019-12-18 21:14:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39473. [2019-12-18 21:14:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-12-18 21:14:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 140838 transitions. [2019-12-18 21:14:59,243 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 140838 transitions. Word has length 16 [2019-12-18 21:14:59,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:14:59,244 INFO L462 AbstractCegarLoop]: Abstraction has 39473 states and 140838 transitions. [2019-12-18 21:14:59,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:14:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 140838 transitions. [2019-12-18 21:14:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:14:59,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:14:59,247 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:14:59,248 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:14:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:14:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1050404483, now seen corresponding path program 1 times [2019-12-18 21:14:59,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:14:59,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551105085] [2019-12-18 21:14:59,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:14:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:14:59,310 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:14:59,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551105085] [2019-12-18 21:14:59,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:14:59,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:14:59,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052905880] [2019-12-18 21:14:59,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:14:59,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:14:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:14:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:14:59,312 INFO L87 Difference]: Start difference. First operand 39473 states and 140838 transitions. Second operand 4 states. [2019-12-18 21:14:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:14:59,719 INFO L93 Difference]: Finished difference Result 50748 states and 179051 transitions. [2019-12-18 21:14:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:14:59,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:14:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:14:59,822 INFO L225 Difference]: With dead ends: 50748 [2019-12-18 21:14:59,822 INFO L226 Difference]: Without dead ends: 50737 [2019-12-18 21:14:59,823 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:15:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50737 states. [2019-12-18 21:15:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50737 to 45038. [2019-12-18 21:15:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45038 states. [2019-12-18 21:15:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45038 states to 45038 states and 160086 transitions. [2019-12-18 21:15:01,355 INFO L78 Accepts]: Start accepts. Automaton has 45038 states and 160086 transitions. Word has length 16 [2019-12-18 21:15:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:01,356 INFO L462 AbstractCegarLoop]: Abstraction has 45038 states and 160086 transitions. [2019-12-18 21:15:01,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:15:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 45038 states and 160086 transitions. [2019-12-18 21:15:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:15:01,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:01,359 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:15:01,359 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1050284482, now seen corresponding path program 1 times [2019-12-18 21:15:01,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:01,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812064997] [2019-12-18 21:15:01,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:01,418 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:15:01,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812064997] [2019-12-18 21:15:01,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:01,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:15:01,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969212390] [2019-12-18 21:15:01,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:15:01,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:01,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:15:01,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:15:01,420 INFO L87 Difference]: Start difference. First operand 45038 states and 160086 transitions. Second operand 4 states. [2019-12-18 21:15:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:01,841 INFO L93 Difference]: Finished difference Result 54579 states and 192301 transitions. [2019-12-18 21:15:01,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:15:01,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:15:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:01,957 INFO L225 Difference]: With dead ends: 54579 [2019-12-18 21:15:01,957 INFO L226 Difference]: Without dead ends: 54568 [2019-12-18 21:15:01,957 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:15:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54568 states. [2019-12-18 21:15:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54568 to 44263. [2019-12-18 21:15:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44263 states. [2019-12-18 21:15:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44263 states to 44263 states and 157261 transitions. [2019-12-18 21:15:03,340 INFO L78 Accepts]: Start accepts. Automaton has 44263 states and 157261 transitions. Word has length 16 [2019-12-18 21:15:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:03,341 INFO L462 AbstractCegarLoop]: Abstraction has 44263 states and 157261 transitions. [2019-12-18 21:15:03,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:15:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 44263 states and 157261 transitions. [2019-12-18 21:15:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 21:15:03,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:03,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:03,359 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1735803470, now seen corresponding path program 1 times [2019-12-18 21:15:03,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:03,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694504699] [2019-12-18 21:15:03,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:03,451 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:15:03,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694504699] [2019-12-18 21:15:03,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:03,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:15:03,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76217779] [2019-12-18 21:15:03,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:15:03,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:15:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:15:03,453 INFO L87 Difference]: Start difference. First operand 44263 states and 157261 transitions. Second operand 5 states. [2019-12-18 21:15:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:04,136 INFO L93 Difference]: Finished difference Result 64369 states and 224813 transitions. [2019-12-18 21:15:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:15:04,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 21:15:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:04,269 INFO L225 Difference]: With dead ends: 64369 [2019-12-18 21:15:04,269 INFO L226 Difference]: Without dead ends: 64346 [2019-12-18 21:15:04,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:15:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64346 states. [2019-12-18 21:15:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64346 to 47079. [2019-12-18 21:15:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47079 states. [2019-12-18 21:15:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47079 states to 47079 states and 167291 transitions. [2019-12-18 21:15:06,020 INFO L78 Accepts]: Start accepts. Automaton has 47079 states and 167291 transitions. Word has length 24 [2019-12-18 21:15:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:06,020 INFO L462 AbstractCegarLoop]: Abstraction has 47079 states and 167291 transitions. [2019-12-18 21:15:06,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:15:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 47079 states and 167291 transitions. [2019-12-18 21:15:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 21:15:06,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:06,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:06,038 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1241237007, now seen corresponding path program 1 times [2019-12-18 21:15:06,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:06,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175725721] [2019-12-18 21:15:06,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:06,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:15:06,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175725721] [2019-12-18 21:15:06,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:06,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:15:06,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540675589] [2019-12-18 21:15:06,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:15:06,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:15:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:15:06,119 INFO L87 Difference]: Start difference. First operand 47079 states and 167291 transitions. Second operand 5 states. [2019-12-18 21:15:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:06,807 INFO L93 Difference]: Finished difference Result 66062 states and 230201 transitions. [2019-12-18 21:15:06,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:15:06,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 21:15:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:06,945 INFO L225 Difference]: With dead ends: 66062 [2019-12-18 21:15:06,945 INFO L226 Difference]: Without dead ends: 66039 [2019-12-18 21:15:06,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:15:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66039 states. [2019-12-18 21:15:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66039 to 43165. [2019-12-18 21:15:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43165 states. [2019-12-18 21:15:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 153089 transitions. [2019-12-18 21:15:07,942 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 153089 transitions. Word has length 24 [2019-12-18 21:15:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:07,943 INFO L462 AbstractCegarLoop]: Abstraction has 43165 states and 153089 transitions. [2019-12-18 21:15:07,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:15:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 153089 transitions. [2019-12-18 21:15:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:15:07,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:07,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:07,964 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2135952936, now seen corresponding path program 1 times [2019-12-18 21:15:07,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:07,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005248889] [2019-12-18 21:15:07,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:08,020 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:15:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005248889] [2019-12-18 21:15:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:08,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:15:08,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132368533] [2019-12-18 21:15:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:15:08,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:15:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:15:08,022 INFO L87 Difference]: Start difference. First operand 43165 states and 153089 transitions. Second operand 5 states. [2019-12-18 21:15:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:08,187 INFO L93 Difference]: Finished difference Result 22104 states and 79422 transitions. [2019-12-18 21:15:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:15:08,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:15:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:08,251 INFO L225 Difference]: With dead ends: 22104 [2019-12-18 21:15:08,251 INFO L226 Difference]: Without dead ends: 22104 [2019-12-18 21:15:08,251 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:15:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-18 21:15:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 21800. [2019-12-18 21:15:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-12-18 21:15:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 78390 transitions. [2019-12-18 21:15:09,098 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 78390 transitions. Word has length 28 [2019-12-18 21:15:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:09,098 INFO L462 AbstractCegarLoop]: Abstraction has 21800 states and 78390 transitions. [2019-12-18 21:15:09,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:15:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 78390 transitions. [2019-12-18 21:15:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:15:09,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:09,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:09,138 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1861342996, now seen corresponding path program 1 times [2019-12-18 21:15:09,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:09,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932534911] [2019-12-18 21:15:09,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:09,257 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:15:09,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932534911] [2019-12-18 21:15:09,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:09,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:15:09,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618690215] [2019-12-18 21:15:09,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:15:09,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:15:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:15:09,260 INFO L87 Difference]: Start difference. First operand 21800 states and 78390 transitions. Second operand 4 states. [2019-12-18 21:15:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:09,439 INFO L93 Difference]: Finished difference Result 31588 states and 108507 transitions. [2019-12-18 21:15:09,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:15:09,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 21:15:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:09,493 INFO L225 Difference]: With dead ends: 31588 [2019-12-18 21:15:09,493 INFO L226 Difference]: Without dead ends: 22114 [2019-12-18 21:15:09,493 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:15:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22114 states. [2019-12-18 21:15:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22114 to 22018. [2019-12-18 21:15:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22018 states. [2019-12-18 21:15:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22018 states to 22018 states and 78252 transitions. [2019-12-18 21:15:10,066 INFO L78 Accepts]: Start accepts. Automaton has 22018 states and 78252 transitions. Word has length 42 [2019-12-18 21:15:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:10,066 INFO L462 AbstractCegarLoop]: Abstraction has 22018 states and 78252 transitions. [2019-12-18 21:15:10,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:15:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 22018 states and 78252 transitions. [2019-12-18 21:15:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:15:10,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:10,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:10,125 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:10,125 INFO L82 PathProgramCache]: Analyzing trace with hash 405367934, now seen corresponding path program 2 times [2019-12-18 21:15:10,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:10,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887663936] [2019-12-18 21:15:10,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:10,239 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:15:10,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887663936] [2019-12-18 21:15:10,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:10,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:15:10,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066523117] [2019-12-18 21:15:10,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:15:10,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:15:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:15:10,241 INFO L87 Difference]: Start difference. First operand 22018 states and 78252 transitions. Second operand 5 states. [2019-12-18 21:15:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:10,956 INFO L93 Difference]: Finished difference Result 33051 states and 116345 transitions. [2019-12-18 21:15:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:15:10,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 21:15:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:11,049 INFO L225 Difference]: With dead ends: 33051 [2019-12-18 21:15:11,049 INFO L226 Difference]: Without dead ends: 33051 [2019-12-18 21:15:11,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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:15:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33051 states. [2019-12-18 21:15:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33051 to 29418. [2019-12-18 21:15:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29418 states. [2019-12-18 21:15:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29418 states to 29418 states and 104572 transitions. [2019-12-18 21:15:11,624 INFO L78 Accepts]: Start accepts. Automaton has 29418 states and 104572 transitions. Word has length 42 [2019-12-18 21:15:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:11,624 INFO L462 AbstractCegarLoop]: Abstraction has 29418 states and 104572 transitions. [2019-12-18 21:15:11,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:15:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29418 states and 104572 transitions. [2019-12-18 21:15:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:15:11,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:11,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:11,667 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash 843263448, now seen corresponding path program 3 times [2019-12-18 21:15:11,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:11,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233781801] [2019-12-18 21:15:11,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:11,766 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:15:11,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233781801] [2019-12-18 21:15:11,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:11,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:15:11,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201438077] [2019-12-18 21:15:11,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:15:11,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:11,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:15:11,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:15:11,769 INFO L87 Difference]: Start difference. First operand 29418 states and 104572 transitions. Second operand 6 states. [2019-12-18 21:15:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:13,126 INFO L93 Difference]: Finished difference Result 54816 states and 194597 transitions. [2019-12-18 21:15:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:15:13,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 21:15:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:13,241 INFO L225 Difference]: With dead ends: 54816 [2019-12-18 21:15:13,241 INFO L226 Difference]: Without dead ends: 54816 [2019-12-18 21:15:13,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:15:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54816 states. [2019-12-18 21:15:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54816 to 32980. [2019-12-18 21:15:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32980 states. [2019-12-18 21:15:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32980 states to 32980 states and 117707 transitions. [2019-12-18 21:15:14,005 INFO L78 Accepts]: Start accepts. Automaton has 32980 states and 117707 transitions. Word has length 42 [2019-12-18 21:15:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:14,006 INFO L462 AbstractCegarLoop]: Abstraction has 32980 states and 117707 transitions. [2019-12-18 21:15:14,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:15:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 32980 states and 117707 transitions. [2019-12-18 21:15:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:15:14,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:14,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:14,072 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1009921150, now seen corresponding path program 4 times [2019-12-18 21:15:14,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:14,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299484778] [2019-12-18 21:15:14,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:14,143 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:15:14,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299484778] [2019-12-18 21:15:14,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:14,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:15:14,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519702317] [2019-12-18 21:15:14,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:15:14,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:15:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:15:14,147 INFO L87 Difference]: Start difference. First operand 32980 states and 117707 transitions. Second operand 6 states. [2019-12-18 21:15:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:14,327 INFO L93 Difference]: Finished difference Result 31557 states and 114077 transitions. [2019-12-18 21:15:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:15:14,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 21:15:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:14,386 INFO L225 Difference]: With dead ends: 31557 [2019-12-18 21:15:14,386 INFO L226 Difference]: Without dead ends: 29116 [2019-12-18 21:15:14,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:15:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29116 states. [2019-12-18 21:15:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29116 to 27666. [2019-12-18 21:15:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27666 states. [2019-12-18 21:15:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27666 states to 27666 states and 99914 transitions. [2019-12-18 21:15:14,901 INFO L78 Accepts]: Start accepts. Automaton has 27666 states and 99914 transitions. Word has length 42 [2019-12-18 21:15:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:14,902 INFO L462 AbstractCegarLoop]: Abstraction has 27666 states and 99914 transitions. [2019-12-18 21:15:14,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:15:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 27666 states and 99914 transitions. [2019-12-18 21:15:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:15:14,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:14,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:14,939 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:14,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -876689685, now seen corresponding path program 1 times [2019-12-18 21:15:14,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:14,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413723247] [2019-12-18 21:15:14,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:15,016 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:15:15,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413723247] [2019-12-18 21:15:15,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:15,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:15:15,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603802945] [2019-12-18 21:15:15,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:15:15,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:15,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:15:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:15:15,018 INFO L87 Difference]: Start difference. First operand 27666 states and 99914 transitions. Second operand 4 states. [2019-12-18 21:15:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:15,470 INFO L93 Difference]: Finished difference Result 39758 states and 138200 transitions. [2019-12-18 21:15:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:15:15,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 21:15:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:15,491 INFO L225 Difference]: With dead ends: 39758 [2019-12-18 21:15:15,491 INFO L226 Difference]: Without dead ends: 13118 [2019-12-18 21:15:15,492 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:15:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-12-18 21:15:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 13118. [2019-12-18 21:15:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13118 states. [2019-12-18 21:15:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13118 states to 13118 states and 41184 transitions. [2019-12-18 21:15:15,690 INFO L78 Accepts]: Start accepts. Automaton has 13118 states and 41184 transitions. Word has length 57 [2019-12-18 21:15:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:15,690 INFO L462 AbstractCegarLoop]: Abstraction has 13118 states and 41184 transitions. [2019-12-18 21:15:15,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:15:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13118 states and 41184 transitions. [2019-12-18 21:15:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:15:15,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:15,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:15,706 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2087731073, now seen corresponding path program 2 times [2019-12-18 21:15:15,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:15,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477006646] [2019-12-18 21:15:15,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:15,794 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:15:15,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477006646] [2019-12-18 21:15:15,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:15,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:15:15,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450587247] [2019-12-18 21:15:15,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:15:15,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:15,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:15:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:15:15,797 INFO L87 Difference]: Start difference. First operand 13118 states and 41184 transitions. Second operand 7 states. [2019-12-18 21:15:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:16,214 INFO L93 Difference]: Finished difference Result 35392 states and 110617 transitions. [2019-12-18 21:15:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:15:16,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 21:15:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:16,255 INFO L225 Difference]: With dead ends: 35392 [2019-12-18 21:15:16,256 INFO L226 Difference]: Without dead ends: 26216 [2019-12-18 21:15:16,256 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:15:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26216 states. [2019-12-18 21:15:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26216 to 15816. [2019-12-18 21:15:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15816 states. [2019-12-18 21:15:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15816 states to 15816 states and 49526 transitions. [2019-12-18 21:15:16,596 INFO L78 Accepts]: Start accepts. Automaton has 15816 states and 49526 transitions. Word has length 57 [2019-12-18 21:15:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:16,596 INFO L462 AbstractCegarLoop]: Abstraction has 15816 states and 49526 transitions. [2019-12-18 21:15:16,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:15:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15816 states and 49526 transitions. [2019-12-18 21:15:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:15:16,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:16,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,614 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1765059873, now seen corresponding path program 3 times [2019-12-18 21:15:16,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:16,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253569955] [2019-12-18 21:15:16,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:16,699 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:15:16,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253569955] [2019-12-18 21:15:16,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:16,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:15:16,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312641172] [2019-12-18 21:15:16,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:15:16,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:15:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:15:16,703 INFO L87 Difference]: Start difference. First operand 15816 states and 49526 transitions. Second operand 7 states. [2019-12-18 21:15:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:17,106 INFO L93 Difference]: Finished difference Result 39768 states and 122709 transitions. [2019-12-18 21:15:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:15:17,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 21:15:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:17,150 INFO L225 Difference]: With dead ends: 39768 [2019-12-18 21:15:17,150 INFO L226 Difference]: Without dead ends: 27952 [2019-12-18 21:15:17,151 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:15:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27952 states. [2019-12-18 21:15:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27952 to 18428. [2019-12-18 21:15:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18428 states. [2019-12-18 21:15:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 57481 transitions. [2019-12-18 21:15:17,535 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 57481 transitions. Word has length 57 [2019-12-18 21:15:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:17,536 INFO L462 AbstractCegarLoop]: Abstraction has 18428 states and 57481 transitions. [2019-12-18 21:15:17,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:15:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 57481 transitions. [2019-12-18 21:15:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:15:17,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:17,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:17,558 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1957634753, now seen corresponding path program 4 times [2019-12-18 21:15:17,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:17,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249238208] [2019-12-18 21:15:17,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:17,693 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:15:17,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249238208] [2019-12-18 21:15:17,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:17,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:15:17,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933627075] [2019-12-18 21:15:17,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:15:17,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:15:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:15:17,696 INFO L87 Difference]: Start difference. First operand 18428 states and 57481 transitions. Second operand 9 states. [2019-12-18 21:15:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:20,093 INFO L93 Difference]: Finished difference Result 122014 states and 390197 transitions. [2019-12-18 21:15:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 21:15:20,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 21:15:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:20,276 INFO L225 Difference]: With dead ends: 122014 [2019-12-18 21:15:20,276 INFO L226 Difference]: Without dead ends: 101290 [2019-12-18 21:15:20,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 21:15:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101290 states. [2019-12-18 21:15:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101290 to 26568. [2019-12-18 21:15:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26568 states. [2019-12-18 21:15:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26568 states to 26568 states and 84420 transitions. [2019-12-18 21:15:21,293 INFO L78 Accepts]: Start accepts. Automaton has 26568 states and 84420 transitions. Word has length 57 [2019-12-18 21:15:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:21,294 INFO L462 AbstractCegarLoop]: Abstraction has 26568 states and 84420 transitions. [2019-12-18 21:15:21,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:15:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26568 states and 84420 transitions. [2019-12-18 21:15:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:15:21,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:21,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:21,326 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash -972735375, now seen corresponding path program 5 times [2019-12-18 21:15:21,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:21,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298748556] [2019-12-18 21:15:21,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:21,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298748556] [2019-12-18 21:15:21,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:21,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:15:21,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529964861] [2019-12-18 21:15:21,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:15:21,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:21,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:15:21,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:15:21,436 INFO L87 Difference]: Start difference. First operand 26568 states and 84420 transitions. Second operand 9 states. [2019-12-18 21:15:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:23,745 INFO L93 Difference]: Finished difference Result 112445 states and 354239 transitions. [2019-12-18 21:15:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 21:15:23,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 21:15:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:23,902 INFO L225 Difference]: With dead ends: 112445 [2019-12-18 21:15:23,902 INFO L226 Difference]: Without dead ends: 96549 [2019-12-18 21:15:23,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 21:15:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96549 states. [2019-12-18 21:15:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96549 to 26192. [2019-12-18 21:15:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26192 states. [2019-12-18 21:15:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26192 states to 26192 states and 83194 transitions. [2019-12-18 21:15:24,896 INFO L78 Accepts]: Start accepts. Automaton has 26192 states and 83194 transitions. Word has length 57 [2019-12-18 21:15:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:24,897 INFO L462 AbstractCegarLoop]: Abstraction has 26192 states and 83194 transitions. [2019-12-18 21:15:24,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:15:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26192 states and 83194 transitions. [2019-12-18 21:15:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:15:24,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:24,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:24,937 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1404679823, now seen corresponding path program 6 times [2019-12-18 21:15:24,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:24,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649771056] [2019-12-18 21:15:24,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:25,023 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:15:25,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649771056] [2019-12-18 21:15:25,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:25,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:15:25,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742560131] [2019-12-18 21:15:25,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:15:25,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:15:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:15:25,026 INFO L87 Difference]: Start difference. First operand 26192 states and 83194 transitions. Second operand 3 states. [2019-12-18 21:15:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:25,127 INFO L93 Difference]: Finished difference Result 21773 states and 67963 transitions. [2019-12-18 21:15:25,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:15:25,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 21:15:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:25,169 INFO L225 Difference]: With dead ends: 21773 [2019-12-18 21:15:25,170 INFO L226 Difference]: Without dead ends: 21773 [2019-12-18 21:15:25,170 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:15:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21773 states. [2019-12-18 21:15:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21773 to 20869. [2019-12-18 21:15:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20869 states. [2019-12-18 21:15:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20869 states to 20869 states and 64864 transitions. [2019-12-18 21:15:25,710 INFO L78 Accepts]: Start accepts. Automaton has 20869 states and 64864 transitions. Word has length 57 [2019-12-18 21:15:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:25,710 INFO L462 AbstractCegarLoop]: Abstraction has 20869 states and 64864 transitions. [2019-12-18 21:15:25,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:15:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 20869 states and 64864 transitions. [2019-12-18 21:15:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:25,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:25,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:25,747 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2094949333, now seen corresponding path program 1 times [2019-12-18 21:15:25,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:25,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667382338] [2019-12-18 21:15:25,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:26,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667382338] [2019-12-18 21:15:26,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:26,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:15:26,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796605131] [2019-12-18 21:15:26,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:15:26,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:26,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:15:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:15:26,172 INFO L87 Difference]: Start difference. First operand 20869 states and 64864 transitions. Second operand 15 states. [2019-12-18 21:15:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:31,262 INFO L93 Difference]: Finished difference Result 41196 states and 127001 transitions. [2019-12-18 21:15:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 21:15:31,263 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-18 21:15:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:31,326 INFO L225 Difference]: With dead ends: 41196 [2019-12-18 21:15:31,326 INFO L226 Difference]: Without dead ends: 40330 [2019-12-18 21:15:31,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=578, Invalid=3328, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 21:15:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40330 states. [2019-12-18 21:15:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40330 to 23799. [2019-12-18 21:15:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23799 states. [2019-12-18 21:15:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 73792 transitions. [2019-12-18 21:15:31,828 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 73792 transitions. Word has length 58 [2019-12-18 21:15:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:31,829 INFO L462 AbstractCegarLoop]: Abstraction has 23799 states and 73792 transitions. [2019-12-18 21:15:31,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:15:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 73792 transitions. [2019-12-18 21:15:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:31,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:31,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:31,859 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 528069611, now seen corresponding path program 2 times [2019-12-18 21:15:31,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:31,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77479865] [2019-12-18 21:15:31,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:32,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77479865] [2019-12-18 21:15:32,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:32,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:15:32,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825737524] [2019-12-18 21:15:32,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 21:15:32,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:32,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 21:15:32,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:15:32,280 INFO L87 Difference]: Start difference. First operand 23799 states and 73792 transitions. Second operand 16 states. [2019-12-18 21:15:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:37,590 INFO L93 Difference]: Finished difference Result 34707 states and 106654 transitions. [2019-12-18 21:15:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 21:15:37,591 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-12-18 21:15:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:37,637 INFO L225 Difference]: With dead ends: 34707 [2019-12-18 21:15:37,638 INFO L226 Difference]: Without dead ends: 30766 [2019-12-18 21:15:37,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=456, Invalid=1800, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 21:15:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30766 states. [2019-12-18 21:15:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30766 to 22957. [2019-12-18 21:15:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22957 states. [2019-12-18 21:15:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22957 states to 22957 states and 71072 transitions. [2019-12-18 21:15:38,037 INFO L78 Accepts]: Start accepts. Automaton has 22957 states and 71072 transitions. Word has length 58 [2019-12-18 21:15:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:38,038 INFO L462 AbstractCegarLoop]: Abstraction has 22957 states and 71072 transitions. [2019-12-18 21:15:38,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 21:15:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 22957 states and 71072 transitions. [2019-12-18 21:15:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:38,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:38,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:38,063 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash 596954983, now seen corresponding path program 3 times [2019-12-18 21:15:38,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:38,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940229145] [2019-12-18 21:15:38,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:38,207 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:15:38,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940229145] [2019-12-18 21:15:38,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:38,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:15:38,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249433995] [2019-12-18 21:15:38,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:15:38,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:15:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:15:38,210 INFO L87 Difference]: Start difference. First operand 22957 states and 71072 transitions. Second operand 7 states. [2019-12-18 21:15:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:39,723 INFO L93 Difference]: Finished difference Result 32744 states and 99166 transitions. [2019-12-18 21:15:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:15:39,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:15:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:39,774 INFO L225 Difference]: With dead ends: 32744 [2019-12-18 21:15:39,774 INFO L226 Difference]: Without dead ends: 32540 [2019-12-18 21:15:39,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:15:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32540 states. [2019-12-18 21:15:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32540 to 25032. [2019-12-18 21:15:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25032 states. [2019-12-18 21:15:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25032 states to 25032 states and 76951 transitions. [2019-12-18 21:15:40,223 INFO L78 Accepts]: Start accepts. Automaton has 25032 states and 76951 transitions. Word has length 58 [2019-12-18 21:15:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:40,223 INFO L462 AbstractCegarLoop]: Abstraction has 25032 states and 76951 transitions. [2019-12-18 21:15:40,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:15:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25032 states and 76951 transitions. [2019-12-18 21:15:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:40,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:40,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:40,252 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash 82466622, now seen corresponding path program 1 times [2019-12-18 21:15:40,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:40,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748922071] [2019-12-18 21:15:40,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:40,293 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:15:40,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748922071] [2019-12-18 21:15:40,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:40,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:15:40,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354626477] [2019-12-18 21:15:40,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:15:40,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:15:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:15:40,295 INFO L87 Difference]: Start difference. First operand 25032 states and 76951 transitions. Second operand 3 states. [2019-12-18 21:15:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:40,444 INFO L93 Difference]: Finished difference Result 27490 states and 83351 transitions. [2019-12-18 21:15:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:15:40,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:15:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:40,501 INFO L225 Difference]: With dead ends: 27490 [2019-12-18 21:15:40,502 INFO L226 Difference]: Without dead ends: 27490 [2019-12-18 21:15:40,502 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:15:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-18 21:15:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 19461. [2019-12-18 21:15:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19461 states. [2019-12-18 21:15:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19461 states to 19461 states and 59378 transitions. [2019-12-18 21:15:40,968 INFO L78 Accepts]: Start accepts. Automaton has 19461 states and 59378 transitions. Word has length 58 [2019-12-18 21:15:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:40,968 INFO L462 AbstractCegarLoop]: Abstraction has 19461 states and 59378 transitions. [2019-12-18 21:15:40,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:15:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19461 states and 59378 transitions. [2019-12-18 21:15:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:40,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:40,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:40,991 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1200571875, now seen corresponding path program 4 times [2019-12-18 21:15:40,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:40,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977296699] [2019-12-18 21:15:40,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:41,150 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:15:41,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977296699] [2019-12-18 21:15:41,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:41,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:15:41,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488126460] [2019-12-18 21:15:41,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:15:41,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:15:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:15:41,152 INFO L87 Difference]: Start difference. First operand 19461 states and 59378 transitions. Second operand 10 states. [2019-12-18 21:15:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:42,679 INFO L93 Difference]: Finished difference Result 28761 states and 87934 transitions. [2019-12-18 21:15:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:15:42,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 21:15:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:42,718 INFO L225 Difference]: With dead ends: 28761 [2019-12-18 21:15:42,718 INFO L226 Difference]: Without dead ends: 23234 [2019-12-18 21:15:42,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:15:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23234 states. [2019-12-18 21:15:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23234 to 19705. [2019-12-18 21:15:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-18 21:15:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 59949 transitions. [2019-12-18 21:15:43,056 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 59949 transitions. Word has length 58 [2019-12-18 21:15:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:43,057 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 59949 transitions. [2019-12-18 21:15:43,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:15:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 59949 transitions. [2019-12-18 21:15:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:43,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:43,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,080 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash -194995515, now seen corresponding path program 5 times [2019-12-18 21:15:43,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:43,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897713005] [2019-12-18 21:15:43,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:43,249 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:15:43,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897713005] [2019-12-18 21:15:43,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:43,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:15:43,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411462071] [2019-12-18 21:15:43,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:15:43,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:15:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:15:43,251 INFO L87 Difference]: Start difference. First operand 19705 states and 59949 transitions. Second operand 10 states. [2019-12-18 21:15:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:44,623 INFO L93 Difference]: Finished difference Result 29290 states and 88130 transitions. [2019-12-18 21:15:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:15:44,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 21:15:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:44,659 INFO L225 Difference]: With dead ends: 29290 [2019-12-18 21:15:44,659 INFO L226 Difference]: Without dead ends: 24208 [2019-12-18 21:15:44,659 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:15:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24208 states. [2019-12-18 21:15:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24208 to 19883. [2019-12-18 21:15:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19883 states. [2019-12-18 21:15:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19883 states to 19883 states and 60233 transitions. [2019-12-18 21:15:45,000 INFO L78 Accepts]: Start accepts. Automaton has 19883 states and 60233 transitions. Word has length 58 [2019-12-18 21:15:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:45,000 INFO L462 AbstractCegarLoop]: Abstraction has 19883 states and 60233 transitions. [2019-12-18 21:15:45,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:15:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19883 states and 60233 transitions. [2019-12-18 21:15:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:45,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:45,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:45,024 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:45,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:45,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1426069175, now seen corresponding path program 6 times [2019-12-18 21:15:45,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:45,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667769122] [2019-12-18 21:15:45,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:45,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667769122] [2019-12-18 21:15:45,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:45,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:15:45,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401992262] [2019-12-18 21:15:45,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:15:45,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:15:45,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:15:45,202 INFO L87 Difference]: Start difference. First operand 19883 states and 60233 transitions. Second operand 11 states. [2019-12-18 21:15:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:46,573 INFO L93 Difference]: Finished difference Result 27870 states and 83904 transitions. [2019-12-18 21:15:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:15:46,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 21:15:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:46,606 INFO L225 Difference]: With dead ends: 27870 [2019-12-18 21:15:46,606 INFO L226 Difference]: Without dead ends: 23857 [2019-12-18 21:15:46,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:15:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23857 states. [2019-12-18 21:15:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 19714. [2019-12-18 21:15:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19714 states. [2019-12-18 21:15:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19714 states to 19714 states and 59693 transitions. [2019-12-18 21:15:46,941 INFO L78 Accepts]: Start accepts. Automaton has 19714 states and 59693 transitions. Word has length 58 [2019-12-18 21:15:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:46,941 INFO L462 AbstractCegarLoop]: Abstraction has 19714 states and 59693 transitions. [2019-12-18 21:15:46,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:15:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19714 states and 59693 transitions. [2019-12-18 21:15:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:46,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:46,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:46,965 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1166224889, now seen corresponding path program 7 times [2019-12-18 21:15:46,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:46,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259405815] [2019-12-18 21:15:46,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:47,236 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:15:47,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259405815] [2019-12-18 21:15:47,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:47,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:15:47,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324372926] [2019-12-18 21:15:47,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:15:47,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:15:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:15:47,238 INFO L87 Difference]: Start difference. First operand 19714 states and 59693 transitions. Second operand 14 states. [2019-12-18 21:15:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:50,606 INFO L93 Difference]: Finished difference Result 38932 states and 118943 transitions. [2019-12-18 21:15:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:15:50,606 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-18 21:15:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:50,665 INFO L225 Difference]: With dead ends: 38932 [2019-12-18 21:15:50,666 INFO L226 Difference]: Without dead ends: 38102 [2019-12-18 21:15:50,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-18 21:15:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38102 states. [2019-12-18 21:15:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38102 to 20862. [2019-12-18 21:15:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20862 states. [2019-12-18 21:15:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20862 states to 20862 states and 63170 transitions. [2019-12-18 21:15:51,112 INFO L78 Accepts]: Start accepts. Automaton has 20862 states and 63170 transitions. Word has length 58 [2019-12-18 21:15:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:51,112 INFO L462 AbstractCegarLoop]: Abstraction has 20862 states and 63170 transitions. [2019-12-18 21:15:51,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:15:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 20862 states and 63170 transitions. [2019-12-18 21:15:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:51,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:51,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:51,138 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2037359915, now seen corresponding path program 8 times [2019-12-18 21:15:51,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:51,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18629490] [2019-12-18 21:15:51,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:51,289 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:15:51,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18629490] [2019-12-18 21:15:51,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:51,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:15:51,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050462889] [2019-12-18 21:15:51,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:15:51,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:15:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:15:51,291 INFO L87 Difference]: Start difference. First operand 20862 states and 63170 transitions. Second operand 11 states. [2019-12-18 21:15:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:52,654 INFO L93 Difference]: Finished difference Result 26529 states and 80229 transitions. [2019-12-18 21:15:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:15:52,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 21:15:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:52,691 INFO L225 Difference]: With dead ends: 26529 [2019-12-18 21:15:52,691 INFO L226 Difference]: Without dead ends: 24175 [2019-12-18 21:15:52,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:15:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24175 states. [2019-12-18 21:15:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24175 to 20016. [2019-12-18 21:15:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20016 states. [2019-12-18 21:15:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20016 states to 20016 states and 60481 transitions. [2019-12-18 21:15:53,025 INFO L78 Accepts]: Start accepts. Automaton has 20016 states and 60481 transitions. Word has length 58 [2019-12-18 21:15:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:53,026 INFO L462 AbstractCegarLoop]: Abstraction has 20016 states and 60481 transitions. [2019-12-18 21:15:53,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:15:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20016 states and 60481 transitions. [2019-12-18 21:15:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:53,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:53,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:53,053 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1802097907, now seen corresponding path program 9 times [2019-12-18 21:15:53,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:53,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400594923] [2019-12-18 21:15:53,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:53,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400594923] [2019-12-18 21:15:53,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:53,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:15:53,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452213145] [2019-12-18 21:15:53,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:15:53,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:15:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:15:53,579 INFO L87 Difference]: Start difference. First operand 20016 states and 60481 transitions. Second operand 15 states. [2019-12-18 21:15:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:15:56,838 INFO L93 Difference]: Finished difference Result 27137 states and 82066 transitions. [2019-12-18 21:15:56,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:15:56,839 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-18 21:15:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:15:56,878 INFO L225 Difference]: With dead ends: 27137 [2019-12-18 21:15:56,878 INFO L226 Difference]: Without dead ends: 26489 [2019-12-18 21:15:56,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:15:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26489 states. [2019-12-18 21:15:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26489 to 20162. [2019-12-18 21:15:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20162 states. [2019-12-18 21:15:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20162 states to 20162 states and 60896 transitions. [2019-12-18 21:15:57,224 INFO L78 Accepts]: Start accepts. Automaton has 20162 states and 60896 transitions. Word has length 58 [2019-12-18 21:15:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:15:57,225 INFO L462 AbstractCegarLoop]: Abstraction has 20162 states and 60896 transitions. [2019-12-18 21:15:57,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:15:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 20162 states and 60896 transitions. [2019-12-18 21:15:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:15:57,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:15:57,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:15:57,249 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:15:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:15:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1780203297, now seen corresponding path program 10 times [2019-12-18 21:15:57,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:15:57,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632866233] [2019-12-18 21:15:57,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:15:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:15:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:15:57,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632866233] [2019-12-18 21:15:57,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:15:57,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:15:57,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150481988] [2019-12-18 21:15:57,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:15:57,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:15:57,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:15:57,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:15:57,593 INFO L87 Difference]: Start difference. First operand 20162 states and 60896 transitions. Second operand 15 states. [2019-12-18 21:16:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:00,452 INFO L93 Difference]: Finished difference Result 27367 states and 82762 transitions. [2019-12-18 21:16:00,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:16:00,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-18 21:16:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:00,492 INFO L225 Difference]: With dead ends: 27367 [2019-12-18 21:16:00,493 INFO L226 Difference]: Without dead ends: 26567 [2019-12-18 21:16:00,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:16:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26567 states. [2019-12-18 21:16:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26567 to 20126. [2019-12-18 21:16:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20126 states. [2019-12-18 21:16:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 60774 transitions. [2019-12-18 21:16:00,840 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 60774 transitions. Word has length 58 [2019-12-18 21:16:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:00,841 INFO L462 AbstractCegarLoop]: Abstraction has 20126 states and 60774 transitions. [2019-12-18 21:16:00,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:16:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 60774 transitions. [2019-12-18 21:16:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:16:00,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:00,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:00,865 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash 312584781, now seen corresponding path program 11 times [2019-12-18 21:16:00,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:00,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989132955] [2019-12-18 21:16:00,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:00,911 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:16:00,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989132955] [2019-12-18 21:16:00,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:00,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:16:00,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573722679] [2019-12-18 21:16:00,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:16:00,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:00,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:16:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:16:00,913 INFO L87 Difference]: Start difference. First operand 20126 states and 60774 transitions. Second operand 3 states. [2019-12-18 21:16:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:00,994 INFO L93 Difference]: Finished difference Result 20124 states and 60769 transitions. [2019-12-18 21:16:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:16:00,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:16:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:01,022 INFO L225 Difference]: With dead ends: 20124 [2019-12-18 21:16:01,023 INFO L226 Difference]: Without dead ends: 20124 [2019-12-18 21:16:01,023 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:16:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20124 states. [2019-12-18 21:16:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20124 to 18412. [2019-12-18 21:16:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-18 21:16:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 56167 transitions. [2019-12-18 21:16:01,317 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 56167 transitions. Word has length 58 [2019-12-18 21:16:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:01,317 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 56167 transitions. [2019-12-18 21:16:01,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:16:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 56167 transitions. [2019-12-18 21:16:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:01,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:01,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:01,339 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash -476019080, now seen corresponding path program 1 times [2019-12-18 21:16:01,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:01,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148294285] [2019-12-18 21:16:01,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:01,759 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:16:01,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148294285] [2019-12-18 21:16:01,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:01,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:16:01,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44726669] [2019-12-18 21:16:01,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:16:01,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:16:01,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:16:01,762 INFO L87 Difference]: Start difference. First operand 18412 states and 56167 transitions. Second operand 15 states. [2019-12-18 21:16:02,108 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-12-18 21:16:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:07,238 INFO L93 Difference]: Finished difference Result 37579 states and 113931 transitions. [2019-12-18 21:16:07,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 21:16:07,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 21:16:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:07,295 INFO L225 Difference]: With dead ends: 37579 [2019-12-18 21:16:07,295 INFO L226 Difference]: Without dead ends: 36893 [2019-12-18 21:16:07,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=563, Invalid=3343, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 21:16:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36893 states. [2019-12-18 21:16:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36893 to 19730. [2019-12-18 21:16:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19730 states. [2019-12-18 21:16:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19730 states to 19730 states and 60462 transitions. [2019-12-18 21:16:07,731 INFO L78 Accepts]: Start accepts. Automaton has 19730 states and 60462 transitions. Word has length 59 [2019-12-18 21:16:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:07,731 INFO L462 AbstractCegarLoop]: Abstraction has 19730 states and 60462 transitions. [2019-12-18 21:16:07,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:16:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19730 states and 60462 transitions. [2019-12-18 21:16:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:07,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:07,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:07,754 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -766810440, now seen corresponding path program 2 times [2019-12-18 21:16:07,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:07,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889973596] [2019-12-18 21:16:07,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:08,162 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:16:08,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889973596] [2019-12-18 21:16:08,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:08,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:16:08,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852328649] [2019-12-18 21:16:08,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:16:08,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:16:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:16:08,166 INFO L87 Difference]: Start difference. First operand 19730 states and 60462 transitions. Second operand 15 states. [2019-12-18 21:16:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:12,449 INFO L93 Difference]: Finished difference Result 35931 states and 108786 transitions. [2019-12-18 21:16:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 21:16:12,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 21:16:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:12,492 INFO L225 Difference]: With dead ends: 35931 [2019-12-18 21:16:12,492 INFO L226 Difference]: Without dead ends: 29257 [2019-12-18 21:16:12,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=476, Invalid=2280, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 21:16:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29257 states. [2019-12-18 21:16:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29257 to 17306. [2019-12-18 21:16:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17306 states. [2019-12-18 21:16:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17306 states to 17306 states and 53021 transitions. [2019-12-18 21:16:12,837 INFO L78 Accepts]: Start accepts. Automaton has 17306 states and 53021 transitions. Word has length 59 [2019-12-18 21:16:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:12,837 INFO L462 AbstractCegarLoop]: Abstraction has 17306 states and 53021 transitions. [2019-12-18 21:16:12,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:16:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17306 states and 53021 transitions. [2019-12-18 21:16:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:12,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:12,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] [2019-12-18 21:16:12,857 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1669543284, now seen corresponding path program 3 times [2019-12-18 21:16:12,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:12,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997769516] [2019-12-18 21:16:12,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:13,503 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:16:13,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997769516] [2019-12-18 21:16:13,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:13,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:16:13,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744131816] [2019-12-18 21:16:13,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:16:13,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:13,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:16:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:16:13,505 INFO L87 Difference]: Start difference. First operand 17306 states and 53021 transitions. Second operand 17 states. [2019-12-18 21:16:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:17,213 INFO L93 Difference]: Finished difference Result 24896 states and 75469 transitions. [2019-12-18 21:16:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 21:16:17,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 21:16:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:17,249 INFO L225 Difference]: With dead ends: 24896 [2019-12-18 21:16:17,249 INFO L226 Difference]: Without dead ends: 23742 [2019-12-18 21:16:17,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 21:16:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23742 states. [2019-12-18 21:16:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23742 to 17506. [2019-12-18 21:16:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17506 states. [2019-12-18 21:16:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17506 states to 17506 states and 53542 transitions. [2019-12-18 21:16:17,556 INFO L78 Accepts]: Start accepts. Automaton has 17506 states and 53542 transitions. Word has length 59 [2019-12-18 21:16:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:17,556 INFO L462 AbstractCegarLoop]: Abstraction has 17506 states and 53542 transitions. [2019-12-18 21:16:17,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:16:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17506 states and 53542 transitions. [2019-12-18 21:16:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:17,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:17,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:17,575 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:17,576 INFO L82 PathProgramCache]: Analyzing trace with hash -597490960, now seen corresponding path program 4 times [2019-12-18 21:16:17,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:17,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615952582] [2019-12-18 21:16:17,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:18,118 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:16:18,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615952582] [2019-12-18 21:16:18,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:18,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:16:18,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136002251] [2019-12-18 21:16:18,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:16:18,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:16:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:16:18,119 INFO L87 Difference]: Start difference. First operand 17506 states and 53542 transitions. Second operand 17 states. [2019-12-18 21:16:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:21,925 INFO L93 Difference]: Finished difference Result 24662 states and 74713 transitions. [2019-12-18 21:16:21,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 21:16:21,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 21:16:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:21,960 INFO L225 Difference]: With dead ends: 24662 [2019-12-18 21:16:21,960 INFO L226 Difference]: Without dead ends: 24004 [2019-12-18 21:16:21,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 21:16:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24004 states. [2019-12-18 21:16:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24004 to 17478. [2019-12-18 21:16:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17478 states. [2019-12-18 21:16:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17478 states to 17478 states and 53461 transitions. [2019-12-18 21:16:22,270 INFO L78 Accepts]: Start accepts. Automaton has 17478 states and 53461 transitions. Word has length 59 [2019-12-18 21:16:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:22,271 INFO L462 AbstractCegarLoop]: Abstraction has 17478 states and 53461 transitions. [2019-12-18 21:16:22,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:16:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 17478 states and 53461 transitions. [2019-12-18 21:16:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:22,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:22,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:22,291 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:22,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:22,292 INFO L82 PathProgramCache]: Analyzing trace with hash 555844168, now seen corresponding path program 5 times [2019-12-18 21:16:22,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:22,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995725821] [2019-12-18 21:16:22,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:16:22,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995725821] [2019-12-18 21:16:22,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:22,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:16:22,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644028131] [2019-12-18 21:16:22,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:16:22,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:22,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:16:22,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:16:22,675 INFO L87 Difference]: Start difference. First operand 17478 states and 53461 transitions. Second operand 15 states. [2019-12-18 21:16:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:26,462 INFO L93 Difference]: Finished difference Result 31439 states and 95709 transitions. [2019-12-18 21:16:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 21:16:26,462 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 21:16:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:26,509 INFO L225 Difference]: With dead ends: 31439 [2019-12-18 21:16:26,510 INFO L226 Difference]: Without dead ends: 31201 [2019-12-18 21:16:26,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=405, Invalid=2145, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 21:16:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31201 states. [2019-12-18 21:16:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31201 to 18070. [2019-12-18 21:16:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18070 states. [2019-12-18 21:16:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18070 states to 18070 states and 55181 transitions. [2019-12-18 21:16:26,883 INFO L78 Accepts]: Start accepts. Automaton has 18070 states and 55181 transitions. Word has length 59 [2019-12-18 21:16:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:26,883 INFO L462 AbstractCegarLoop]: Abstraction has 18070 states and 55181 transitions. [2019-12-18 21:16:26,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:16:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 18070 states and 55181 transitions. [2019-12-18 21:16:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:26,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:26,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:26,905 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 265052808, now seen corresponding path program 6 times [2019-12-18 21:16:26,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:26,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959725972] [2019-12-18 21:16:26,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:27,415 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:16:27,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959725972] [2019-12-18 21:16:27,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:27,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:16:27,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086321656] [2019-12-18 21:16:27,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:16:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:16:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:16:27,417 INFO L87 Difference]: Start difference. First operand 18070 states and 55181 transitions. Second operand 17 states. [2019-12-18 21:16:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:30,998 INFO L93 Difference]: Finished difference Result 24766 states and 75020 transitions. [2019-12-18 21:16:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 21:16:30,998 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 21:16:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:31,033 INFO L225 Difference]: With dead ends: 24766 [2019-12-18 21:16:31,034 INFO L226 Difference]: Without dead ends: 24264 [2019-12-18 21:16:31,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 21:16:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24264 states. [2019-12-18 21:16:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24264 to 18046. [2019-12-18 21:16:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18046 states. [2019-12-18 21:16:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18046 states to 18046 states and 55107 transitions. [2019-12-18 21:16:31,349 INFO L78 Accepts]: Start accepts. Automaton has 18046 states and 55107 transitions. Word has length 59 [2019-12-18 21:16:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:31,349 INFO L462 AbstractCegarLoop]: Abstraction has 18046 states and 55107 transitions. [2019-12-18 21:16:31,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:16:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 18046 states and 55107 transitions. [2019-12-18 21:16:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:31,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:31,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:31,370 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1766458446, now seen corresponding path program 7 times [2019-12-18 21:16:31,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:31,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183279061] [2019-12-18 21:16:31,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:31,855 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:16:31,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183279061] [2019-12-18 21:16:31,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:31,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:16:31,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790906814] [2019-12-18 21:16:31,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:16:31,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:31,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:16:31,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:16:31,857 INFO L87 Difference]: Start difference. First operand 18046 states and 55107 transitions. Second operand 15 states. [2019-12-18 21:16:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:35,411 INFO L93 Difference]: Finished difference Result 30935 states and 93896 transitions. [2019-12-18 21:16:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 21:16:35,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 21:16:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:35,470 INFO L225 Difference]: With dead ends: 30935 [2019-12-18 21:16:35,471 INFO L226 Difference]: Without dead ends: 29095 [2019-12-18 21:16:35,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 21:16:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29095 states. [2019-12-18 21:16:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29095 to 17284. [2019-12-18 21:16:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17284 states. [2019-12-18 21:16:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17284 states to 17284 states and 52975 transitions. [2019-12-18 21:16:35,830 INFO L78 Accepts]: Start accepts. Automaton has 17284 states and 52975 transitions. Word has length 59 [2019-12-18 21:16:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:35,830 INFO L462 AbstractCegarLoop]: Abstraction has 17284 states and 52975 transitions. [2019-12-18 21:16:35,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:16:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17284 states and 52975 transitions. [2019-12-18 21:16:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:35,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:35,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:35,850 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash -618081858, now seen corresponding path program 8 times [2019-12-18 21:16:35,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:35,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3501773] [2019-12-18 21:16:35,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:36,008 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:16:36,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3501773] [2019-12-18 21:16:36,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:36,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:16:36,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848257209] [2019-12-18 21:16:36,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:16:36,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:16:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:16:36,010 INFO L87 Difference]: Start difference. First operand 17284 states and 52975 transitions. Second operand 11 states. [2019-12-18 21:16:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:37,118 INFO L93 Difference]: Finished difference Result 21503 states and 65665 transitions. [2019-12-18 21:16:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:16:37,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 21:16:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:37,147 INFO L225 Difference]: With dead ends: 21503 [2019-12-18 21:16:37,148 INFO L226 Difference]: Without dead ends: 20535 [2019-12-18 21:16:37,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:16:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20535 states. [2019-12-18 21:16:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20535 to 17234. [2019-12-18 21:16:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17234 states. [2019-12-18 21:16:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17234 states to 17234 states and 52853 transitions. [2019-12-18 21:16:37,567 INFO L78 Accepts]: Start accepts. Automaton has 17234 states and 52853 transitions. Word has length 59 [2019-12-18 21:16:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:37,568 INFO L462 AbstractCegarLoop]: Abstraction has 17234 states and 52853 transitions. [2019-12-18 21:16:37,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:16:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17234 states and 52853 transitions. [2019-12-18 21:16:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:37,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:37,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:37,588 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1613078860, now seen corresponding path program 9 times [2019-12-18 21:16:37,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:37,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400270054] [2019-12-18 21:16:37,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:38,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:16:38,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400270054] [2019-12-18 21:16:38,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:38,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:16:38,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714728373] [2019-12-18 21:16:38,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:16:38,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:16:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:16:38,266 INFO L87 Difference]: Start difference. First operand 17234 states and 52853 transitions. Second operand 18 states. [2019-12-18 21:16:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:44,026 INFO L93 Difference]: Finished difference Result 36666 states and 110185 transitions. [2019-12-18 21:16:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-18 21:16:44,026 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-18 21:16:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:44,080 INFO L225 Difference]: With dead ends: 36666 [2019-12-18 21:16:44,081 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 21:16:44,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=598, Invalid=3824, Unknown=0, NotChecked=0, Total=4422 [2019-12-18 21:16:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 21:16:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 17498. [2019-12-18 21:16:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17498 states. [2019-12-18 21:16:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17498 states to 17498 states and 53564 transitions. [2019-12-18 21:16:44,491 INFO L78 Accepts]: Start accepts. Automaton has 17498 states and 53564 transitions. Word has length 59 [2019-12-18 21:16:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:44,491 INFO L462 AbstractCegarLoop]: Abstraction has 17498 states and 53564 transitions. [2019-12-18 21:16:44,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:16:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 17498 states and 53564 transitions. [2019-12-18 21:16:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:44,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:44,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:44,511 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1903870220, now seen corresponding path program 10 times [2019-12-18 21:16:44,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:44,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244869588] [2019-12-18 21:16:44,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:45,153 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:16:45,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244869588] [2019-12-18 21:16:45,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:45,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:16:45,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802662640] [2019-12-18 21:16:45,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:16:45,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:16:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:16:45,155 INFO L87 Difference]: Start difference. First operand 17498 states and 53564 transitions. Second operand 18 states. [2019-12-18 21:16:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:50,512 INFO L93 Difference]: Finished difference Result 35966 states and 108079 transitions. [2019-12-18 21:16:50,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 21:16:50,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-18 21:16:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:50,562 INFO L225 Difference]: With dead ends: 35966 [2019-12-18 21:16:50,562 INFO L226 Difference]: Without dead ends: 35318 [2019-12-18 21:16:50,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=564, Invalid=3468, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 21:16:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-18 21:16:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 17458. [2019-12-18 21:16:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17458 states. [2019-12-18 21:16:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17458 states to 17458 states and 53442 transitions. [2019-12-18 21:16:50,945 INFO L78 Accepts]: Start accepts. Automaton has 17458 states and 53442 transitions. Word has length 59 [2019-12-18 21:16:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:50,945 INFO L462 AbstractCegarLoop]: Abstraction has 17458 states and 53442 transitions. [2019-12-18 21:16:50,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:16:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17458 states and 53442 transitions. [2019-12-18 21:16:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:50,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:50,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:50,964 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash -459743732, now seen corresponding path program 11 times [2019-12-18 21:16:50,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:50,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392465736] [2019-12-18 21:16:50,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:51,122 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:16:51,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392465736] [2019-12-18 21:16:51,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:51,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:16:51,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049157111] [2019-12-18 21:16:51,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:16:51,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:16:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:16:51,124 INFO L87 Difference]: Start difference. First operand 17458 states and 53442 transitions. Second operand 11 states. [2019-12-18 21:16:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:52,108 INFO L93 Difference]: Finished difference Result 30051 states and 92571 transitions. [2019-12-18 21:16:52,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:16:52,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 21:16:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:52,153 INFO L225 Difference]: With dead ends: 30051 [2019-12-18 21:16:52,153 INFO L226 Difference]: Without dead ends: 29485 [2019-12-18 21:16:52,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:16:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29485 states. [2019-12-18 21:16:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29485 to 18462. [2019-12-18 21:16:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18462 states. [2019-12-18 21:16:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 56643 transitions. [2019-12-18 21:16:52,523 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 56643 transitions. Word has length 59 [2019-12-18 21:16:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:52,523 INFO L462 AbstractCegarLoop]: Abstraction has 18462 states and 56643 transitions. [2019-12-18 21:16:52,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:16:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 56643 transitions. [2019-12-18 21:16:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:52,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:52,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:52,545 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash -750535092, now seen corresponding path program 12 times [2019-12-18 21:16:52,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:52,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338501544] [2019-12-18 21:16:52,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:16:52,703 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:16:52,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338501544] [2019-12-18 21:16:52,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:16:52,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:16:52,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022990459] [2019-12-18 21:16:52,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:16:52,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:16:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:16:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:16:52,708 INFO L87 Difference]: Start difference. First operand 18462 states and 56643 transitions. Second operand 11 states. [2019-12-18 21:16:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:16:53,621 INFO L93 Difference]: Finished difference Result 28827 states and 88493 transitions. [2019-12-18 21:16:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:16:53,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 21:16:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:16:53,657 INFO L225 Difference]: With dead ends: 28827 [2019-12-18 21:16:53,658 INFO L226 Difference]: Without dead ends: 23789 [2019-12-18 21:16:53,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:16:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23789 states. [2019-12-18 21:16:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23789 to 15216. [2019-12-18 21:16:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15216 states. [2019-12-18 21:16:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15216 states to 15216 states and 47000 transitions. [2019-12-18 21:16:54,119 INFO L78 Accepts]: Start accepts. Automaton has 15216 states and 47000 transitions. Word has length 59 [2019-12-18 21:16:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:16:54,119 INFO L462 AbstractCegarLoop]: Abstraction has 15216 states and 47000 transitions. [2019-12-18 21:16:54,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:16:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15216 states and 47000 transitions. [2019-12-18 21:16:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:16:54,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:16:54,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:16:54,137 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:16:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:16:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash 982633720, now seen corresponding path program 13 times [2019-12-18 21:16:54,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:16:54,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911198028] [2019-12-18 21:16:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:16:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:16:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:16:54,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:16:54,248 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:16:54,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~y$w_buff1~0_28) (= 0 v_~a~0_9) (= v_~x~0_11 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t957~0.base_18|) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$r_buff1_thd3~0_20) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p3_EAX~0_14) (= v_~y$w_buff0_used~0_109 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t957~0.base_18| 4) |v_#length_29|) (= v_~y$r_buff0_thd2~0_72 0) (= v_~b~0_11 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~y$r_buff1_thd1~0_11) (= |v_ULTIMATE.start_main_~#t957~0.offset_15| 0) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd2~0_44) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t957~0.base_18|)) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_18| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_18|) |v_ULTIMATE.start_main_~#t957~0.offset_15| 0)) |v_#memory_int_27|) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t957~0.base_18| 1)) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 0 |v_#NULL.base_3|) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~y$r_buff1_thd4~0_20) (= v_~y$r_buff0_thd3~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_22|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_17|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_8|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_20|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_72, ULTIMATE.start_main_~#t957~0.offset=|v_ULTIMATE.start_main_~#t957~0.offset_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_21|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_44, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t957~0.base=|v_ULTIMATE.start_main_~#t957~0.base_18|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t959~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t960~0.base, ULTIMATE.start_main_~#t960~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t957~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t958~0.offset, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t958~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t957~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:16:54,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L850-1-->L852: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t958~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t958~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t958~0.offset_11|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t958~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12|) |v_ULTIMATE.start_main_~#t958~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t958~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t958~0.offset] because there is no mapped edge [2019-12-18 21:16:54,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L852-1-->L854: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13| 1) |v_#valid_40|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t959~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t959~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t959~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13|) |v_ULTIMATE.start_main_~#t959~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t959~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_11|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_~#t959~0.base] because there is no mapped edge [2019-12-18 21:16:54,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~__unbuffered_p2_EAX~0_5 v_~z~0_6) (= v_~y$r_buff0_thd0~0_16 v_~y$r_buff1_thd0~0_12) (= v_~y$r_buff0_thd3~0_19 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_16 v_~y$r_buff1_thd4~0_14) (= v_~y$r_buff0_thd3~0_18 1) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff1_thd2~0_29) (= v_~y$r_buff1_thd1~0_5 v_~y$r_buff0_thd1~0_5) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_5, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_12} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:16:54,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t960~0.base_12|) (= |v_ULTIMATE.start_main_~#t960~0.offset_10| 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12|) |v_ULTIMATE.start_main_~#t960~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t960~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t960~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t960~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t960~0.offset] because there is no mapped edge [2019-12-18 21:16:54,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~b~0_5) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~b~0=v_~b~0_5, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:16:54,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1008983733| |P3Thread1of1ForFork0_#t~ite33_Out1008983733|)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1008983733 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1008983733 256)))) (or (and .cse0 (= ~y~0_In1008983733 |P3Thread1of1ForFork0_#t~ite32_Out1008983733|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1008983733| ~y$w_buff1~0_In1008983733) (not .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1008983733, ~y$w_buff1~0=~y$w_buff1~0_In1008983733, ~y~0=~y~0_In1008983733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1008983733} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1008983733, ~y$w_buff1~0=~y$w_buff1~0_In1008983733, ~y~0=~y~0_In1008983733, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1008983733|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1008983733|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1008983733} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 21:16:54,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In-783185423 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-783185423 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-783185423|) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out-783185423| ~y$w_buff0_used~0_In-783185423) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-783185423, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-783185423} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-783185423, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-783185423, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-783185423|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 21:16:54,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-47735896 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-47735896 256)))) (or (and (= ~y$w_buff0_used~0_In-47735896 |P2Thread1of1ForFork3_#t~ite28_Out-47735896|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-47735896|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-47735896, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-47735896} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-47735896, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-47735896, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-47735896|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 21:16:54,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-178436303 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-178436303 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-178436303 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-178436303 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-178436303| ~y$w_buff1_used~0_In-178436303) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork0_#t~ite35_Out-178436303| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-178436303, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-178436303, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178436303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178436303} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-178436303, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-178436303, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178436303, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-178436303|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178436303} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 21:16:54,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1592882323 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1592882323 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1592882323 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1592882323 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out1592882323| ~y$w_buff1_used~0_In1592882323) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out1592882323| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1592882323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592882323} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1592882323, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1592882323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592882323} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 21:16:54,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-781630561 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-781630561 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-781630561 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-781630561 ~y$r_buff0_thd3~0_In-781630561)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-781630561} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-781630561|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-781630561} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:16:54,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1910514713 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1910514713 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1910514713 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1910514713 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out1910514713| 0)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out1910514713| ~y$r_buff1_thd3~0_In1910514713) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1910514713, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1910514713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1910514713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1910514713} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1910514713, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1910514713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1910514713, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1910514713|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1910514713} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 21:16:54,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_14) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:16:54,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-815774038 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-815774038| ~y$w_buff0~0_In-815774038) (= |P1Thread1of1ForFork2_#t~ite8_In-815774038| |P1Thread1of1ForFork2_#t~ite8_Out-815774038|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-815774038 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-815774038 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-815774038 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-815774038 256) 0))) (= ~y$w_buff0~0_In-815774038 |P1Thread1of1ForFork2_#t~ite8_Out-815774038|) (= |P1Thread1of1ForFork2_#t~ite9_Out-815774038| |P1Thread1of1ForFork2_#t~ite8_Out-815774038|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-815774038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-815774038, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-815774038|, ~y$w_buff0~0=~y$w_buff0~0_In-815774038, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-815774038, ~weak$$choice2~0=~weak$$choice2~0_In-815774038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-815774038} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-815774038, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-815774038|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-815774038, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-815774038|, ~y$w_buff0~0=~y$w_buff0~0_In-815774038, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-815774038, ~weak$$choice2~0=~weak$$choice2~0_In-815774038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-815774038} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:16:54,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1096502918 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_In1096502918| |P1Thread1of1ForFork2_#t~ite11_Out1096502918|) (= ~y$w_buff1~0_In1096502918 |P1Thread1of1ForFork2_#t~ite12_Out1096502918|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1096502918 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1096502918 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1096502918 256)) (and (= (mod ~y$r_buff1_thd2~0_In1096502918 256) 0) .cse1))) (= ~y$w_buff1~0_In1096502918 |P1Thread1of1ForFork2_#t~ite11_Out1096502918|) (= |P1Thread1of1ForFork2_#t~ite11_Out1096502918| |P1Thread1of1ForFork2_#t~ite12_Out1096502918|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1096502918, ~y$w_buff1~0=~y$w_buff1~0_In1096502918, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1096502918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1096502918, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1096502918|, ~weak$$choice2~0=~weak$$choice2~0_In1096502918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1096502918} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1096502918, ~y$w_buff1~0=~y$w_buff1~0_In1096502918, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1096502918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1096502918, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1096502918|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1096502918|, ~weak$$choice2~0=~weak$$choice2~0_In1096502918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1096502918} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:16:54,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_56 v_~y$r_buff0_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 21:16:54,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2142948678 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2142948678 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In2142948678 256)) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In2142948678 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2142948678 256)))) (= |P1Thread1of1ForFork2_#t~ite24_Out2142948678| |P1Thread1of1ForFork2_#t~ite23_Out2142948678|) (= ~y$r_buff1_thd2~0_In2142948678 |P1Thread1of1ForFork2_#t~ite23_Out2142948678|) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite23_In2142948678| |P1Thread1of1ForFork2_#t~ite23_Out2142948678|) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite24_Out2142948678| ~y$r_buff1_thd2~0_In2142948678)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2142948678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142948678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2142948678, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In2142948678|, ~weak$$choice2~0=~weak$$choice2~0_In2142948678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142948678} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2142948678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142948678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2142948678, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out2142948678|, ~weak$$choice2~0=~weak$$choice2~0_In2142948678, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out2142948678|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142948678} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 21:16:54,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_17 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_17, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 21:16:54,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In276987822 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In276987822 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out276987822|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In276987822 |P3Thread1of1ForFork0_#t~ite36_Out276987822|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In276987822, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276987822} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In276987822, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276987822, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out276987822|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 21:16:54,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1008227128 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1008227128 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-1008227128 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1008227128 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1008227128|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-1008227128| ~y$r_buff1_thd4~0_In-1008227128) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1008227128, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1008227128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1008227128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1008227128} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1008227128, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1008227128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1008227128, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1008227128|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1008227128} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 21:16:54,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_15) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_15, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:16:54,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:16:54,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In952905959 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In952905959 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out952905959| ~y~0_In952905959) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out952905959| ~y$w_buff1~0_In952905959) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In952905959, ~y~0=~y~0_In952905959, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In952905959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In952905959} OutVars{~y$w_buff1~0=~y$w_buff1~0_In952905959, ~y~0=~y~0_In952905959, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out952905959|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In952905959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In952905959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:16:54,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_16 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:16:54,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1082685591 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1082685591 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1082685591| ~y$w_buff0_used~0_In-1082685591) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1082685591|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082685591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1082685591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082685591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1082685591, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1082685591|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:16:54,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-419754275 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-419754275 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-419754275 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-419754275 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-419754275|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-419754275 |ULTIMATE.start_main_#t~ite45_Out-419754275|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-419754275, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-419754275, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-419754275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419754275} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-419754275, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-419754275, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-419754275, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-419754275|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419754275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:16:54,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1475381694 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1475381694 256)))) (or (and (= ~y$r_buff0_thd0~0_In1475381694 |ULTIMATE.start_main_#t~ite46_Out1475381694|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite46_Out1475381694| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1475381694, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1475381694} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1475381694, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1475381694, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1475381694|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 21:16:54,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In947379975 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In947379975 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In947379975 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In947379975 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In947379975 |ULTIMATE.start_main_#t~ite47_Out947379975|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite47_Out947379975| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In947379975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947379975, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In947379975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947379975} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In947379975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947379975, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out947379975|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In947379975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947379975} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 21:16:54,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_12| v_~y$r_buff1_thd0~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:16:54,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:16:54 BasicIcfg [2019-12-18 21:16:54,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:16:54,397 INFO L168 Benchmark]: Toolchain (without parser) took 212722.07 ms. Allocated memory was 144.7 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 21:16:54,398 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:16:54,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.82 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.0 MB in the beginning and 156.4 MB in the end (delta: -57.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:16:54,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.96 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.6 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:16:54,399 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:16:54,399 INFO L168 Benchmark]: RCFGBuilder took 882.72 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.8 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:16:54,400 INFO L168 Benchmark]: TraceAbstraction took 210885.05 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 21:16:54,402 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.82 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.0 MB in the beginning and 156.4 MB in the end (delta: -57.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.96 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 882.72 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.8 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 210885.05 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 183 ProgramPointsBefore, 90 ProgramPointsAfterwards, 211 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6901 VarBasedMoverChecksPositive, 180 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 77566 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t957, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t958, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t959, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t960, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 210.5s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 101.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10979 SDtfs, 19068 SDslu, 53675 SDs, 0 SdLazy, 55817 SolverSat, 1218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1069 GetRequests, 59 SyntacticMatches, 51 SemanticMatches, 959 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10545 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177426occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 483856 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 2134 NumberOfCodeBlocks, 2134 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2032 ConstructedInterpolants, 0 QuantifiedInterpolants, 624898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...