/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:41:25,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:41:25,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:41:25,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:41:25,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:41:25,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:41:25,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:41:25,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:41:25,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:41:25,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:41:25,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:41:25,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:41:25,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:41:25,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:41:25,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:41:25,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:41:25,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:41:25,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:41:25,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:41:25,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:41:25,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:41:25,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:41:25,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:41:25,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:41:25,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:41:25,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:41:25,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:41:25,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:41:25,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:41:25,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:41:25,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:41:25,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:41:25,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:41:25,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:41:25,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:41:25,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:41:25,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:41:25,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:41:25,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:41:25,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:41:25,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:41:25,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:41:25,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:41:25,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:41:25,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:41:25,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:41:25,394 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:41:25,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:41:25,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:41:25,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:41:25,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:41:25,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:41:25,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:41:25,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:41:25,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:41:25,395 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:41:25,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:41:25,396 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:41:25,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:41:25,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:41:25,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:41:25,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:41:25,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:41:25,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:25,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:41:25,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:41:25,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:41:25,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:41:25,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:41:25,398 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:41:25,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:41:25,399 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:41:25,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:41:25,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:41:25,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:41:25,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:41:25,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:41:25,719 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:41:25,720 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-27 17:41:25,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a1e216a/f262fe97c40a4892ab65b1c04bf8a850/FLAG9441a5456 [2019-12-27 17:41:26,401 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:41:26,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-27 17:41:26,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a1e216a/f262fe97c40a4892ab65b1c04bf8a850/FLAG9441a5456 [2019-12-27 17:41:26,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a1e216a/f262fe97c40a4892ab65b1c04bf8a850 [2019-12-27 17:41:26,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:41:26,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:41:26,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:26,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:41:26,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:41:26,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:26" (1/1) ... [2019-12-27 17:41:26,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:26, skipping insertion in model container [2019-12-27 17:41:26,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:26" (1/1) ... [2019-12-27 17:41:26,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:41:26,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:41:27,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:27,331 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:41:27,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:27,502 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:41:27,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27 WrapperNode [2019-12-27 17:41:27,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:27,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:27,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:41:27,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:41:27,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:27,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:41:27,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:41:27,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:41:27,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (1/1) ... [2019-12-27 17:41:27,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:41:27,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:41:27,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:41:27,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:41:27,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (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-27 17:41:27,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:41:27,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:41:27,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:41:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:41:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:41:27,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:41:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:41:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:41:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:41:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:41:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:41:27,736 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:41:28,754 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:41:28,755 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:41:28,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:28 BoogieIcfgContainer [2019-12-27 17:41:28,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:41:28,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:41:28,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:41:28,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:41:28,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:41:26" (1/3) ... [2019-12-27 17:41:28,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d0c35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:28, skipping insertion in model container [2019-12-27 17:41:28,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:27" (2/3) ... [2019-12-27 17:41:28,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d0c35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:28, skipping insertion in model container [2019-12-27 17:41:28,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:28" (3/3) ... [2019-12-27 17:41:28,770 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-27 17:41:28,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:41:28,782 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:41:28,791 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:41:28,792 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:41:28,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:28,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:41:28,997 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:41:28,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:41:28,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:41:28,998 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:41:28,998 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:41:28,998 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:41:28,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:41:28,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:41:29,019 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 17:41:29,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:29,203 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:29,203 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:29,242 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:29,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:29,467 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:29,467 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:29,490 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:29,541 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 17:41:29,542 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:41:32,436 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-27 17:41:37,569 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:41:37,676 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:41:37,813 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 17:41:37,813 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 17:41:37,816 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 17:41:52,219 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 17:41:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 17:41:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:41:52,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:52,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:41:52,229 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 17:41:52,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:52,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551584174] [2019-12-27 17:41:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:52,465 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-27 17:41:52,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551584174] [2019-12-27 17:41:52,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:52,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:41:52,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823331628] [2019-12-27 17:41:52,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:52,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:52,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:41:52,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:52,488 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:52,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:52,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:52,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:52,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:52,502 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 17:41:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:55,083 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 17:41:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:55,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:41:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:55,833 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 17:41:55,833 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 17:41:55,835 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-27 17:42:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 17:42:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 17:42:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 17:42:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 17:42:07,254 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 17:42:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:07,254 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 17:42:07,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:42:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 17:42:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:07,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:07,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:07,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 17:42:07,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:07,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157270788] [2019-12-27 17:42:07,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:07,395 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-27 17:42:07,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157270788] [2019-12-27 17:42:07,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:07,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:07,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862908972] [2019-12-27 17:42:07,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:07,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:07,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:42:07,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:07,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:07,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:07,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:07,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:07,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:07,449 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 5 states. [2019-12-27 17:42:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:13,314 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 17:42:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:13,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:42:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:13,980 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 17:42:13,980 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 17:42:13,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 17:42:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 17:42:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 17:42:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 17:42:24,046 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 17:42:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:24,046 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 17:42:24,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 17:42:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:24,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:24,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:24,049 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 17:42:24,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:24,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432861240] [2019-12-27 17:42:24,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:24,163 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-27 17:42:24,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432861240] [2019-12-27 17:42:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:24,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:24,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108583953] [2019-12-27 17:42:24,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:24,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:24,168 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:42:24,168 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:24,168 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:24,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:42:24,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:42:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:42:24,170 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 17:42:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:24,251 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-27 17:42:24,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:42:24,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:42:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:24,267 INFO L225 Difference]: With dead ends: 11993 [2019-12-27 17:42:24,267 INFO L226 Difference]: Without dead ends: 8737 [2019-12-27 17:42:24,267 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-27 17:42:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-27 17:42:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-27 17:42:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-27 17:42:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-27 17:42:24,436 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 11 [2019-12-27 17:42:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:24,436 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-27 17:42:24,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:42:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-27 17:42:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:42:24,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:24,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:24,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 17:42:24,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:24,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578886143] [2019-12-27 17:42:24,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:24,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-27 17:42:24,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578886143] [2019-12-27 17:42:24,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:24,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:24,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333354395] [2019-12-27 17:42:24,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:24,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:24,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 17:42:24,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:24,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:24,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:24,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:24,834 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 9 states. [2019-12-27 17:42:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:26,509 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-27 17:42:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:42:26,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 17:42:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:26,523 INFO L225 Difference]: With dead ends: 10286 [2019-12-27 17:42:26,523 INFO L226 Difference]: Without dead ends: 10286 [2019-12-27 17:42:26,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:42:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-27 17:42:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-27 17:42:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-27 17:42:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-27 17:42:26,671 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-27 17:42:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:26,672 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-27 17:42:26,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-27 17:42:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:42:26,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:26,679 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] [2019-12-27 17:42:26,679 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 17:42:26,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:26,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542027769] [2019-12-27 17:42:26,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:26,775 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-27 17:42:26,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542027769] [2019-12-27 17:42:26,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:26,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:26,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597954257] [2019-12-27 17:42:26,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:26,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:26,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 17:42:26,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:26,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:26,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:26,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:26,868 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 9 states. [2019-12-27 17:42:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:28,200 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-27 17:42:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:42:28,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 17:42:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:28,215 INFO L225 Difference]: With dead ends: 11186 [2019-12-27 17:42:28,215 INFO L226 Difference]: Without dead ends: 11138 [2019-12-27 17:42:28,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:42:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-27 17:42:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-27 17:42:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-27 17:42:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-27 17:42:28,352 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-27 17:42:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:28,352 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-27 17:42:28,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-27 17:42:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:42:28,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:28,364 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] [2019-12-27 17:42:28,364 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:28,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:28,365 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 17:42:28,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:28,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149841524] [2019-12-27 17:42:28,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:28,474 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-27 17:42:28,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149841524] [2019-12-27 17:42:28,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:28,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:28,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16342584] [2019-12-27 17:42:28,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:28,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:28,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 17:42:28,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:28,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:28,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:42:28,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:42:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:28,613 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 10 states. [2019-12-27 17:42:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:30,410 INFO L93 Difference]: Finished difference Result 13021 states and 31545 transitions. [2019-12-27 17:42:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:42:30,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 17:42:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:30,428 INFO L225 Difference]: With dead ends: 13021 [2019-12-27 17:42:30,429 INFO L226 Difference]: Without dead ends: 13021 [2019-12-27 17:42:30,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:42:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2019-12-27 17:42:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11791. [2019-12-27 17:42:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-27 17:42:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-27 17:42:30,892 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-27 17:42:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-27 17:42:30,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:42:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-27 17:42:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:42:30,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:30,906 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-27 17:42:30,906 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-27 17:42:30,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:30,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208137104] [2019-12-27 17:42:30,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:31,004 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-27 17:42:31,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208137104] [2019-12-27 17:42:31,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:31,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:31,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2063043289] [2019-12-27 17:42:31,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:31,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:31,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-27 17:42:31,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:31,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:31,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:31,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:31,050 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-27 17:42:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:31,978 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-27 17:42:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:42:31,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 17:42:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:32,000 INFO L225 Difference]: With dead ends: 13152 [2019-12-27 17:42:32,000 INFO L226 Difference]: Without dead ends: 13152 [2019-12-27 17:42:32,001 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-27 17:42:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-27 17:42:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-27 17:42:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-27 17:42:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-27 17:42:32,250 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-27 17:42:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:32,251 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-27 17:42:32,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-27 17:42:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:42:32,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:32,261 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-27 17:42:32,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-27 17:42:32,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:32,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952415074] [2019-12-27 17:42:32,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:32,423 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-27 17:42:32,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952415074] [2019-12-27 17:42:32,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:32,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:32,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599856217] [2019-12-27 17:42:32,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:32,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:32,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-27 17:42:32,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:32,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:32,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:32,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:32,469 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-27 17:42:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:32,691 INFO L93 Difference]: Finished difference Result 13209 states and 31846 transitions. [2019-12-27 17:42:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:32,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:42:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:32,722 INFO L225 Difference]: With dead ends: 13209 [2019-12-27 17:42:32,722 INFO L226 Difference]: Without dead ends: 13009 [2019-12-27 17:42:32,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:42:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2019-12-27 17:42:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 12709. [2019-12-27 17:42:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-27 17:42:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 30712 transitions. [2019-12-27 17:42:33,002 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 30712 transitions. Word has length 58 [2019-12-27 17:42:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:33,003 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 30712 transitions. [2019-12-27 17:42:33,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 30712 transitions. [2019-12-27 17:42:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:42:33,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:33,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:33,022 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1587335685, now seen corresponding path program 1 times [2019-12-27 17:42:33,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:33,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629081026] [2019-12-27 17:42:33,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:33,196 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-27 17:42:33,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629081026] [2019-12-27 17:42:33,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:33,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:33,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699483241] [2019-12-27 17:42:33,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:33,216 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:33,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 220 transitions. [2019-12-27 17:42:33,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:33,306 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:33,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:33,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:33,307 INFO L87 Difference]: Start difference. First operand 12709 states and 30712 transitions. Second operand 6 states. [2019-12-27 17:42:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:33,371 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-27 17:42:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:33,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 17:42:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:33,379 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 17:42:33,380 INFO L226 Difference]: Without dead ends: 5151 [2019-12-27 17:42:33,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-27 17:42:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-27 17:42:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 17:42:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-27 17:42:33,437 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 64 [2019-12-27 17:42:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:33,438 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-27 17:42:33,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-27 17:42:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:33,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:33,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:33,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 17:42:33,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:33,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937135896] [2019-12-27 17:42:33,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:33,541 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-27 17:42:33,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937135896] [2019-12-27 17:42:33,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:33,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:33,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020735887] [2019-12-27 17:42:33,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:33,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:34,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 17:42:34,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:34,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:34,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:34,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:34,005 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-27 17:42:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:34,839 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-27 17:42:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:42:34,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:42:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:34,847 INFO L225 Difference]: With dead ends: 6626 [2019-12-27 17:42:34,848 INFO L226 Difference]: Without dead ends: 6626 [2019-12-27 17:42:34,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-27 17:42:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-27 17:42:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-27 17:42:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-27 17:42:34,917 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-27 17:42:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:34,917 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-27 17:42:34,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-27 17:42:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:34,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:34,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:34,926 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-27 17:42:34,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:34,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959828470] [2019-12-27 17:42:34,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:35,038 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-27 17:42:35,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959828470] [2019-12-27 17:42:35,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:35,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:35,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2100131378] [2019-12-27 17:42:35,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:35,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:35,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 17:42:35,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:35,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:35,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:42:35,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:42:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:35,249 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 8 states. [2019-12-27 17:42:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:37,271 INFO L93 Difference]: Finished difference Result 12997 states and 28624 transitions. [2019-12-27 17:42:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:42:37,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 17:42:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:37,294 INFO L225 Difference]: With dead ends: 12997 [2019-12-27 17:42:37,294 INFO L226 Difference]: Without dead ends: 12997 [2019-12-27 17:42:37,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:42:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12997 states. [2019-12-27 17:42:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12997 to 10216. [2019-12-27 17:42:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10216 states. [2019-12-27 17:42:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10216 states to 10216 states and 22995 transitions. [2019-12-27 17:42:37,496 INFO L78 Accepts]: Start accepts. Automaton has 10216 states and 22995 transitions. Word has length 94 [2019-12-27 17:42:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:37,496 INFO L462 AbstractCegarLoop]: Abstraction has 10216 states and 22995 transitions. [2019-12-27 17:42:37,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:42:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 10216 states and 22995 transitions. [2019-12-27 17:42:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:37,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:37,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:37,510 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-27 17:42:37,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:37,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523177977] [2019-12-27 17:42:37,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:37,604 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-27 17:42:37,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523177977] [2019-12-27 17:42:37,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:37,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:37,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724796387] [2019-12-27 17:42:37,605 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:37,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:38,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 17:42:38,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:38,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:42:38,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:38,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:38,162 INFO L87 Difference]: Start difference. First operand 10216 states and 22995 transitions. Second operand 5 states. [2019-12-27 17:42:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:38,702 INFO L93 Difference]: Finished difference Result 10999 states and 24590 transitions. [2019-12-27 17:42:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:42:38,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 17:42:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:38,714 INFO L225 Difference]: With dead ends: 10999 [2019-12-27 17:42:38,715 INFO L226 Difference]: Without dead ends: 10999 [2019-12-27 17:42:38,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-27 17:42:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10999 states. [2019-12-27 17:42:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10999 to 10435. [2019-12-27 17:42:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10435 states. [2019-12-27 17:42:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10435 states to 10435 states and 23490 transitions. [2019-12-27 17:42:38,838 INFO L78 Accepts]: Start accepts. Automaton has 10435 states and 23490 transitions. Word has length 94 [2019-12-27 17:42:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:38,839 INFO L462 AbstractCegarLoop]: Abstraction has 10435 states and 23490 transitions. [2019-12-27 17:42:38,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10435 states and 23490 transitions. [2019-12-27 17:42:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:38,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:38,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:38,854 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:38,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:38,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-27 17:42:38,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:38,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824012668] [2019-12-27 17:42:38,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:38,969 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-27 17:42:38,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824012668] [2019-12-27 17:42:38,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:38,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:38,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198588034] [2019-12-27 17:42:38,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:39,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:39,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 240 transitions. [2019-12-27 17:42:39,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:39,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:39,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:39,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:39,215 INFO L87 Difference]: Start difference. First operand 10435 states and 23490 transitions. Second operand 6 states. [2019-12-27 17:42:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:39,926 INFO L93 Difference]: Finished difference Result 10825 states and 24231 transitions. [2019-12-27 17:42:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:39,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:42:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:39,938 INFO L225 Difference]: With dead ends: 10825 [2019-12-27 17:42:39,938 INFO L226 Difference]: Without dead ends: 10825 [2019-12-27 17:42:39,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10825 states. [2019-12-27 17:42:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10825 to 10549. [2019-12-27 17:42:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10549 states. [2019-12-27 17:42:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 23717 transitions. [2019-12-27 17:42:40,055 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 23717 transitions. Word has length 94 [2019-12-27 17:42:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:40,055 INFO L462 AbstractCegarLoop]: Abstraction has 10549 states and 23717 transitions. [2019-12-27 17:42:40,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 23717 transitions. [2019-12-27 17:42:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:40,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:40,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:40,067 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-27 17:42:40,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:40,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025788194] [2019-12-27 17:42:40,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:40,243 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-27 17:42:40,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025788194] [2019-12-27 17:42:40,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:40,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:42:40,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164519287] [2019-12-27 17:42:40,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:40,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:40,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 232 transitions. [2019-12-27 17:42:40,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:40,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:40,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:40,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:40,911 INFO L87 Difference]: Start difference. First operand 10549 states and 23717 transitions. Second operand 9 states. [2019-12-27 17:42:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:41,769 INFO L93 Difference]: Finished difference Result 16994 states and 37913 transitions. [2019-12-27 17:42:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:42:41,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:42:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:41,785 INFO L225 Difference]: With dead ends: 16994 [2019-12-27 17:42:41,785 INFO L226 Difference]: Without dead ends: 14166 [2019-12-27 17:42:41,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:42:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14166 states. [2019-12-27 17:42:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14166 to 12192. [2019-12-27 17:42:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12192 states. [2019-12-27 17:42:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12192 states to 12192 states and 27357 transitions. [2019-12-27 17:42:41,933 INFO L78 Accepts]: Start accepts. Automaton has 12192 states and 27357 transitions. Word has length 94 [2019-12-27 17:42:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:41,933 INFO L462 AbstractCegarLoop]: Abstraction has 12192 states and 27357 transitions. [2019-12-27 17:42:41,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12192 states and 27357 transitions. [2019-12-27 17:42:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:41,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:41,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:41,946 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 644265771, now seen corresponding path program 6 times [2019-12-27 17:42:41,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:41,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046447321] [2019-12-27 17:42:41,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:42,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046447321] [2019-12-27 17:42:42,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:42,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:42,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536555588] [2019-12-27 17:42:42,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:42,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:42,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 175 transitions. [2019-12-27 17:42:42,272 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:42,283 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:42:42,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:42,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:42,284 INFO L87 Difference]: Start difference. First operand 12192 states and 27357 transitions. Second operand 6 states. [2019-12-27 17:42:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:42,899 INFO L93 Difference]: Finished difference Result 12824 states and 28576 transitions. [2019-12-27 17:42:42,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:42,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:42:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:42,914 INFO L225 Difference]: With dead ends: 12824 [2019-12-27 17:42:42,914 INFO L226 Difference]: Without dead ends: 12824 [2019-12-27 17:42:42,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12824 states. [2019-12-27 17:42:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12824 to 12360. [2019-12-27 17:42:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12360 states. [2019-12-27 17:42:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12360 states to 12360 states and 27690 transitions. [2019-12-27 17:42:43,051 INFO L78 Accepts]: Start accepts. Automaton has 12360 states and 27690 transitions. Word has length 94 [2019-12-27 17:42:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:43,051 INFO L462 AbstractCegarLoop]: Abstraction has 12360 states and 27690 transitions. [2019-12-27 17:42:43,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 12360 states and 27690 transitions. [2019-12-27 17:42:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:43,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:43,062 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash 12884261, now seen corresponding path program 7 times [2019-12-27 17:42:43,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:43,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800205847] [2019-12-27 17:42:43,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:43,165 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-27 17:42:43,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800205847] [2019-12-27 17:42:43,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:43,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:43,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274394938] [2019-12-27 17:42:43,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:43,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:43,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 181 transitions. [2019-12-27 17:42:43,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:43,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:42:43,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:42:43,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:42:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:43,690 INFO L87 Difference]: Start difference. First operand 12360 states and 27690 transitions. Second operand 8 states. [2019-12-27 17:42:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:45,548 INFO L93 Difference]: Finished difference Result 36935 states and 81877 transitions. [2019-12-27 17:42:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:42:45,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 17:42:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:45,588 INFO L225 Difference]: With dead ends: 36935 [2019-12-27 17:42:45,588 INFO L226 Difference]: Without dead ends: 36935 [2019-12-27 17:42:45,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:42:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36935 states. [2019-12-27 17:42:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36935 to 16032. [2019-12-27 17:42:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16032 states. [2019-12-27 17:42:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16032 states to 16032 states and 36051 transitions. [2019-12-27 17:42:45,872 INFO L78 Accepts]: Start accepts. Automaton has 16032 states and 36051 transitions. Word has length 94 [2019-12-27 17:42:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:45,872 INFO L462 AbstractCegarLoop]: Abstraction has 16032 states and 36051 transitions. [2019-12-27 17:42:45,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:42:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 16032 states and 36051 transitions. [2019-12-27 17:42:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:45,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:45,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:45,890 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash -734364891, now seen corresponding path program 8 times [2019-12-27 17:42:45,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:45,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750709724] [2019-12-27 17:42:45,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:45,986 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-27 17:42:45,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750709724] [2019-12-27 17:42:45,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:45,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:45,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707093814] [2019-12-27 17:42:45,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:46,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:46,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 177 transitions. [2019-12-27 17:42:46,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:46,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:42:46,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:46,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:46,241 INFO L87 Difference]: Start difference. First operand 16032 states and 36051 transitions. Second operand 9 states. [2019-12-27 17:42:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:48,596 INFO L93 Difference]: Finished difference Result 36749 states and 81516 transitions. [2019-12-27 17:42:48,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:42:48,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:42:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:48,636 INFO L225 Difference]: With dead ends: 36749 [2019-12-27 17:42:48,636 INFO L226 Difference]: Without dead ends: 36749 [2019-12-27 17:42:48,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:42:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36749 states. [2019-12-27 17:42:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36749 to 15826. [2019-12-27 17:42:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15826 states. [2019-12-27 17:42:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15826 states to 15826 states and 35607 transitions. [2019-12-27 17:42:49,226 INFO L78 Accepts]: Start accepts. Automaton has 15826 states and 35607 transitions. Word has length 94 [2019-12-27 17:42:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:49,227 INFO L462 AbstractCegarLoop]: Abstraction has 15826 states and 35607 transitions. [2019-12-27 17:42:49,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 15826 states and 35607 transitions. [2019-12-27 17:42:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:49,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:49,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:49,244 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1144573815, now seen corresponding path program 9 times [2019-12-27 17:42:49,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:49,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501133884] [2019-12-27 17:42:49,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:49,366 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-27 17:42:49,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501133884] [2019-12-27 17:42:49,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:49,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:49,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474197057] [2019-12-27 17:42:49,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:49,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:49,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 207 transitions. [2019-12-27 17:42:49,630 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:49,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:42:49,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:42:49,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:42:49,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:42:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:49,713 INFO L87 Difference]: Start difference. First operand 15826 states and 35607 transitions. Second operand 10 states. [2019-12-27 17:42:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:52,771 INFO L93 Difference]: Finished difference Result 39814 states and 88058 transitions. [2019-12-27 17:42:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:42:52,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-12-27 17:42:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:52,818 INFO L225 Difference]: With dead ends: 39814 [2019-12-27 17:42:52,819 INFO L226 Difference]: Without dead ends: 39814 [2019-12-27 17:42:52,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:42:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39814 states. [2019-12-27 17:42:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39814 to 15868. [2019-12-27 17:42:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15868 states. [2019-12-27 17:42:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15868 states to 15868 states and 35703 transitions. [2019-12-27 17:42:53,141 INFO L78 Accepts]: Start accepts. Automaton has 15868 states and 35703 transitions. Word has length 94 [2019-12-27 17:42:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:53,142 INFO L462 AbstractCegarLoop]: Abstraction has 15868 states and 35703 transitions. [2019-12-27 17:42:53,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:42:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15868 states and 35703 transitions. [2019-12-27 17:42:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:53,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:53,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:53,156 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 724908229, now seen corresponding path program 10 times [2019-12-27 17:42:53,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:53,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566166463] [2019-12-27 17:42:53,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:53,247 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-27 17:42:53,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566166463] [2019-12-27 17:42:53,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:53,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:53,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797056880] [2019-12-27 17:42:53,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:53,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:53,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 200 transitions. [2019-12-27 17:42:53,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:53,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:42:53,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:42:53,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:53,904 INFO L87 Difference]: Start difference. First operand 15868 states and 35703 transitions. Second operand 9 states. [2019-12-27 17:42:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:56,409 INFO L93 Difference]: Finished difference Result 23171 states and 50984 transitions. [2019-12-27 17:42:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:42:56,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:42:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:56,435 INFO L225 Difference]: With dead ends: 23171 [2019-12-27 17:42:56,435 INFO L226 Difference]: Without dead ends: 23171 [2019-12-27 17:42:56,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:42:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23171 states. [2019-12-27 17:42:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23171 to 15887. [2019-12-27 17:42:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15887 states. [2019-12-27 17:42:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15887 states to 15887 states and 35771 transitions. [2019-12-27 17:42:56,660 INFO L78 Accepts]: Start accepts. Automaton has 15887 states and 35771 transitions. Word has length 94 [2019-12-27 17:42:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:56,660 INFO L462 AbstractCegarLoop]: Abstraction has 15887 states and 35771 transitions. [2019-12-27 17:42:56,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15887 states and 35771 transitions. [2019-12-27 17:42:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:56,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:56,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:56,674 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-27 17:42:56,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:56,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167409082] [2019-12-27 17:42:56,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:56,802 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-27 17:42:56,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167409082] [2019-12-27 17:42:56,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:56,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:56,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781166438] [2019-12-27 17:42:56,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:56,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:56,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 228 transitions. [2019-12-27 17:42:56,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:56,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:42:57,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:57,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:42:57,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:42:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:57,027 INFO L87 Difference]: Start difference. First operand 15887 states and 35771 transitions. Second operand 8 states. [2019-12-27 17:42:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:58,014 INFO L93 Difference]: Finished difference Result 17145 states and 38298 transitions. [2019-12-27 17:42:58,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:42:58,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 17:42:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:58,037 INFO L225 Difference]: With dead ends: 17145 [2019-12-27 17:42:58,037 INFO L226 Difference]: Without dead ends: 17145 [2019-12-27 17:42:58,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:42:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17145 states. [2019-12-27 17:42:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17145 to 15932. [2019-12-27 17:42:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15932 states. [2019-12-27 17:42:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15932 states to 15932 states and 35882 transitions. [2019-12-27 17:42:58,251 INFO L78 Accepts]: Start accepts. Automaton has 15932 states and 35882 transitions. Word has length 95 [2019-12-27 17:42:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:58,251 INFO L462 AbstractCegarLoop]: Abstraction has 15932 states and 35882 transitions. [2019-12-27 17:42:58,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:42:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15932 states and 35882 transitions. [2019-12-27 17:42:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:58,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:58,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:42:58,268 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 2 times [2019-12-27 17:42:58,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:58,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233160234] [2019-12-27 17:42:58,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:58,717 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-27 17:42:58,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233160234] [2019-12-27 17:42:58,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:58,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:42:58,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280253496] [2019-12-27 17:42:58,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:58,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:58,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 17:42:58,862 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:58,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:42:58,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:42:58,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:42:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:58,874 INFO L87 Difference]: Start difference. First operand 15932 states and 35882 transitions. Second operand 10 states. [2019-12-27 17:42:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:59,980 INFO L93 Difference]: Finished difference Result 33189 states and 73331 transitions. [2019-12-27 17:42:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:42:59,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 17:42:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:00,014 INFO L225 Difference]: With dead ends: 33189 [2019-12-27 17:43:00,014 INFO L226 Difference]: Without dead ends: 30387 [2019-12-27 17:43:00,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:43:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30387 states. [2019-12-27 17:43:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30387 to 20130. [2019-12-27 17:43:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20130 states. [2019-12-27 17:43:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20130 states to 20130 states and 45769 transitions. [2019-12-27 17:43:00,314 INFO L78 Accepts]: Start accepts. Automaton has 20130 states and 45769 transitions. Word has length 95 [2019-12-27 17:43:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:00,314 INFO L462 AbstractCegarLoop]: Abstraction has 20130 states and 45769 transitions. [2019-12-27 17:43:00,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20130 states and 45769 transitions. [2019-12-27 17:43:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:00,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:00,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:00,333 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:00,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:00,333 INFO L82 PathProgramCache]: Analyzing trace with hash 655556820, now seen corresponding path program 3 times [2019-12-27 17:43:00,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:00,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440026270] [2019-12-27 17:43:00,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:00,405 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-27 17:43:00,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440026270] [2019-12-27 17:43:00,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:00,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:43:00,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258358866] [2019-12-27 17:43:00,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:00,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:00,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 165 transitions. [2019-12-27 17:43:00,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:00,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:00,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:43:00,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:43:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:00,616 INFO L87 Difference]: Start difference. First operand 20130 states and 45769 transitions. Second operand 3 states. [2019-12-27 17:43:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:00,767 INFO L93 Difference]: Finished difference Result 20130 states and 45768 transitions. [2019-12-27 17:43:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:43:00,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 17:43:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:00,803 INFO L225 Difference]: With dead ends: 20130 [2019-12-27 17:43:00,803 INFO L226 Difference]: Without dead ends: 20130 [2019-12-27 17:43:00,804 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-27 17:43:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20130 states. [2019-12-27 17:43:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20130 to 19657. [2019-12-27 17:43:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19657 states. [2019-12-27 17:43:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19657 states to 19657 states and 44834 transitions. [2019-12-27 17:43:01,240 INFO L78 Accepts]: Start accepts. Automaton has 19657 states and 44834 transitions. Word has length 95 [2019-12-27 17:43:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:01,240 INFO L462 AbstractCegarLoop]: Abstraction has 19657 states and 44834 transitions. [2019-12-27 17:43:01,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:43:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 19657 states and 44834 transitions. [2019-12-27 17:43:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:01,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:01,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:01,269 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 1 times [2019-12-27 17:43:01,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:01,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634440491] [2019-12-27 17:43:01,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:01,338 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-27 17:43:01,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634440491] [2019-12-27 17:43:01,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:01,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:43:01,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [326141295] [2019-12-27 17:43:01,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:01,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:01,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 174 transitions. [2019-12-27 17:43:01,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:01,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:01,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:43:01,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:43:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:01,921 INFO L87 Difference]: Start difference. First operand 19657 states and 44834 transitions. Second operand 3 states. [2019-12-27 17:43:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:01,991 INFO L93 Difference]: Finished difference Result 14850 states and 34264 transitions. [2019-12-27 17:43:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:43:01,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 17:43:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:02,007 INFO L225 Difference]: With dead ends: 14850 [2019-12-27 17:43:02,007 INFO L226 Difference]: Without dead ends: 14850 [2019-12-27 17:43:02,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14850 states. [2019-12-27 17:43:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14850 to 14836. [2019-12-27 17:43:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14836 states. [2019-12-27 17:43:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14836 states to 14836 states and 34238 transitions. [2019-12-27 17:43:02,183 INFO L78 Accepts]: Start accepts. Automaton has 14836 states and 34238 transitions. Word has length 95 [2019-12-27 17:43:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:02,183 INFO L462 AbstractCegarLoop]: Abstraction has 14836 states and 34238 transitions. [2019-12-27 17:43:02,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:43:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14836 states and 34238 transitions. [2019-12-27 17:43:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:02,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:02,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:02,198 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 1 times [2019-12-27 17:43:02,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:02,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303681370] [2019-12-27 17:43:02,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:02,343 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-27 17:43:02,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303681370] [2019-12-27 17:43:02,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1869470407] [2019-12-27 17:43:02,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:02,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:02,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 213 transitions. [2019-12-27 17:43:02,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:02,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:02,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:02,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:02,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:02,611 INFO L87 Difference]: Start difference. First operand 14836 states and 34238 transitions. Second operand 11 states. [2019-12-27 17:43:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:06,207 INFO L93 Difference]: Finished difference Result 48465 states and 110591 transitions. [2019-12-27 17:43:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 17:43:06,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:43:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:06,258 INFO L225 Difference]: With dead ends: 48465 [2019-12-27 17:43:06,258 INFO L226 Difference]: Without dead ends: 46059 [2019-12-27 17:43:06,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=1664, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 17:43:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46059 states. [2019-12-27 17:43:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46059 to 22738. [2019-12-27 17:43:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22738 states. [2019-12-27 17:43:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22738 states to 22738 states and 52637 transitions. [2019-12-27 17:43:06,657 INFO L78 Accepts]: Start accepts. Automaton has 22738 states and 52637 transitions. Word has length 96 [2019-12-27 17:43:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:06,658 INFO L462 AbstractCegarLoop]: Abstraction has 22738 states and 52637 transitions. [2019-12-27 17:43:06,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22738 states and 52637 transitions. [2019-12-27 17:43:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:06,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:06,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:06,679 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 633350286, now seen corresponding path program 2 times [2019-12-27 17:43:06,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:06,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305689052] [2019-12-27 17:43:06,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:07,144 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-27 17:43:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305689052] [2019-12-27 17:43:07,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:07,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:43:07,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836683483] [2019-12-27 17:43:07,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:07,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:07,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 328 transitions. [2019-12-27 17:43:07,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:07,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 17:43:07,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:43:07,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:07,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:43:07,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:43:07,483 INFO L87 Difference]: Start difference. First operand 22738 states and 52637 transitions. Second operand 14 states. [2019-12-27 17:43:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:11,493 INFO L93 Difference]: Finished difference Result 35766 states and 82010 transitions. [2019-12-27 17:43:11,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 17:43:11,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:43:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:11,536 INFO L225 Difference]: With dead ends: 35766 [2019-12-27 17:43:11,536 INFO L226 Difference]: Without dead ends: 35766 [2019-12-27 17:43:11,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 17:43:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35766 states. [2019-12-27 17:43:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35766 to 25845. [2019-12-27 17:43:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25845 states. [2019-12-27 17:43:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25845 states to 25845 states and 60369 transitions. [2019-12-27 17:43:11,979 INFO L78 Accepts]: Start accepts. Automaton has 25845 states and 60369 transitions. Word has length 96 [2019-12-27 17:43:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:11,979 INFO L462 AbstractCegarLoop]: Abstraction has 25845 states and 60369 transitions. [2019-12-27 17:43:11,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:43:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 25845 states and 60369 transitions. [2019-12-27 17:43:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:12,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:12,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:12,004 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 3 times [2019-12-27 17:43:12,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:12,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307085411] [2019-12-27 17:43:12,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:12,181 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-27 17:43:12,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307085411] [2019-12-27 17:43:12,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:12,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:12,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [59716810] [2019-12-27 17:43:12,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:12,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:12,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 17:43:12,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:12,738 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:12,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:12,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:12,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:12,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:12,739 INFO L87 Difference]: Start difference. First operand 25845 states and 60369 transitions. Second operand 10 states. [2019-12-27 17:43:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:13,650 INFO L93 Difference]: Finished difference Result 38317 states and 88149 transitions. [2019-12-27 17:43:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:43:13,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:43:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:13,695 INFO L225 Difference]: With dead ends: 38317 [2019-12-27 17:43:13,695 INFO L226 Difference]: Without dead ends: 36796 [2019-12-27 17:43:13,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:43:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36796 states. [2019-12-27 17:43:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36796 to 29667. [2019-12-27 17:43:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29667 states. [2019-12-27 17:43:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29667 states to 29667 states and 69623 transitions. [2019-12-27 17:43:14,154 INFO L78 Accepts]: Start accepts. Automaton has 29667 states and 69623 transitions. Word has length 96 [2019-12-27 17:43:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:14,154 INFO L462 AbstractCegarLoop]: Abstraction has 29667 states and 69623 transitions. [2019-12-27 17:43:14,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 29667 states and 69623 transitions. [2019-12-27 17:43:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:14,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:14,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:14,186 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 4 times [2019-12-27 17:43:14,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:14,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840537314] [2019-12-27 17:43:14,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:14,427 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-27 17:43:14,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840537314] [2019-12-27 17:43:14,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:14,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:43:14,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281101291] [2019-12-27 17:43:14,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:14,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:14,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 17:43:14,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:14,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:43:14,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:43:14,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:43:14,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:14,687 INFO L87 Difference]: Start difference. First operand 29667 states and 69623 transitions. Second operand 16 states. [2019-12-27 17:43:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:16,029 INFO L93 Difference]: Finished difference Result 39414 states and 91847 transitions. [2019-12-27 17:43:16,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:43:16,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 17:43:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:16,073 INFO L225 Difference]: With dead ends: 39414 [2019-12-27 17:43:16,073 INFO L226 Difference]: Without dead ends: 39251 [2019-12-27 17:43:16,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:43:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39251 states. [2019-12-27 17:43:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39251 to 34556. [2019-12-27 17:43:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34556 states. [2019-12-27 17:43:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34556 states to 34556 states and 81183 transitions. [2019-12-27 17:43:16,494 INFO L78 Accepts]: Start accepts. Automaton has 34556 states and 81183 transitions. Word has length 96 [2019-12-27 17:43:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:16,494 INFO L462 AbstractCegarLoop]: Abstraction has 34556 states and 81183 transitions. [2019-12-27 17:43:16,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:43:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34556 states and 81183 transitions. [2019-12-27 17:43:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:16,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:16,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:16,525 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1165421684, now seen corresponding path program 5 times [2019-12-27 17:43:16,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:16,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671735683] [2019-12-27 17:43:16,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:16,691 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-27 17:43:16,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671735683] [2019-12-27 17:43:16,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:16,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:16,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272061379] [2019-12-27 17:43:16,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:16,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:17,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 326 transitions. [2019-12-27 17:43:17,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:17,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 17:43:17,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:43:17,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:43:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:17,179 INFO L87 Difference]: Start difference. First operand 34556 states and 81183 transitions. Second operand 12 states. [2019-12-27 17:43:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:20,396 INFO L93 Difference]: Finished difference Result 61325 states and 139199 transitions. [2019-12-27 17:43:20,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 17:43:20,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 17:43:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:20,464 INFO L225 Difference]: With dead ends: 61325 [2019-12-27 17:43:20,464 INFO L226 Difference]: Without dead ends: 59701 [2019-12-27 17:43:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=3050, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 17:43:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59701 states. [2019-12-27 17:43:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59701 to 35292. [2019-12-27 17:43:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35292 states. [2019-12-27 17:43:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35292 states to 35292 states and 83001 transitions. [2019-12-27 17:43:21,100 INFO L78 Accepts]: Start accepts. Automaton has 35292 states and 83001 transitions. Word has length 96 [2019-12-27 17:43:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:21,100 INFO L462 AbstractCegarLoop]: Abstraction has 35292 states and 83001 transitions. [2019-12-27 17:43:21,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:43:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35292 states and 83001 transitions. [2019-12-27 17:43:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:21,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:21,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:21,131 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash 353580028, now seen corresponding path program 6 times [2019-12-27 17:43:21,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:21,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096189842] [2019-12-27 17:43:21,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:21,222 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-27 17:43:21,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096189842] [2019-12-27 17:43:21,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:21,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:21,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217507377] [2019-12-27 17:43:21,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:21,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:21,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 189 transitions. [2019-12-27 17:43:21,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:21,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:21,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:21,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:43:21,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:21,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:21,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:21,894 INFO L87 Difference]: Start difference. First operand 35292 states and 83001 transitions. Second operand 11 states. [2019-12-27 17:43:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:23,525 INFO L93 Difference]: Finished difference Result 53442 states and 123837 transitions. [2019-12-27 17:43:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:43:23,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:43:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:23,590 INFO L225 Difference]: With dead ends: 53442 [2019-12-27 17:43:23,590 INFO L226 Difference]: Without dead ends: 51738 [2019-12-27 17:43:23,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:43:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51738 states. [2019-12-27 17:43:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51738 to 35967. [2019-12-27 17:43:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35967 states. [2019-12-27 17:43:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35967 states to 35967 states and 84501 transitions. [2019-12-27 17:43:24,120 INFO L78 Accepts]: Start accepts. Automaton has 35967 states and 84501 transitions. Word has length 96 [2019-12-27 17:43:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:24,120 INFO L462 AbstractCegarLoop]: Abstraction has 35967 states and 84501 transitions. [2019-12-27 17:43:24,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35967 states and 84501 transitions. [2019-12-27 17:43:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:24,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:24,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:24,155 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash 277516946, now seen corresponding path program 7 times [2019-12-27 17:43:24,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:24,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655812725] [2019-12-27 17:43:24,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:24,342 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-27 17:43:24,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655812725] [2019-12-27 17:43:24,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:24,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:43:24,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474087192] [2019-12-27 17:43:24,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:24,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:24,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 182 transitions. [2019-12-27 17:43:24,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:24,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:24,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:24,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:43:24,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:43:24,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:43:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:24,723 INFO L87 Difference]: Start difference. First operand 35967 states and 84501 transitions. Second operand 16 states. [2019-12-27 17:43:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:31,289 INFO L93 Difference]: Finished difference Result 63540 states and 146013 transitions. [2019-12-27 17:43:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 17:43:31,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 17:43:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:31,374 INFO L225 Difference]: With dead ends: 63540 [2019-12-27 17:43:31,374 INFO L226 Difference]: Without dead ends: 62756 [2019-12-27 17:43:31,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=519, Invalid=2451, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 17:43:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62756 states. [2019-12-27 17:43:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62756 to 36268. [2019-12-27 17:43:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36268 states. [2019-12-27 17:43:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36268 states to 36268 states and 85249 transitions. [2019-12-27 17:43:32,065 INFO L78 Accepts]: Start accepts. Automaton has 36268 states and 85249 transitions. Word has length 96 [2019-12-27 17:43:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:32,065 INFO L462 AbstractCegarLoop]: Abstraction has 36268 states and 85249 transitions. [2019-12-27 17:43:32,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:43:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 36268 states and 85249 transitions. [2019-12-27 17:43:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:32,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:32,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:32,104 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2017559580, now seen corresponding path program 8 times [2019-12-27 17:43:32,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:32,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176026108] [2019-12-27 17:43:32,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:32,368 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-27 17:43:32,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176026108] [2019-12-27 17:43:32,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:32,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:43:32,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899817527] [2019-12-27 17:43:32,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:32,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:32,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 170 transitions. [2019-12-27 17:43:32,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:32,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:32,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:43:32,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:43:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:32,609 INFO L87 Difference]: Start difference. First operand 36268 states and 85249 transitions. Second operand 15 states. [2019-12-27 17:43:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:35,667 INFO L93 Difference]: Finished difference Result 49155 states and 113238 transitions. [2019-12-27 17:43:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 17:43:35,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 17:43:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:35,736 INFO L225 Difference]: With dead ends: 49155 [2019-12-27 17:43:35,737 INFO L226 Difference]: Without dead ends: 49155 [2019-12-27 17:43:35,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:43:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49155 states. [2019-12-27 17:43:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49155 to 37829. [2019-12-27 17:43:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37829 states. [2019-12-27 17:43:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37829 states to 37829 states and 88553 transitions. [2019-12-27 17:43:36,508 INFO L78 Accepts]: Start accepts. Automaton has 37829 states and 88553 transitions. Word has length 96 [2019-12-27 17:43:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:36,508 INFO L462 AbstractCegarLoop]: Abstraction has 37829 states and 88553 transitions. [2019-12-27 17:43:36,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:43:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37829 states and 88553 transitions. [2019-12-27 17:43:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:36,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:36,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:36,543 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2139042026, now seen corresponding path program 9 times [2019-12-27 17:43:36,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:36,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5607097] [2019-12-27 17:43:36,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:36,682 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-27 17:43:36,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5607097] [2019-12-27 17:43:36,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:36,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:36,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50307936] [2019-12-27 17:43:36,683 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:36,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:36,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 250 transitions. [2019-12-27 17:43:36,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:37,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:37,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:37,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:37,014 INFO L87 Difference]: Start difference. First operand 37829 states and 88553 transitions. Second operand 10 states. [2019-12-27 17:43:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:38,311 INFO L93 Difference]: Finished difference Result 61847 states and 143422 transitions. [2019-12-27 17:43:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 17:43:38,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:43:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:38,397 INFO L225 Difference]: With dead ends: 61847 [2019-12-27 17:43:38,397 INFO L226 Difference]: Without dead ends: 61283 [2019-12-27 17:43:38,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:43:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61283 states. [2019-12-27 17:43:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61283 to 41209. [2019-12-27 17:43:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41209 states. [2019-12-27 17:43:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41209 states to 41209 states and 96908 transitions. [2019-12-27 17:43:39,108 INFO L78 Accepts]: Start accepts. Automaton has 41209 states and 96908 transitions. Word has length 96 [2019-12-27 17:43:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:39,109 INFO L462 AbstractCegarLoop]: Abstraction has 41209 states and 96908 transitions. [2019-12-27 17:43:39,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 41209 states and 96908 transitions. [2019-12-27 17:43:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:39,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:39,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:39,152 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash -202074464, now seen corresponding path program 10 times [2019-12-27 17:43:39,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:39,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414691151] [2019-12-27 17:43:39,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:39,242 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-27 17:43:39,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414691151] [2019-12-27 17:43:39,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:39,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:39,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033793645] [2019-12-27 17:43:39,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:39,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:39,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 220 transitions. [2019-12-27 17:43:39,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:39,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:43:39,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:43:39,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:43:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:43:39,442 INFO L87 Difference]: Start difference. First operand 41209 states and 96908 transitions. Second operand 7 states. [2019-12-27 17:43:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:40,123 INFO L93 Difference]: Finished difference Result 48697 states and 113038 transitions. [2019-12-27 17:43:40,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:43:40,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-27 17:43:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:40,179 INFO L225 Difference]: With dead ends: 48697 [2019-12-27 17:43:40,179 INFO L226 Difference]: Without dead ends: 47945 [2019-12-27 17:43:40,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47945 states. [2019-12-27 17:43:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47945 to 41519. [2019-12-27 17:43:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41519 states. [2019-12-27 17:43:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41519 states to 41519 states and 97592 transitions. [2019-12-27 17:43:40,776 INFO L78 Accepts]: Start accepts. Automaton has 41519 states and 97592 transitions. Word has length 96 [2019-12-27 17:43:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:40,777 INFO L462 AbstractCegarLoop]: Abstraction has 41519 states and 97592 transitions. [2019-12-27 17:43:40,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:43:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41519 states and 97592 transitions. [2019-12-27 17:43:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:40,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:40,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:40,815 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:40,816 INFO L82 PathProgramCache]: Analyzing trace with hash -965764708, now seen corresponding path program 11 times [2019-12-27 17:43:40,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:40,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343108308] [2019-12-27 17:43:40,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:40,961 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-27 17:43:40,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343108308] [2019-12-27 17:43:40,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:40,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:40,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578565374] [2019-12-27 17:43:40,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:40,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:41,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 177 transitions. [2019-12-27 17:43:41,102 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:41,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:41,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:43:41,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:43:41,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:43:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:43:41,148 INFO L87 Difference]: Start difference. First operand 41519 states and 97592 transitions. Second operand 7 states. [2019-12-27 17:43:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:41,791 INFO L93 Difference]: Finished difference Result 41550 states and 97548 transitions. [2019-12-27 17:43:41,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:43:41,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-27 17:43:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:41,844 INFO L225 Difference]: With dead ends: 41550 [2019-12-27 17:43:41,844 INFO L226 Difference]: Without dead ends: 41550 [2019-12-27 17:43:41,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41550 states. [2019-12-27 17:43:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41550 to 41187. [2019-12-27 17:43:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41187 states. [2019-12-27 17:43:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41187 states to 41187 states and 96820 transitions. [2019-12-27 17:43:42,354 INFO L78 Accepts]: Start accepts. Automaton has 41187 states and 96820 transitions. Word has length 96 [2019-12-27 17:43:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:42,354 INFO L462 AbstractCegarLoop]: Abstraction has 41187 states and 96820 transitions. [2019-12-27 17:43:42,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:43:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 41187 states and 96820 transitions. [2019-12-27 17:43:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:42,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:42,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:42,393 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 888465312, now seen corresponding path program 12 times [2019-12-27 17:43:42,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:42,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443392767] [2019-12-27 17:43:42,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:42,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443392767] [2019-12-27 17:43:42,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:42,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:42,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153097469] [2019-12-27 17:43:42,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:42,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:42,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 160 transitions. [2019-12-27 17:43:42,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:42,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:42,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:42,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:42,654 INFO L87 Difference]: Start difference. First operand 41187 states and 96820 transitions. Second operand 8 states. [2019-12-27 17:43:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:43,587 INFO L93 Difference]: Finished difference Result 50241 states and 116129 transitions. [2019-12-27 17:43:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:43:43,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-27 17:43:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:43,642 INFO L225 Difference]: With dead ends: 50241 [2019-12-27 17:43:43,642 INFO L226 Difference]: Without dead ends: 47849 [2019-12-27 17:43:43,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47849 states. [2019-12-27 17:43:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47849 to 41864. [2019-12-27 17:43:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41864 states. [2019-12-27 17:43:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41864 states to 41864 states and 98407 transitions. [2019-12-27 17:43:44,185 INFO L78 Accepts]: Start accepts. Automaton has 41864 states and 98407 transitions. Word has length 96 [2019-12-27 17:43:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:44,185 INFO L462 AbstractCegarLoop]: Abstraction has 41864 states and 98407 transitions. [2019-12-27 17:43:44,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 41864 states and 98407 transitions. [2019-12-27 17:43:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:44,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:44,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:44,223 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:44,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:44,223 INFO L82 PathProgramCache]: Analyzing trace with hash 124775068, now seen corresponding path program 13 times [2019-12-27 17:43:44,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:44,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763536335] [2019-12-27 17:43:44,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:44,372 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-27 17:43:44,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763536335] [2019-12-27 17:43:44,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:44,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:44,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800795454] [2019-12-27 17:43:44,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:44,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:44,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 213 transitions. [2019-12-27 17:43:44,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:44,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 17:43:44,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:43:44,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:44,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:43:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:43:44,611 INFO L87 Difference]: Start difference. First operand 41864 states and 98407 transitions. Second operand 14 states. [2019-12-27 17:43:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:48,022 INFO L93 Difference]: Finished difference Result 67063 states and 153753 transitions. [2019-12-27 17:43:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 17:43:48,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:43:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:48,101 INFO L225 Difference]: With dead ends: 67063 [2019-12-27 17:43:48,101 INFO L226 Difference]: Without dead ends: 64053 [2019-12-27 17:43:48,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=3101, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 17:43:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64053 states. [2019-12-27 17:43:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64053 to 47620. [2019-12-27 17:43:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47620 states. [2019-12-27 17:43:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47620 states to 47620 states and 111818 transitions. [2019-12-27 17:43:49,179 INFO L78 Accepts]: Start accepts. Automaton has 47620 states and 111818 transitions. Word has length 96 [2019-12-27 17:43:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:49,180 INFO L462 AbstractCegarLoop]: Abstraction has 47620 states and 111818 transitions. [2019-12-27 17:43:49,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:43:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47620 states and 111818 transitions. [2019-12-27 17:43:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:49,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:49,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:49,224 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 138397884, now seen corresponding path program 14 times [2019-12-27 17:43:49,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:49,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707884469] [2019-12-27 17:43:49,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:49,504 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-27 17:43:49,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707884469] [2019-12-27 17:43:49,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:49,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:43:49,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178107559] [2019-12-27 17:43:49,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:49,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:49,664 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 218 transitions. [2019-12-27 17:43:49,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:49,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:49,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:43:49,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:43:49,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:49,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:43:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:49,783 INFO L87 Difference]: Start difference. First operand 47620 states and 111818 transitions. Second operand 16 states. [2019-12-27 17:43:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:54,499 INFO L93 Difference]: Finished difference Result 82396 states and 189971 transitions. [2019-12-27 17:43:54,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 17:43:54,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 17:43:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:54,604 INFO L225 Difference]: With dead ends: 82396 [2019-12-27 17:43:54,604 INFO L226 Difference]: Without dead ends: 82396 [2019-12-27 17:43:54,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 17:43:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82396 states. [2019-12-27 17:43:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82396 to 54220. [2019-12-27 17:43:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54220 states. [2019-12-27 17:43:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54220 states to 54220 states and 127962 transitions. [2019-12-27 17:43:56,086 INFO L78 Accepts]: Start accepts. Automaton has 54220 states and 127962 transitions. Word has length 96 [2019-12-27 17:43:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:56,086 INFO L462 AbstractCegarLoop]: Abstraction has 54220 states and 127962 transitions. [2019-12-27 17:43:56,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:43:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 54220 states and 127962 transitions. [2019-12-27 17:43:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:56,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:56,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:43:56,142 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1598558890, now seen corresponding path program 15 times [2019-12-27 17:43:56,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:56,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692535434] [2019-12-27 17:43:56,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:56,305 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-27 17:43:56,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692535434] [2019-12-27 17:43:56,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:56,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:43:56,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274892112] [2019-12-27 17:43:56,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:56,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:56,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 365 transitions. [2019-12-27 17:43:56,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:56,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 17:43:56,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:43:56,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:56,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:43:56,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:56,662 INFO L87 Difference]: Start difference. First operand 54220 states and 127962 transitions. Second operand 15 states. [2019-12-27 17:44:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:01,342 INFO L93 Difference]: Finished difference Result 88026 states and 202122 transitions. [2019-12-27 17:44:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-27 17:44:01,343 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 17:44:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:01,452 INFO L225 Difference]: With dead ends: 88026 [2019-12-27 17:44:01,452 INFO L226 Difference]: Without dead ends: 86181 [2019-12-27 17:44:01,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1210, Invalid=6980, Unknown=0, NotChecked=0, Total=8190 [2019-12-27 17:44:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86181 states. [2019-12-27 17:44:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86181 to 54806. [2019-12-27 17:44:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54806 states. [2019-12-27 17:44:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54806 states to 54806 states and 129169 transitions. [2019-12-27 17:44:02,827 INFO L78 Accepts]: Start accepts. Automaton has 54806 states and 129169 transitions. Word has length 96 [2019-12-27 17:44:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:02,827 INFO L462 AbstractCegarLoop]: Abstraction has 54806 states and 129169 transitions. [2019-12-27 17:44:02,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:44:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 54806 states and 129169 transitions. [2019-12-27 17:44:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:02,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:02,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:02,882 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1612181706, now seen corresponding path program 16 times [2019-12-27 17:44:02,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:02,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601556831] [2019-12-27 17:44:02,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:03,035 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-27 17:44:03,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601556831] [2019-12-27 17:44:03,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:03,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:03,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378023545] [2019-12-27 17:44:03,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:03,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:03,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 370 transitions. [2019-12-27 17:44:03,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:03,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:44:03,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:44:03,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:44:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:44:03,333 INFO L87 Difference]: Start difference. First operand 54806 states and 129169 transitions. Second operand 13 states. [2019-12-27 17:44:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:07,291 INFO L93 Difference]: Finished difference Result 93431 states and 211041 transitions. [2019-12-27 17:44:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-12-27 17:44:07,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 17:44:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:07,404 INFO L225 Difference]: With dead ends: 93431 [2019-12-27 17:44:07,405 INFO L226 Difference]: Without dead ends: 90887 [2019-12-27 17:44:07,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=940, Invalid=5866, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 17:44:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90887 states. [2019-12-27 17:44:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90887 to 53943. [2019-12-27 17:44:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53943 states. [2019-12-27 17:44:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53943 states to 53943 states and 126786 transitions. [2019-12-27 17:44:08,801 INFO L78 Accepts]: Start accepts. Automaton has 53943 states and 126786 transitions. Word has length 96 [2019-12-27 17:44:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:08,801 INFO L462 AbstractCegarLoop]: Abstraction has 53943 states and 126786 transitions. [2019-12-27 17:44:08,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:44:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 53943 states and 126786 transitions. [2019-12-27 17:44:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:08,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:08,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:08,852 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash 247628674, now seen corresponding path program 17 times [2019-12-27 17:44:08,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:08,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324789636] [2019-12-27 17:44:08,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:08,979 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-27 17:44:08,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324789636] [2019-12-27 17:44:08,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:08,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:08,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297986532] [2019-12-27 17:44:08,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:09,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:09,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 318 transitions. [2019-12-27 17:44:09,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:09,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:44:09,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:44:09,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:44:09,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:44:09,282 INFO L87 Difference]: Start difference. First operand 53943 states and 126786 transitions. Second operand 14 states. [2019-12-27 17:44:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:12,863 INFO L93 Difference]: Finished difference Result 82593 states and 189205 transitions. [2019-12-27 17:44:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 17:44:12,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:44:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:12,971 INFO L225 Difference]: With dead ends: 82593 [2019-12-27 17:44:12,972 INFO L226 Difference]: Without dead ends: 81365 [2019-12-27 17:44:12,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=915, Invalid=5405, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 17:44:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81365 states. [2019-12-27 17:44:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81365 to 49891. [2019-12-27 17:44:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49891 states. [2019-12-27 17:44:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49891 states to 49891 states and 117349 transitions. [2019-12-27 17:44:13,907 INFO L78 Accepts]: Start accepts. Automaton has 49891 states and 117349 transitions. Word has length 96 [2019-12-27 17:44:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:13,907 INFO L462 AbstractCegarLoop]: Abstraction has 49891 states and 117349 transitions. [2019-12-27 17:44:13,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:44:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 49891 states and 117349 transitions. [2019-12-27 17:44:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:14,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:14,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:14,168 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:14,168 INFO L82 PathProgramCache]: Analyzing trace with hash -115226714, now seen corresponding path program 18 times [2019-12-27 17:44:14,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:14,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922600873] [2019-12-27 17:44:14,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:14,282 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-27 17:44:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922600873] [2019-12-27 17:44:14,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:14,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:44:14,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401300278] [2019-12-27 17:44:14,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:14,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:14,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 164 transitions. [2019-12-27 17:44:14,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:14,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:14,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:44:14,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:44:14,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:44:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:44:14,613 INFO L87 Difference]: Start difference. First operand 49891 states and 117349 transitions. Second operand 13 states. [2019-12-27 17:44:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:17,098 INFO L93 Difference]: Finished difference Result 68075 states and 157922 transitions. [2019-12-27 17:44:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:44:17,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 17:44:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:17,182 INFO L225 Difference]: With dead ends: 68075 [2019-12-27 17:44:17,182 INFO L226 Difference]: Without dead ends: 67055 [2019-12-27 17:44:17,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:44:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67055 states. [2019-12-27 17:44:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67055 to 49759. [2019-12-27 17:44:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49759 states. [2019-12-27 17:44:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49759 states to 49759 states and 117064 transitions. [2019-12-27 17:44:17,890 INFO L78 Accepts]: Start accepts. Automaton has 49759 states and 117064 transitions. Word has length 96 [2019-12-27 17:44:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:17,891 INFO L462 AbstractCegarLoop]: Abstraction has 49759 states and 117064 transitions. [2019-12-27 17:44:17,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:44:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 49759 states and 117064 transitions. [2019-12-27 17:44:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:17,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:17,939 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash -69807350, now seen corresponding path program 19 times [2019-12-27 17:44:17,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:17,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944463112] [2019-12-27 17:44:17,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:18,165 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-27 17:44:18,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944463112] [2019-12-27 17:44:18,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:18,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:44:18,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386303882] [2019-12-27 17:44:18,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:18,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:18,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 219 transitions. [2019-12-27 17:44:18,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:18,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:18,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:18,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:18,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:44:18,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:44:18,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:44:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:44:18,574 INFO L87 Difference]: Start difference. First operand 49759 states and 117064 transitions. Second operand 18 states. [2019-12-27 17:44:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:26,577 INFO L93 Difference]: Finished difference Result 80783 states and 182580 transitions. [2019-12-27 17:44:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 17:44:26,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-27 17:44:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:26,677 INFO L225 Difference]: With dead ends: 80783 [2019-12-27 17:44:26,678 INFO L226 Difference]: Without dead ends: 80707 [2019-12-27 17:44:26,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 17:44:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80707 states. [2019-12-27 17:44:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80707 to 56068. [2019-12-27 17:44:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56068 states. [2019-12-27 17:44:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56068 states to 56068 states and 130965 transitions. [2019-12-27 17:44:27,606 INFO L78 Accepts]: Start accepts. Automaton has 56068 states and 130965 transitions. Word has length 96 [2019-12-27 17:44:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:27,607 INFO L462 AbstractCegarLoop]: Abstraction has 56068 states and 130965 transitions. [2019-12-27 17:44:27,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:44:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 56068 states and 130965 transitions. [2019-12-27 17:44:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:27,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:27,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:27,660 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1723752872, now seen corresponding path program 20 times [2019-12-27 17:44:27,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:27,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894600092] [2019-12-27 17:44:27,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:27,903 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-27 17:44:27,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894600092] [2019-12-27 17:44:27,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:27,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:44:27,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048880273] [2019-12-27 17:44:27,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:27,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:28,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 362 transitions. [2019-12-27 17:44:28,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:28,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 17:44:28,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:44:28,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:44:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:44:28,499 INFO L87 Difference]: Start difference. First operand 56068 states and 130965 transitions. Second operand 17 states. [2019-12-27 17:44:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:34,591 INFO L93 Difference]: Finished difference Result 115613 states and 264442 transitions. [2019-12-27 17:44:34,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 17:44:34,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 17:44:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:34,720 INFO L225 Difference]: With dead ends: 115613 [2019-12-27 17:44:34,720 INFO L226 Difference]: Without dead ends: 98329 [2019-12-27 17:44:34,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2951 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1155, Invalid=7401, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 17:44:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98329 states. [2019-12-27 17:44:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98329 to 64820. [2019-12-27 17:44:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64820 states. [2019-12-27 17:44:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64820 states to 64820 states and 151563 transitions. [2019-12-27 17:44:35,870 INFO L78 Accepts]: Start accepts. Automaton has 64820 states and 151563 transitions. Word has length 96 [2019-12-27 17:44:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:35,871 INFO L462 AbstractCegarLoop]: Abstraction has 64820 states and 151563 transitions. [2019-12-27 17:44:35,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:44:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 64820 states and 151563 transitions. [2019-12-27 17:44:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:36,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:36,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:36,226 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1170089162, now seen corresponding path program 21 times [2019-12-27 17:44:36,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:36,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488406719] [2019-12-27 17:44:36,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:36,438 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-27 17:44:36,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488406719] [2019-12-27 17:44:36,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:36,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:44:36,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747830987] [2019-12-27 17:44:36,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:36,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:36,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 352 transitions. [2019-12-27 17:44:36,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:36,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 17:44:36,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:44:36,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:36,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:44:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:44:36,746 INFO L87 Difference]: Start difference. First operand 64820 states and 151563 transitions. Second operand 17 states. [2019-12-27 17:44:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:42,182 INFO L93 Difference]: Finished difference Result 117543 states and 270010 transitions. [2019-12-27 17:44:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-27 17:44:42,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 17:44:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:42,325 INFO L225 Difference]: With dead ends: 117543 [2019-12-27 17:44:42,325 INFO L226 Difference]: Without dead ends: 103997 [2019-12-27 17:44:42,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1061, Invalid=6421, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 17:44:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103997 states. [2019-12-27 17:44:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103997 to 64828. [2019-12-27 17:44:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64828 states. [2019-12-27 17:44:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64828 states to 64828 states and 151579 transitions. [2019-12-27 17:44:43,820 INFO L78 Accepts]: Start accepts. Automaton has 64828 states and 151579 transitions. Word has length 96 [2019-12-27 17:44:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:43,820 INFO L462 AbstractCegarLoop]: Abstraction has 64828 states and 151579 transitions. [2019-12-27 17:44:43,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:44:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 64828 states and 151579 transitions. [2019-12-27 17:44:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:43,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:43,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:44:43,884 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash 855665094, now seen corresponding path program 22 times [2019-12-27 17:44:43,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:43,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659207254] [2019-12-27 17:44:43,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:44,077 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-27 17:44:44,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659207254] [2019-12-27 17:44:44,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:44,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:44:44,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033410484] [2019-12-27 17:44:44,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:44,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:44,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 350 transitions. [2019-12-27 17:44:44,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:44,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 17:44:44,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:44:44,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:44:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:44:44,448 INFO L87 Difference]: Start difference. First operand 64828 states and 151579 transitions. Second operand 19 states. [2019-12-27 17:45:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:04,575 INFO L93 Difference]: Finished difference Result 149101 states and 342753 transitions. [2019-12-27 17:45:04,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2019-12-27 17:45:04,575 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-27 17:45:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:04,787 INFO L225 Difference]: With dead ends: 149101 [2019-12-27 17:45:04,787 INFO L226 Difference]: Without dead ends: 133616 [2019-12-27 17:45:04,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21727 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5166, Invalid=45684, Unknown=0, NotChecked=0, Total=50850 [2019-12-27 17:45:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133616 states. [2019-12-27 17:45:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133616 to 63555. [2019-12-27 17:45:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63555 states. [2019-12-27 17:45:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63555 states to 63555 states and 148603 transitions. [2019-12-27 17:45:06,566 INFO L78 Accepts]: Start accepts. Automaton has 63555 states and 148603 transitions. Word has length 96 [2019-12-27 17:45:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:06,567 INFO L462 AbstractCegarLoop]: Abstraction has 63555 states and 148603 transitions. [2019-12-27 17:45:06,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:45:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 63555 states and 148603 transitions. [2019-12-27 17:45:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:45:06,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:06,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:45:06,647 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-27 17:45:06,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:06,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065999183] [2019-12-27 17:45:06,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:06,885 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-27 17:45:06,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065999183] [2019-12-27 17:45:06,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:06,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:45:06,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [14718166] [2019-12-27 17:45:06,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:06,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:07,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 213 transitions. [2019-12-27 17:45:07,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:07,157 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:45:07,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:45:07,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:45:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:45:07,158 INFO L87 Difference]: Start difference. First operand 63555 states and 148603 transitions. Second operand 15 states. Received shutdown request... [2019-12-27 17:45:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 17:45:10,594 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:45:10,601 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:45:10,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:45:10 BasicIcfg [2019-12-27 17:45:10,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:45:10,603 INFO L168 Benchmark]: Toolchain (without parser) took 223966.50 ms. Allocated memory was 144.2 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 99.1 MB in the beginning and 555.4 MB in the end (delta: -456.3 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,603 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.52 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.7 MB in the beginning and 153.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.33 ms. Allocated memory is still 201.9 MB. Free memory was 153.2 MB in the beginning and 149.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,605 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 146.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,605 INFO L168 Benchmark]: RCFGBuilder took 1128.08 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 146.4 MB in the beginning and 190.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,605 INFO L168 Benchmark]: TraceAbstraction took 221843.42 ms. Allocated memory was 232.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 190.9 MB in the beginning and 555.4 MB in the end (delta: -364.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:45:10,611 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.51 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 864.52 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.7 MB in the beginning and 153.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.33 ms. Allocated memory is still 201.9 MB. Free memory was 153.2 MB in the beginning and 149.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.84 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 146.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1128.08 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 146.4 MB in the beginning and 190.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221843.42 ms. Allocated memory was 232.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 190.9 MB in the beginning and 555.4 MB in the end (delta: -364.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.7s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (63555states) and FLOYD_HOARE automaton (currently 52 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1875 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (63555states) and FLOYD_HOARE automaton (currently 52 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1875 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 221.5s, OverallIterations: 46, TraceHistogramMax: 1, AutomataDifference: 129.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 24800 SDtfs, 49216 SDslu, 143943 SDs, 0 SdLazy, 77327 SolverSat, 4464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2122 GetRequests, 614 SyntacticMatches, 60 SemanticMatches, 1448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41848 ImplicationChecksByTransitivity, 34.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152836occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.3s AutomataMinimizationTime, 45 MinimizatonAttempts, 579011 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 3848 NumberOfCodeBlocks, 3848 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3802 ConstructedInterpolants, 0 QuantifiedInterpolants, 1242414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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 could not prove your program: Timeout Completed graceful shutdown