/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:47,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:47,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:47,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:47,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:47,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:47,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:47,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:47,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:47,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:47,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:47,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:47,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:47,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:47,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:47,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:47,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:47,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:47,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:47,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:47,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:47,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:47,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:47,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:47,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:47,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:47,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:47,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:47,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:47,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:47,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:47,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:47,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:47,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:47,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:47,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:48,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:48,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:48,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:48,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:48,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:48,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:06:48,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:48,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:48,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:48,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:48,018 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:48,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:48,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:48,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:48,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:48,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:48,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:48,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:48,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:48,019 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:48,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:48,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:48,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:48,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:48,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:48,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:48,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:48,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:48,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:48,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:48,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:48,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:48,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:48,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:48,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:48,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:48,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:48,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:48,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:48,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:48,311 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:48,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-11-23 22:06:48,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db51e2766/5fdd232b9eed47b7bc4b8d6e0094825b/FLAGed8414c0b [2019-11-23 22:06:48,854 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:48,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-11-23 22:06:48,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db51e2766/5fdd232b9eed47b7bc4b8d6e0094825b/FLAGed8414c0b [2019-11-23 22:06:49,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db51e2766/5fdd232b9eed47b7bc4b8d6e0094825b [2019-11-23 22:06:49,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:49,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:49,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:49,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:49,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:49,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ff2346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49, skipping insertion in model container [2019-11-23 22:06:49,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:49,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:49,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:49,486 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:49,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:49,514 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:49,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49 WrapperNode [2019-11-23 22:06:49,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:49,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:49,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:49,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:49,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:49,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:49,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:49,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:49,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... [2019-11-23 22:06:49,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:49,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:49,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:49,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:49,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:49,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:49,965 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:49,966 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:49,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:49 BoogieIcfgContainer [2019-11-23 22:06:49,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:49,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:49,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:49,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:49,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:49" (1/3) ... [2019-11-23 22:06:49,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1836c45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:49, skipping insertion in model container [2019-11-23 22:06:49,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:49" (2/3) ... [2019-11-23 22:06:49,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1836c45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:49, skipping insertion in model container [2019-11-23 22:06:49,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:49" (3/3) ... [2019-11-23 22:06:49,991 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-11-23 22:06:50,006 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:50,012 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:50,024 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:50,050 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:50,050 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:50,050 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:50,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:50,050 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:50,051 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:50,051 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:50,051 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-23 22:06:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:06:50,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,073 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-11-23 22:06:50,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743527067] [2019-11-23 22:06:50,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743527067] [2019-11-23 22:06:50,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965778476] [2019-11-23 22:06:50,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,270 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-23 22:06:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,352 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-11-23 22:06:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:06:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,372 INFO L225 Difference]: With dead ends: 52 [2019-11-23 22:06:50,372 INFO L226 Difference]: Without dead ends: 38 [2019-11-23 22:06:50,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-23 22:06:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-11-23 22:06:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 22:06:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-11-23 22:06:50,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-11-23 22:06:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,437 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-11-23 22:06:50,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-23 22:06:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:06:50,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-11-23 22:06:50,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108292708] [2019-11-23 22:06:50,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108292708] [2019-11-23 22:06:50,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41494941] [2019-11-23 22:06:50,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,522 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-11-23 22:06:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,565 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-11-23 22:06:50,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:06:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,567 INFO L225 Difference]: With dead ends: 63 [2019-11-23 22:06:50,568 INFO L226 Difference]: Without dead ends: 38 [2019-11-23 22:06:50,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-23 22:06:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-23 22:06:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-23 22:06:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-11-23 22:06:50,583 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-11-23 22:06:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,583 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-11-23 22:06:50,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-11-23 22:06:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:06:50,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,586 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-11-23 22:06:50,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59632569] [2019-11-23 22:06:50,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59632569] [2019-11-23 22:06:50,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132048608] [2019-11-23 22:06:50,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,662 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-11-23 22:06:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,691 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-11-23 22:06:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 22:06:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,693 INFO L225 Difference]: With dead ends: 59 [2019-11-23 22:06:50,693 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 22:06:50,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 22:06:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-23 22:06:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 22:06:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-11-23 22:06:50,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-11-23 22:06:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,701 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-11-23 22:06:50,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-11-23 22:06:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:06:50,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-11-23 22:06:50,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582791342] [2019-11-23 22:06:50,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582791342] [2019-11-23 22:06:50,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9519115] [2019-11-23 22:06:50,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,748 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-11-23 22:06:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,775 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-11-23 22:06:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 22:06:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,777 INFO L225 Difference]: With dead ends: 72 [2019-11-23 22:06:50,777 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 22:06:50,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 22:06:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-23 22:06:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 22:06:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-11-23 22:06:50,786 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-11-23 22:06:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,786 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-11-23 22:06:50,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-11-23 22:06:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:06:50,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,788 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-11-23 22:06:50,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539027134] [2019-11-23 22:06:50,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539027134] [2019-11-23 22:06:50,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610501519] [2019-11-23 22:06:50,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,836 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-11-23 22:06:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,859 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-11-23 22:06:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 22:06:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,861 INFO L225 Difference]: With dead ends: 120 [2019-11-23 22:06:50,861 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 22:06:50,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 22:06:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-23 22:06:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-23 22:06:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-11-23 22:06:50,871 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-11-23 22:06:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,871 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-11-23 22:06:50,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-11-23 22:06:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:06:50,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,874 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-11-23 22:06:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17523873] [2019-11-23 22:06:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17523873] [2019-11-23 22:06:50,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083917541] [2019-11-23 22:06:50,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,925 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-11-23 22:06:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,943 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-11-23 22:06:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:06:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,945 INFO L225 Difference]: With dead ends: 107 [2019-11-23 22:06:50,945 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 22:06:50,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 22:06:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-23 22:06:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 22:06:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-11-23 22:06:50,955 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-11-23 22:06:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,955 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-11-23 22:06:50,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-11-23 22:06:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:06:50,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,957 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-11-23 22:06:50,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456739676] [2019-11-23 22:06:50,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456739676] [2019-11-23 22:06:51,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480606011] [2019-11-23 22:06:51,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,003 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-11-23 22:06:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,021 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-11-23 22:06:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:06:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,023 INFO L225 Difference]: With dead ends: 200 [2019-11-23 22:06:51,023 INFO L226 Difference]: Without dead ends: 134 [2019-11-23 22:06:51,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-23 22:06:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-23 22:06:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-23 22:06:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-11-23 22:06:51,038 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-11-23 22:06:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,038 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-11-23 22:06:51,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-11-23 22:06:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:06:51,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,040 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-11-23 22:06:51,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654384120] [2019-11-23 22:06:51,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654384120] [2019-11-23 22:06:51,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523823760] [2019-11-23 22:06:51,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,098 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-11-23 22:06:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,124 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-11-23 22:06:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:06:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,128 INFO L225 Difference]: With dead ends: 160 [2019-11-23 22:06:51,128 INFO L226 Difference]: Without dead ends: 158 [2019-11-23 22:06:51,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-23 22:06:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-11-23 22:06:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-23 22:06:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-11-23 22:06:51,141 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-11-23 22:06:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,141 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-11-23 22:06:51,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-11-23 22:06:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:06:51,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,143 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-11-23 22:06:51,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520721189] [2019-11-23 22:06:51,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520721189] [2019-11-23 22:06:51,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905315785] [2019-11-23 22:06:51,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,171 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-11-23 22:06:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,200 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-11-23 22:06:51,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 22:06:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,203 INFO L225 Difference]: With dead ends: 228 [2019-11-23 22:06:51,203 INFO L226 Difference]: Without dead ends: 226 [2019-11-23 22:06:51,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-23 22:06:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-23 22:06:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-23 22:06:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-11-23 22:06:51,222 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-11-23 22:06:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,222 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-11-23 22:06:51,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-11-23 22:06:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:06:51,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,229 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-11-23 22:06:51,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451247775] [2019-11-23 22:06:51,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451247775] [2019-11-23 22:06:51,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204671267] [2019-11-23 22:06:51,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,285 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-11-23 22:06:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,317 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-11-23 22:06:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 22:06:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,320 INFO L225 Difference]: With dead ends: 436 [2019-11-23 22:06:51,320 INFO L226 Difference]: Without dead ends: 250 [2019-11-23 22:06:51,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-23 22:06:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-11-23 22:06:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-23 22:06:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-11-23 22:06:51,350 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-11-23 22:06:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,351 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-11-23 22:06:51,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-11-23 22:06:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:51,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-11-23 22:06:51,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115832500] [2019-11-23 22:06:51,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115832500] [2019-11-23 22:06:51,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787705165] [2019-11-23 22:06:51,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,385 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-11-23 22:06:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,413 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-11-23 22:06:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,416 INFO L225 Difference]: With dead ends: 380 [2019-11-23 22:06:51,416 INFO L226 Difference]: Without dead ends: 262 [2019-11-23 22:06:51,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-23 22:06:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-23 22:06:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-23 22:06:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-11-23 22:06:51,433 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-11-23 22:06:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,433 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-11-23 22:06:51,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-11-23 22:06:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:51,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,435 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-11-23 22:06:51,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76039376] [2019-11-23 22:06:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76039376] [2019-11-23 22:06:51,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939462157] [2019-11-23 22:06:51,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,469 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-11-23 22:06:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,494 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-11-23 22:06:51,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,498 INFO L225 Difference]: With dead ends: 422 [2019-11-23 22:06:51,498 INFO L226 Difference]: Without dead ends: 420 [2019-11-23 22:06:51,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-23 22:06:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-11-23 22:06:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-23 22:06:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-11-23 22:06:51,511 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-11-23 22:06:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,511 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-11-23 22:06:51,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-11-23 22:06:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:51,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,513 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,514 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-11-23 22:06:51,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676441480] [2019-11-23 22:06:51,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:51,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676441480] [2019-11-23 22:06:51,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230643254] [2019-11-23 22:06:51,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,533 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-11-23 22:06:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,554 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-11-23 22:06:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,556 INFO L225 Difference]: With dead ends: 852 [2019-11-23 22:06:51,556 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:06:51,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:06:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:06:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:06:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:06:51,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-11-23 22:06:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,558 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:06:51,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:06:51,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:06:51,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:06:51,591 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 22:06:51,591 INFO L447 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-11-23 22:06:51,591 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,591 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-23 22:06:51,591 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:06:51,592 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:06:51,592 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,592 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-11-23 22:06:51,592 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,592 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,592 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L447 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 22:06:51,593 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,594 INFO L447 ceAbstractionStarter]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-11-23 22:06:51,601 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-23 22:06:51,601 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-23 22:06:51,601 INFO L440 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-11-23 22:06:51,601 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-11-23 22:06:51,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:06:51 BoogieIcfgContainer [2019-11-23 22:06:51,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:06:51,619 INFO L168 Benchmark]: Toolchain (without parser) took 2372.17 ms. Allocated memory was 138.4 MB in the beginning and 235.4 MB in the end (delta: 97.0 MB). Free memory was 102.2 MB in the beginning and 168.2 MB in the end (delta: -66.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,620 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.78 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 92.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.90 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 180.5 MB in the end (delta: -88.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,625 INFO L168 Benchmark]: Boogie Preprocessor took 31.22 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 178.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,628 INFO L168 Benchmark]: RCFGBuilder took 318.27 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 165.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,629 INFO L168 Benchmark]: TraceAbstraction took 1644.90 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 164.5 MB in the beginning and 168.2 MB in the end (delta: -3.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:51,635 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.78 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 92.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 101.90 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 180.5 MB in the end (delta: -88.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.22 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 178.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.27 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 165.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1644.90 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 164.5 MB in the beginning and 168.2 MB in the end (delta: -3.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...