/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/AutomizerC.xml --traceabstraction.trace.refinement.strategy CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:46:34,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:46:34,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:46:34,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:46:34,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:46:34,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:46:34,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:46:34,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:46:34,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:46:34,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:46:34,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:46:34,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:46:34,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:46:34,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:46:34,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:46:34,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:46:34,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:46:34,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:46:34,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:46:34,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:46:34,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:46:34,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:46:34,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:46:34,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:46:34,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:46:34,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:46:34,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:46:34,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:46:34,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:46:34,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:46:34,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:46:34,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:46:34,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:46:34,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:46:34,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:46:34,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:46:34,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:46:34,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:46:34,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:46:34,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:46:34,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:46:34,482 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-19 21:46:34,496 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:46:34,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:46:34,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:46:34,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:46:34,498 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:46:34,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:46:34,499 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:46:34,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:46:34,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:46:34,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:46:34,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:46:34,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:46:34,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:46:34,500 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:46:34,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:46:34,500 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:46:34,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:46:34,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:46:34,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:46:34,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:46:34,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:46:34,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:46:34,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:46:34,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:46:34,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:46:34,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:46:34,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:46:34,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:46:34,503 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:46:34,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:46:34,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:46:34,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:46:34,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:46:34,805 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:46:34,805 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:46:34,806 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-07-19 21:46:34,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f49a0a91/e057ae1f549c49f6b1b07aa1e66cdcef/FLAG175c3a98f [2020-07-19 21:46:35,369 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:46:35,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-07-19 21:46:35,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f49a0a91/e057ae1f549c49f6b1b07aa1e66cdcef/FLAG175c3a98f [2020-07-19 21:46:35,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f49a0a91/e057ae1f549c49f6b1b07aa1e66cdcef [2020-07-19 21:46:35,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:46:35,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:46:35,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:46:35,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:46:35,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:46:35,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:46:35" (1/1) ... [2020-07-19 21:46:35,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4260f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:35, skipping insertion in model container [2020-07-19 21:46:35,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:46:35" (1/1) ... [2020-07-19 21:46:35,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:46:35,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:46:36,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:46:36,101 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:46:36,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:46:36,242 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:46:36,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36 WrapperNode [2020-07-19 21:46:36,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:46:36,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:46:36,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:46:36,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:46:36,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (1/1) ... [2020-07-19 21:46:36,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:46:36,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:46:36,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:46:36,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:46:36,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (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 [2020-07-19 21:46:36,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:46:36,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:46:36,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-19 21:46:36,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:46:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:46:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-19 21:46:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-19 21:46:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-19 21:46:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 21:46:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:46:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:46:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:46:36,860 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:46:36,860 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-19 21:46:36,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:46:36 BoogieIcfgContainer [2020-07-19 21:46:36,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:46:36,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:46:36,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:46:36,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:46:36,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:46:35" (1/3) ... [2020-07-19 21:46:36,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b93cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:46:36, skipping insertion in model container [2020-07-19 21:46:36,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:46:36" (2/3) ... [2020-07-19 21:46:36,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b93cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:46:36, skipping insertion in model container [2020-07-19 21:46:36,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:46:36" (3/3) ... [2020-07-19 21:46:36,875 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-07-19 21:46:36,886 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:46:36,894 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-19 21:46:36,907 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-19 21:46:36,933 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:46:36,934 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:46:36,934 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:46:36,934 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:46:36,934 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:46:36,935 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:46:36,935 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:46:36,935 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:46:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-19 21:46:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-19 21:46:36,966 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:36,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:36,968 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2019463306, now seen corresponding path program 1 times [2020-07-19 21:46:36,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:36,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993308978] [2020-07-19 21:46:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:37,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993308978] [2020-07-19 21:46:37,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:37,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-19 21:46:37,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799799048] [2020-07-19 21:46:37,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-19 21:46:37,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-19 21:46:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-19 21:46:37,241 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2020-07-19 21:46:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:37,422 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2020-07-19 21:46:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:46:37,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-19 21:46:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:37,441 INFO L225 Difference]: With dead ends: 93 [2020-07-19 21:46:37,441 INFO L226 Difference]: Without dead ends: 80 [2020-07-19 21:46:37,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:46:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-19 21:46:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-19 21:46:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-19 21:46:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2020-07-19 21:46:37,519 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2020-07-19 21:46:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:37,520 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2020-07-19 21:46:37,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-19 21:46:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-07-19 21:46:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-19 21:46:37,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:37,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:37,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:46:37,522 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:37,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1821150056, now seen corresponding path program 1 times [2020-07-19 21:46:37,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:37,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644799737] [2020-07-19 21:46:37,523 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:37,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644799737] [2020-07-19 21:46:37,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:37,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-19 21:46:37,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887413442] [2020-07-19 21:46:37,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 21:46:37,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:37,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 21:46:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-19 21:46:37,616 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2020-07-19 21:46:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:37,787 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-07-19 21:46:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:37,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-19 21:46:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:37,789 INFO L225 Difference]: With dead ends: 80 [2020-07-19 21:46:37,789 INFO L226 Difference]: Without dead ends: 78 [2020-07-19 21:46:37,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-19 21:46:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-19 21:46:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-19 21:46:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-07-19 21:46:37,803 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2020-07-19 21:46:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:37,804 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-07-19 21:46:37,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 21:46:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-07-19 21:46:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-19 21:46:37,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:37,805 INFO L422 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] [2020-07-19 21:46:37,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:46:37,806 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2073610827, now seen corresponding path program 1 times [2020-07-19 21:46:37,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:37,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136457676] [2020-07-19 21:46:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:37,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136457676] [2020-07-19 21:46:37,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:37,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:46:37,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838867453] [2020-07-19 21:46:37,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:46:37,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:46:37,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:46:37,923 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2020-07-19 21:46:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:38,198 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2020-07-19 21:46:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:38,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-19 21:46:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:38,203 INFO L225 Difference]: With dead ends: 101 [2020-07-19 21:46:38,203 INFO L226 Difference]: Without dead ends: 99 [2020-07-19 21:46:38,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:46:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-19 21:46:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2020-07-19 21:46:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-19 21:46:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-07-19 21:46:38,227 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2020-07-19 21:46:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:38,228 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-07-19 21:46:38,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:46:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-07-19 21:46:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-19 21:46:38,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:38,230 INFO L422 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] [2020-07-19 21:46:38,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 21:46:38,230 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash -142570686, now seen corresponding path program 1 times [2020-07-19 21:46:38,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:38,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98415737] [2020-07-19 21:46:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:38,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98415737] [2020-07-19 21:46:38,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:38,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:38,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906856681] [2020-07-19 21:46:38,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:38,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:38,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:38,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:38,375 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2020-07-19 21:46:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:38,541 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-07-19 21:46:38,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:38,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-19 21:46:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:38,543 INFO L225 Difference]: With dead ends: 76 [2020-07-19 21:46:38,543 INFO L226 Difference]: Without dead ends: 74 [2020-07-19 21:46:38,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-19 21:46:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-19 21:46:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-19 21:46:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-07-19 21:46:38,559 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2020-07-19 21:46:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:38,562 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-07-19 21:46:38,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-19 21:46:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-19 21:46:38,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:38,564 INFO L422 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] [2020-07-19 21:46:38,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 21:46:38,565 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 402497124, now seen corresponding path program 1 times [2020-07-19 21:46:38,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:38,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958071384] [2020-07-19 21:46:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:38,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958071384] [2020-07-19 21:46:38,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:38,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:38,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133903663] [2020-07-19 21:46:38,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:38,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:38,695 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 6 states. [2020-07-19 21:46:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:39,130 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2020-07-19 21:46:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:46:39,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-19 21:46:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:39,133 INFO L225 Difference]: With dead ends: 141 [2020-07-19 21:46:39,133 INFO L226 Difference]: Without dead ends: 139 [2020-07-19 21:46:39,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-07-19 21:46:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2020-07-19 21:46:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-19 21:46:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-19 21:46:39,159 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2020-07-19 21:46:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:39,160 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-19 21:46:39,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-19 21:46:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-19 21:46:39,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:39,162 INFO L422 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] [2020-07-19 21:46:39,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 21:46:39,162 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash 406230933, now seen corresponding path program 1 times [2020-07-19 21:46:39,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:39,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209843568] [2020-07-19 21:46:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:39,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209843568] [2020-07-19 21:46:39,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:39,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:39,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333403849] [2020-07-19 21:46:39,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:39,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:39,228 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2020-07-19 21:46:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:39,534 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2020-07-19 21:46:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:46:39,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-19 21:46:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:39,536 INFO L225 Difference]: With dead ends: 108 [2020-07-19 21:46:39,536 INFO L226 Difference]: Without dead ends: 106 [2020-07-19 21:46:39,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-19 21:46:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2020-07-19 21:46:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-19 21:46:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-07-19 21:46:39,546 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2020-07-19 21:46:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:39,546 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-07-19 21:46:39,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-19 21:46:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-19 21:46:39,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:39,548 INFO L422 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] [2020-07-19 21:46:39,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 21:46:39,548 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash -407487796, now seen corresponding path program 1 times [2020-07-19 21:46:39,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:39,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797866061] [2020-07-19 21:46:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:39,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797866061] [2020-07-19 21:46:39,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:39,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:39,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057245667] [2020-07-19 21:46:39,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:39,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:39,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:39,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:39,620 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2020-07-19 21:46:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:39,843 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2020-07-19 21:46:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:39,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-19 21:46:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:39,845 INFO L225 Difference]: With dead ends: 121 [2020-07-19 21:46:39,845 INFO L226 Difference]: Without dead ends: 119 [2020-07-19 21:46:39,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-19 21:46:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2020-07-19 21:46:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-19 21:46:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-19 21:46:39,853 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2020-07-19 21:46:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:39,853 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-19 21:46:39,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-19 21:46:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-19 21:46:39,854 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:39,855 INFO L422 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] [2020-07-19 21:46:39,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-19 21:46:39,855 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:39,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash -291739827, now seen corresponding path program 1 times [2020-07-19 21:46:39,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:39,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14701644] [2020-07-19 21:46:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:39,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14701644] [2020-07-19 21:46:39,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:39,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:39,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228891425] [2020-07-19 21:46:39,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:39,912 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2020-07-19 21:46:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:40,098 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-19 21:46:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:40,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-19 21:46:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:40,100 INFO L225 Difference]: With dead ends: 77 [2020-07-19 21:46:40,100 INFO L226 Difference]: Without dead ends: 75 [2020-07-19 21:46:40,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-19 21:46:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-19 21:46:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-19 21:46:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-07-19 21:46:40,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2020-07-19 21:46:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:40,117 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-07-19 21:46:40,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-19 21:46:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-19 21:46:40,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:40,120 INFO L422 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] [2020-07-19 21:46:40,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-19 21:46:40,123 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:40,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1188998893, now seen corresponding path program 1 times [2020-07-19 21:46:40,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:40,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252101463] [2020-07-19 21:46:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:40,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252101463] [2020-07-19 21:46:40,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:40,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-19 21:46:40,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672601086] [2020-07-19 21:46:40,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-19 21:46:40,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-19 21:46:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-19 21:46:40,197 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 4 states. [2020-07-19 21:46:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:40,316 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2020-07-19 21:46:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-19 21:46:40,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-19 21:46:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:40,319 INFO L225 Difference]: With dead ends: 115 [2020-07-19 21:46:40,319 INFO L226 Difference]: Without dead ends: 75 [2020-07-19 21:46:40,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:46:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-19 21:46:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-19 21:46:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-19 21:46:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2020-07-19 21:46:40,327 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2020-07-19 21:46:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:40,328 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2020-07-19 21:46:40,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-19 21:46:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-07-19 21:46:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-19 21:46:40,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:40,329 INFO L422 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] [2020-07-19 21:46:40,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-19 21:46:40,329 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1640998784, now seen corresponding path program 1 times [2020-07-19 21:46:40,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:40,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405817605] [2020-07-19 21:46:40,331 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:40,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405817605] [2020-07-19 21:46:40,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:40,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:40,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786795463] [2020-07-19 21:46:40,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:40,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:40,408 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2020-07-19 21:46:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:40,566 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-07-19 21:46:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:40,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-19 21:46:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:40,568 INFO L225 Difference]: With dead ends: 76 [2020-07-19 21:46:40,568 INFO L226 Difference]: Without dead ends: 74 [2020-07-19 21:46:40,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:46:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-19 21:46:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2020-07-19 21:46:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-19 21:46:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-07-19 21:46:40,574 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2020-07-19 21:46:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:40,575 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-07-19 21:46:40,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-07-19 21:46:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-19 21:46:40,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:40,576 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:40,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-19 21:46:40,576 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1892106755, now seen corresponding path program 1 times [2020-07-19 21:46:40,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:40,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200498627] [2020-07-19 21:46:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:46:40,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200498627] [2020-07-19 21:46:40,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790268884] [2020-07-19 21:46:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:46:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:40,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-19 21:46:40,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:46:40,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-19 21:46:40,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-19 21:46:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:46:40,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:46:40,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-19 21:46:40,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303436574] [2020-07-19 21:46:40,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 21:46:40,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 21:46:40,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-19 21:46:40,775 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 7 states. [2020-07-19 21:46:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:40,973 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2020-07-19 21:46:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:40,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-19 21:46:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:40,975 INFO L225 Difference]: With dead ends: 111 [2020-07-19 21:46:40,975 INFO L226 Difference]: Without dead ends: 109 [2020-07-19 21:46:40,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-19 21:46:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2020-07-19 21:46:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-19 21:46:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-07-19 21:46:40,982 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2020-07-19 21:46:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:40,982 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-07-19 21:46:40,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 21:46:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-19 21:46:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-19 21:46:40,983 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:40,983 INFO L422 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] [2020-07-19 21:46:41,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-19 21:46:41,185 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash 668648404, now seen corresponding path program 1 times [2020-07-19 21:46:41,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:41,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661466117] [2020-07-19 21:46:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:41,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661466117] [2020-07-19 21:46:41,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:41,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:41,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006205831] [2020-07-19 21:46:41,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:41,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:41,248 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2020-07-19 21:46:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:41,388 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-19 21:46:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:41,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-19 21:46:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:41,390 INFO L225 Difference]: With dead ends: 70 [2020-07-19 21:46:41,390 INFO L226 Difference]: Without dead ends: 68 [2020-07-19 21:46:41,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-19 21:46:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-19 21:46:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-19 21:46:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-07-19 21:46:41,396 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2020-07-19 21:46:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:41,396 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-07-19 21:46:41,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-19 21:46:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-19 21:46:41,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:41,398 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:41,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-19 21:46:41,398 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1470784207, now seen corresponding path program 1 times [2020-07-19 21:46:41,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:41,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429910549] [2020-07-19 21:46:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:46:41,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429910549] [2020-07-19 21:46:41,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76191717] [2020-07-19 21:46:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:46:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:41,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-19 21:46:41,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:46:41,569 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-19 21:46:41,571 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-19 21:46:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:46:41,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:46:41,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-19 21:46:41,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24707662] [2020-07-19 21:46:41,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 21:46:41,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 21:46:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-19 21:46:41,584 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2020-07-19 21:46:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:41,713 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-07-19 21:46:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:41,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-19 21:46:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:41,714 INFO L225 Difference]: With dead ends: 69 [2020-07-19 21:46:41,714 INFO L226 Difference]: Without dead ends: 67 [2020-07-19 21:46:41,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-19 21:46:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2020-07-19 21:46:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-19 21:46:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-07-19 21:46:41,723 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2020-07-19 21:46:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:41,723 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-07-19 21:46:41,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 21:46:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-07-19 21:46:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-19 21:46:41,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:41,724 INFO L422 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] [2020-07-19 21:46:41,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-19 21:46:41,925 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash -350608983, now seen corresponding path program 1 times [2020-07-19 21:46:41,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:41,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171154455] [2020-07-19 21:46:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:42,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171154455] [2020-07-19 21:46:42,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:42,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:42,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131729363] [2020-07-19 21:46:42,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:42,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:42,005 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2020-07-19 21:46:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:42,129 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-07-19 21:46:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:42,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-19 21:46:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:42,130 INFO L225 Difference]: With dead ends: 63 [2020-07-19 21:46:42,131 INFO L226 Difference]: Without dead ends: 61 [2020-07-19 21:46:42,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:46:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-19 21:46:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2020-07-19 21:46:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-19 21:46:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-07-19 21:46:42,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2020-07-19 21:46:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:42,136 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-07-19 21:46:42,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-07-19 21:46:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-19 21:46:42,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:42,138 INFO L422 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] [2020-07-19 21:46:42,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-19 21:46:42,141 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2016026591, now seen corresponding path program 1 times [2020-07-19 21:46:42,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:42,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458273627] [2020-07-19 21:46:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:42,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458273627] [2020-07-19 21:46:42,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:42,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-19 21:46:42,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349113523] [2020-07-19 21:46:42,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 21:46:42,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 21:46:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-19 21:46:42,223 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2020-07-19 21:46:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:42,382 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2020-07-19 21:46:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:42,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-19 21:46:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:42,384 INFO L225 Difference]: With dead ends: 71 [2020-07-19 21:46:42,384 INFO L226 Difference]: Without dead ends: 69 [2020-07-19 21:46:42,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-19 21:46:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2020-07-19 21:46:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-19 21:46:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-07-19 21:46:42,389 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2020-07-19 21:46:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:42,390 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-07-19 21:46:42,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 21:46:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-19 21:46:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-19 21:46:42,391 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:42,391 INFO L422 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] [2020-07-19 21:46:42,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-19 21:46:42,392 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1371399406, now seen corresponding path program 1 times [2020-07-19 21:46:42,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:42,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795942143] [2020-07-19 21:46:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:42,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795942143] [2020-07-19 21:46:42,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:42,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:42,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968392278] [2020-07-19 21:46:42,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:42,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:42,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:42,467 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2020-07-19 21:46:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:42,760 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-07-19 21:46:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:46:42,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-19 21:46:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:42,761 INFO L225 Difference]: With dead ends: 91 [2020-07-19 21:46:42,761 INFO L226 Difference]: Without dead ends: 89 [2020-07-19 21:46:42,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-19 21:46:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2020-07-19 21:46:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-19 21:46:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-07-19 21:46:42,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2020-07-19 21:46:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:42,770 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-07-19 21:46:42,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-19 21:46:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-19 21:46:42,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:42,771 INFO L422 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] [2020-07-19 21:46:42,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-19 21:46:42,772 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash 436294569, now seen corresponding path program 1 times [2020-07-19 21:46:42,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:42,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331012281] [2020-07-19 21:46:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:42,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331012281] [2020-07-19 21:46:42,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:42,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:42,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038054649] [2020-07-19 21:46:42,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:42,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:42,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:42,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:42,839 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2020-07-19 21:46:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:43,019 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-19 21:46:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:43,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-07-19 21:46:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:43,021 INFO L225 Difference]: With dead ends: 61 [2020-07-19 21:46:43,021 INFO L226 Difference]: Without dead ends: 59 [2020-07-19 21:46:43,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-19 21:46:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-19 21:46:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-19 21:46:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-07-19 21:46:43,026 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2020-07-19 21:46:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:43,027 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-07-19 21:46:43,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-19 21:46:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-19 21:46:43,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:43,028 INFO L422 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] [2020-07-19 21:46:43,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-19 21:46:43,028 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1627614740, now seen corresponding path program 1 times [2020-07-19 21:46:43,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:43,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987875899] [2020-07-19 21:46:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:43,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987875899] [2020-07-19 21:46:43,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:43,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894994169] [2020-07-19 21:46:43,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:43,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:43,081 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2020-07-19 21:46:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:43,237 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-19 21:46:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:43,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-07-19 21:46:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:43,239 INFO L225 Difference]: With dead ends: 70 [2020-07-19 21:46:43,239 INFO L226 Difference]: Without dead ends: 68 [2020-07-19 21:46:43,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-19 21:46:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-19 21:46:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-19 21:46:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-07-19 21:46:43,247 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2020-07-19 21:46:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:43,247 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-07-19 21:46:43,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-19 21:46:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-19 21:46:43,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:43,248 INFO L422 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] [2020-07-19 21:46:43,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-19 21:46:43,249 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1083553822, now seen corresponding path program 1 times [2020-07-19 21:46:43,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:43,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387775773] [2020-07-19 21:46:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:43,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387775773] [2020-07-19 21:46:43,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:43,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:43,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496534559] [2020-07-19 21:46:43,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:43,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:43,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:43,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:43,315 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2020-07-19 21:46:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:43,470 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-19 21:46:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:43,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-19 21:46:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:43,471 INFO L225 Difference]: With dead ends: 68 [2020-07-19 21:46:43,471 INFO L226 Difference]: Without dead ends: 66 [2020-07-19 21:46:43,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-19 21:46:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-19 21:46:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-19 21:46:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-07-19 21:46:43,479 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2020-07-19 21:46:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:43,479 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-07-19 21:46:43,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-19 21:46:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-19 21:46:43,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:43,480 INFO L422 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] [2020-07-19 21:46:43,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-19 21:46:43,480 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash -769566670, now seen corresponding path program 1 times [2020-07-19 21:46:43,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:43,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475634044] [2020-07-19 21:46:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:43,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475634044] [2020-07-19 21:46:43,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:43,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:43,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175884852] [2020-07-19 21:46:43,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:43,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:43,549 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2020-07-19 21:46:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:43,825 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-07-19 21:46:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:46:43,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-19 21:46:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:43,826 INFO L225 Difference]: With dead ends: 90 [2020-07-19 21:46:43,827 INFO L226 Difference]: Without dead ends: 88 [2020-07-19 21:46:43,827 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:46:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-19 21:46:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2020-07-19 21:46:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-19 21:46:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2020-07-19 21:46:43,836 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2020-07-19 21:46:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:43,836 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2020-07-19 21:46:43,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-19 21:46:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-19 21:46:43,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:43,837 INFO L422 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] [2020-07-19 21:46:43,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-19 21:46:43,839 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1913240228, now seen corresponding path program 1 times [2020-07-19 21:46:43,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:43,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306892266] [2020-07-19 21:46:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:43,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306892266] [2020-07-19 21:46:43,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:43,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:43,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263414634] [2020-07-19 21:46:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:43,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:43,909 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2020-07-19 21:46:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:44,089 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-19 21:46:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:44,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-19 21:46:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:44,090 INFO L225 Difference]: With dead ends: 75 [2020-07-19 21:46:44,090 INFO L226 Difference]: Without dead ends: 73 [2020-07-19 21:46:44,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:46:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-19 21:46:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-07-19 21:46:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-19 21:46:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-07-19 21:46:44,096 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 44 [2020-07-19 21:46:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:44,096 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-07-19 21:46:44,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-07-19 21:46:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-19 21:46:44,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:44,097 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:44,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-19 21:46:44,099 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:44,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1562566919, now seen corresponding path program 1 times [2020-07-19 21:46:44,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:44,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077876941] [2020-07-19 21:46:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:44,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077876941] [2020-07-19 21:46:44,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432202983] [2020-07-19 21:46:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:46:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:44,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-19 21:46:44,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:46:44,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-19 21:46:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:46:44,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:46:44,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-19 21:46:44,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699933562] [2020-07-19 21:46:44,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-19 21:46:44,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-19 21:46:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:46:44,397 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 8 states. [2020-07-19 21:46:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:44,543 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2020-07-19 21:46:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:46:44,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-19 21:46:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:44,547 INFO L225 Difference]: With dead ends: 67 [2020-07-19 21:46:44,547 INFO L226 Difference]: Without dead ends: 65 [2020-07-19 21:46:44,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:46:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-19 21:46:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-19 21:46:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-19 21:46:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-07-19 21:46:44,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2020-07-19 21:46:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:44,555 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-07-19 21:46:44,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-19 21:46:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-19 21:46:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-19 21:46:44,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:44,557 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:44,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-19 21:46:44,771 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash 790604971, now seen corresponding path program 1 times [2020-07-19 21:46:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:44,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845348922] [2020-07-19 21:46:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-19 21:46:44,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845348922] [2020-07-19 21:46:44,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:44,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-19 21:46:44,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664548441] [2020-07-19 21:46:44,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 21:46:44,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:44,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 21:46:44,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:46:44,837 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2020-07-19 21:46:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:45,080 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-19 21:46:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:46:45,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-19 21:46:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:45,081 INFO L225 Difference]: With dead ends: 77 [2020-07-19 21:46:45,081 INFO L226 Difference]: Without dead ends: 75 [2020-07-19 21:46:45,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:46:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-19 21:46:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-07-19 21:46:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-19 21:46:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-19 21:46:45,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2020-07-19 21:46:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:45,089 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-19 21:46:45,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 21:46:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-19 21:46:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-19 21:46:45,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:46:45,090 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:46:45,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-19 21:46:45,091 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:46:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:46:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 705971477, now seen corresponding path program 1 times [2020-07-19 21:46:45,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:46:45,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393928951] [2020-07-19 21:46:45,092 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@57d6d868 [2020-07-19 21:46:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:46:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-19 21:46:45,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393928951] [2020-07-19 21:46:45,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:46:45,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:46:45,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095759272] [2020-07-19 21:46:45,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:46:45,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:46:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:46:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:46:45,170 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2020-07-19 21:46:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:46:45,329 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-07-19 21:46:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 21:46:45,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-19 21:46:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:46:45,341 INFO L225 Difference]: With dead ends: 60 [2020-07-19 21:46:45,341 INFO L226 Difference]: Without dead ends: 0 [2020-07-19 21:46:45,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-19 21:46:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-19 21:46:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-19 21:46:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-19 21:46:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-19 21:46:45,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-19 21:46:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:46:45,345 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-19 21:46:45,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:46:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-19 21:46:45,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-19 21:46:45,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-19 21:46:45,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-19 21:46:45,850 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2020-07-19 21:46:46,331 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2020-07-19 21:46:46,525 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2020-07-19 21:46:46,820 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2020-07-19 21:46:46,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-19 21:46:46,824 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|)) [2020-07-19 21:46:46,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-19 21:46:46,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-19 21:46:46,824 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-19 21:46:46,824 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-19 21:46:46,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-19 21:46:46,824 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point L192(lines 192 352) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point L382(lines 382 391) no Hoare annotation was computed. [2020-07-19 21:46:46,825 INFO L268 CegarLoopResult]: For program point L93(lines 93 410) no Hoare annotation was computed. [2020-07-19 21:46:46,826 INFO L268 CegarLoopResult]: For program point L27(lines 27 435) no Hoare annotation was computed. [2020-07-19 21:46:46,826 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 437) no Hoare annotation was computed. [2020-07-19 21:46:46,826 INFO L268 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-07-19 21:46:46,826 INFO L264 CegarLoopResult]: At program point L399(lines 129 400) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= 1 main_~__VERIFIER_assert__cond~3) (let ((.cse0 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse3 (< 0 main_~main__scheme~0))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 .cse3) (and (= 1 main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3)))) [2020-07-19 21:46:46,826 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 253) no Hoare annotation was computed. [2020-07-19 21:46:46,826 INFO L268 CegarLoopResult]: For program point L102(lines 102 409) no Hoare annotation was computed. [2020-07-19 21:46:46,826 INFO L268 CegarLoopResult]: For program point L69(lines 69 414) no Hoare annotation was computed. [2020-07-19 21:46:46,827 INFO L264 CegarLoopResult]: At program point L325(lines 260 326) the Hoare annotation is: (let ((.cse19 (+ main_~main__cp~0 1))) (let ((.cse0 (= 1 main_~__VERIFIER_assert__cond~9)) (.cse1 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse4 (not (= .cse19 main_~main__urilen~0))) (.cse5 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= 1 main_~__VERIFIER_assert__cond~3)) (.cse8 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse9 (= main_~__VERIFIER_assert__cond~10 1)) (.cse10 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse11 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse12 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse13 (not (= 0 main_~__VERIFIER_assert__cond~9))) (.cse14 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse15 (<= .cse19 main_~main__urilen~0)) (.cse16 (<= 1 main_~main__cp~0)) (.cse17 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse18 (< 0 main_~main__scheme~0))) (or (and .cse0 .cse1 .cse2 (= 0 main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse3 .cse4 (not (= main_~__VERIFIER_assert__cond~15 0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__c~0))))) [2020-07-19 21:46:46,827 INFO L268 CegarLoopResult]: For program point L292(lines 292 316) no Hoare annotation was computed. [2020-07-19 21:46:46,827 INFO L268 CegarLoopResult]: For program point L160(lines 160 357) no Hoare annotation was computed. [2020-07-19 21:46:46,827 INFO L268 CegarLoopResult]: For program point L61(lines 61 420) no Hoare annotation was computed. [2020-07-19 21:46:46,827 INFO L268 CegarLoopResult]: For program point L251(lines 251 327) no Hoare annotation was computed. [2020-07-19 21:46:46,827 INFO L268 CegarLoopResult]: For program point L185(lines 185 353) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L264 CegarLoopResult]: At program point L408(lines 102 409) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (= |old(~__return_375~0)| ~__return_375~0)) [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point L210(lines 210 344) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point L45(lines 45 432) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point L268(lines 268 320) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 294) no Hoare annotation was computed. [2020-07-19 21:46:46,828 INFO L268 CegarLoopResult]: For program point L202(lines 202 351) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point L260(lines 260 326) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point L384(line 384) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point L153(lines 153 358) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point L21(lines 21 436) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 437) no Hoare annotation was computed. [2020-07-19 21:46:46,829 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 282) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L294(line 294) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L63(lines 63 415) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L253(line 253) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L121(lines 121 401) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-07-19 21:46:46,830 INFO L268 CegarLoopResult]: For program point L270(line 270) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point L39(lines 39 433) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 372) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 187) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point L370(lines 370 393) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point L81(lines 81 412) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point L304(lines 304 314) no Hoare annotation was computed. [2020-07-19 21:46:46,831 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 306) no Hoare annotation was computed. [2020-07-19 21:46:46,832 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 111) no Hoare annotation was computed. [2020-07-19 21:46:46,832 INFO L268 CegarLoopResult]: For program point L222(lines 222 342) no Hoare annotation was computed. [2020-07-19 21:46:46,832 INFO L268 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2020-07-19 21:46:46,832 INFO L268 CegarLoopResult]: For program point L57(lines 57 430) no Hoare annotation was computed. [2020-07-19 21:46:46,832 INFO L264 CegarLoopResult]: At program point L313(lines 228 342) the Hoare annotation is: (let ((.cse17 (+ main_~main__cp~0 1))) (let ((.cse3 (= 0 main_~main__c~0)) (.cse0 (= 1 main_~__VERIFIER_assert__cond~9)) (.cse1 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse5 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= 1 main_~__VERIFIER_assert__cond~3)) (.cse8 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse9 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse10 (<= 1 main_~__VERIFIER_assert__cond~10)) (.cse11 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse12 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse13 (<= .cse17 main_~main__urilen~0)) (.cse15 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse14 (<= 1 main_~main__cp~0)) (.cse16 (< 0 main_~main__scheme~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse14 .cse15 .cse16) (and (< .cse17 main_~main__urilen~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 main_~__VERIFIER_assert__cond~8) .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse4 (not (= main_~__VERIFIER_assert__cond~15 0)) .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__c~0))))) [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point L280(lines 280 318) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point L239(lines 239 329) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point L173(lines 173 355) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 241) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point L33(lines 33 434) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point L372(line 372) no Hoare annotation was computed. [2020-07-19 21:46:46,833 INFO L268 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point L306(line 306) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point L141(lines 141 360) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point L232(lines 232 336) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 384) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point L133(lines 133 395) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2020-07-19 21:46:46,834 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point L59(lines 59 425) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point L282(line 282) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point L51(lines 51 431) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point L241(line 241) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 270) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-07-19 21:46:46,835 INFO L268 CegarLoopResult]: For program point L109(lines 109 403) no Hoare annotation was computed. [2020-07-19 21:46:46,836 INFO L264 CegarLoopResult]: At program point L390(lines 127 401) the Hoare annotation is: (and (let ((.cse0 (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse1 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse2 (= 1 main_~__VERIFIER_assert__cond~3)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse5 (< 0 main_~main__scheme~0))) (or (and (= 1 main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~__VERIFIER_assert__cond~16) (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= main_~__VERIFIER_assert__cond~17 0))))) (= |old(~__return_375~0)| ~__return_375~0)) [2020-07-19 21:46:46,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:46:46 BoogieIcfgContainer [2020-07-19 21:46:46,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 21:46:46,867 INFO L168 Benchmark]: Toolchain (without parser) took 11128.42 ms. Allocated memory was 136.8 MB in the beginning and 341.3 MB in the end (delta: 204.5 MB). Free memory was 101.6 MB in the beginning and 284.0 MB in the end (delta: -182.4 MB). Peak memory consumption was 195.7 MB. Max. memory is 7.1 GB. [2020-07-19 21:46:46,867 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-19 21:46:46,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.75 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 178.7 MB in the end (delta: -77.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-07-19 21:46:46,868 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 ms. Allocated memory is still 200.3 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-19 21:46:46,869 INFO L168 Benchmark]: RCFGBuilder took 578.92 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 148.3 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2020-07-19 21:46:46,869 INFO L168 Benchmark]: TraceAbstraction took 9997.47 ms. Allocated memory was 200.3 MB in the beginning and 341.3 MB in the end (delta: 141.0 MB). Free memory was 148.3 MB in the beginning and 284.0 MB in the end (delta: -135.7 MB). Peak memory consumption was 179.0 MB. Max. memory is 7.1 GB. [2020-07-19 21:46:46,872 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 500.75 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 178.7 MB in the end (delta: -77.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.17 ms. Allocated memory is still 200.3 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 578.92 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 148.3 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9997.47 ms. Allocated memory was 200.3 MB in the beginning and 341.3 MB in the end (delta: 141.0 MB). Free memory was 148.3 MB in the beginning and 284.0 MB in the end (delta: -135.7 MB). Peak memory consumption was 179.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 306]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 372]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 187]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 282]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 241]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 294]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 270]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 143]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 253]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 384]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 111]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 155]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 123]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((1 == __VERIFIER_assert__cond && main__cp + 1 <= main__urilen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || ((((((((1 <= __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0))) && \old(__return_375) == __return_375 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) && \old(__return_375) == __return_375 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 == main__c) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && main__c + 2 <= main__tokenlen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || ((((((((((((((((main__cp + 1 < main__urilen && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 == main__c) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme)) || ((((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || ((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme)) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 == main__c) && !(0 == __VERIFIER_assert__cond)) && !(main__cp + 1 == main__urilen)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && main__c + 2 <= main__tokenlen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || (((((((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(main__cp + 1 == main__urilen)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.4s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1392 SDtfs, 3910 SDslu, 363 SDs, 0 SdLazy, 2628 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 179 SyntacticMatches, 7 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 288 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 520 HoareAnnotationTreeSize, 9 FomulaSimplifications, 66188 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 12655 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 879 ConstructedInterpolants, 0 QuantifiedInterpolants, 69166 SizeOfPredicates, 15 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 15/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...