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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:43:01,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:43:01,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:43:01,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:43:01,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:43:01,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:43:01,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:43:01,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:43:01,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:43:01,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:43:01,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:43:01,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:43:01,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:43:01,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:43:01,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:43:01,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:43:01,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:43:01,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:43:01,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:43:01,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:43:01,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:43:01,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:43:01,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:43:01,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:43:01,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:43:01,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:43:01,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:43:01,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:43:01,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:43:01,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:43:01,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:43:01,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:43:01,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:43:01,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:43:01,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:43:01,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:43:01,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:43:01,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:43:01,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:43:01,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:43:01,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:43:01,651 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-10-13 19:43:01,678 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:43:01,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:43:01,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:43:01,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:43:01,680 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:43:01,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:43:01,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:43:01,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:43:01,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:43:01,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:43:01,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:43:01,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:43:01,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:43:01,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:43:01,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:43:01,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:43:01,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:43:01,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:43:01,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:43:01,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:43:01,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:43:01,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:43:01,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:43:01,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:43:01,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:43:01,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:43:01,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:43:01,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:43:01,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:43:01,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:43:01,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:43:01,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:43:01,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:43:01,990 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:43:01,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-10-13 19:43:02,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8c61b33/0a06016449c44e76b35a8bb58c24b120/FLAG668ca9c09 [2019-10-13 19:43:02,533 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:43:02,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-10-13 19:43:02,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8c61b33/0a06016449c44e76b35a8bb58c24b120/FLAG668ca9c09 [2019-10-13 19:43:02,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8c61b33/0a06016449c44e76b35a8bb58c24b120 [2019-10-13 19:43:02,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:43:02,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:43:02,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:43:02,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:43:02,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:43:02,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:43:02" (1/1) ... [2019-10-13 19:43:02,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3534b1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:02, skipping insertion in model container [2019-10-13 19:43:02,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:43:02" (1/1) ... [2019-10-13 19:43:02,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:43:02,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:43:03,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:43:03,140 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:43:03,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:43:03,284 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:43:03,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03 WrapperNode [2019-10-13 19:43:03,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:43:03,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:43:03,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:43:03,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:43:03,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (1/1) ... [2019-10-13 19:43:03,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:43:03,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:43:03,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:43:03,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:43:03,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (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-10-13 19:43:03,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:43:03,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:43:03,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:43:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:43:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:43:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:43:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:43:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:43:03,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:43:03,919 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-13 19:43:03,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:03 BoogieIcfgContainer [2019-10-13 19:43:03,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:43:03,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:43:03,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:43:03,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:43:03,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:43:02" (1/3) ... [2019-10-13 19:43:03,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ee0000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:43:03, skipping insertion in model container [2019-10-13 19:43:03,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:43:03" (2/3) ... [2019-10-13 19:43:03,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ee0000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:43:03, skipping insertion in model container [2019-10-13 19:43:03,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:43:03" (3/3) ... [2019-10-13 19:43:03,933 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-10-13 19:43:03,944 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:43:03,951 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:43:03,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:43:03,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:43:03,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:43:03,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:43:03,990 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:43:03,990 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:43:03,990 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:43:03,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:43:03,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:43:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-10-13 19:43:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 19:43:04,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:04,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:43:04,019 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -105811556, now seen corresponding path program 1 times [2019-10-13 19:43:04,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:04,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336786344] [2019-10-13 19:43:04,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:04,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:04,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:43:04,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336786344] [2019-10-13 19:43:04,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:04,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:43:04,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278349370] [2019-10-13 19:43:04,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:43:04,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:43:04,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:43:04,228 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-10-13 19:43:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:04,325 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2019-10-13 19:43:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:43:04,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 19:43:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:04,353 INFO L225 Difference]: With dead ends: 160 [2019-10-13 19:43:04,353 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 19:43:04,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-13 19:43:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 19:43:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-13 19:43:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-13 19:43:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2019-10-13 19:43:04,436 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2019-10-13 19:43:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:04,437 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2019-10-13 19:43:04,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:43:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2019-10-13 19:43:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:43:04,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:04,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:43:04,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1547300989, now seen corresponding path program 1 times [2019-10-13 19:43:04,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:04,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834858258] [2019-10-13 19:43:04,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:04,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:04,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:43:04,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834858258] [2019-10-13 19:43:04,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:04,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:04,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591816157] [2019-10-13 19:43:04,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:04,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:04,560 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 4 states. [2019-10-13 19:43:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:04,890 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2019-10-13 19:43:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:04,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 19:43:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:04,892 INFO L225 Difference]: With dead ends: 153 [2019-10-13 19:43:04,893 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 19:43:04,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 19:43:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-13 19:43:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 19:43:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-10-13 19:43:04,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2019-10-13 19:43:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:04,927 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-10-13 19:43:04,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-10-13 19:43:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:43:04,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:04,928 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:43:04,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash 555004895, now seen corresponding path program 1 times [2019-10-13 19:43:04,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:04,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766247577] [2019-10-13 19:43:04,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:04,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:04,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:43:05,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766247577] [2019-10-13 19:43:05,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:05,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:05,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274851280] [2019-10-13 19:43:05,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:05,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:05,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:05,011 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 4 states. [2019-10-13 19:43:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:05,111 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2019-10-13 19:43:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:05,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-13 19:43:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:05,113 INFO L225 Difference]: With dead ends: 146 [2019-10-13 19:43:05,113 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 19:43:05,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 19:43:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-13 19:43:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 19:43:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-10-13 19:43:05,123 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2019-10-13 19:43:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:05,123 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-10-13 19:43:05,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2019-10-13 19:43:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:43:05,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:05,125 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:43:05,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -624681896, now seen corresponding path program 1 times [2019-10-13 19:43:05,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:05,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919012715] [2019-10-13 19:43:05,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:43:05,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919012715] [2019-10-13 19:43:05,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:05,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:05,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968604056] [2019-10-13 19:43:05,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:05,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:05,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:05,209 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2019-10-13 19:43:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:05,435 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2019-10-13 19:43:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:05,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-13 19:43:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:05,438 INFO L225 Difference]: With dead ends: 192 [2019-10-13 19:43:05,438 INFO L226 Difference]: Without dead ends: 122 [2019-10-13 19:43:05,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-13 19:43:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2019-10-13 19:43:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 19:43:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-10-13 19:43:05,450 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2019-10-13 19:43:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:05,453 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-10-13 19:43:05,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-10-13 19:43:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:43:05,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:05,454 INFO L380 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] [2019-10-13 19:43:05,455 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598883, now seen corresponding path program 1 times [2019-10-13 19:43:05,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:05,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727419773] [2019-10-13 19:43:05,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:43:05,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727419773] [2019-10-13 19:43:05,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:05,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:05,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029339958] [2019-10-13 19:43:05,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:05,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:05,500 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 4 states. [2019-10-13 19:43:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:05,645 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2019-10-13 19:43:05,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:05,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-13 19:43:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:05,647 INFO L225 Difference]: With dead ends: 183 [2019-10-13 19:43:05,647 INFO L226 Difference]: Without dead ends: 87 [2019-10-13 19:43:05,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-13 19:43:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-13 19:43:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 19:43:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2019-10-13 19:43:05,657 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2019-10-13 19:43:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:05,657 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2019-10-13 19:43:05,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2019-10-13 19:43:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:43:05,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:05,659 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:43:05,660 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash -576284788, now seen corresponding path program 1 times [2019-10-13 19:43:05,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:05,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653245365] [2019-10-13 19:43:05,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:43:05,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653245365] [2019-10-13 19:43:05,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:05,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:05,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147033715] [2019-10-13 19:43:05,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:05,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:05,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:05,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:05,727 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 4 states. [2019-10-13 19:43:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:05,846 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2019-10-13 19:43:05,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:05,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-13 19:43:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:05,848 INFO L225 Difference]: With dead ends: 134 [2019-10-13 19:43:05,848 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 19:43:05,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 19:43:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-13 19:43:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:43:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-10-13 19:43:05,856 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2019-10-13 19:43:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:05,857 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-10-13 19:43:05,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-10-13 19:43:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:43:05,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:05,859 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 19:43:05,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:05,859 INFO L82 PathProgramCache]: Analyzing trace with hash -31288535, now seen corresponding path program 1 times [2019-10-13 19:43:05,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:05,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226855113] [2019-10-13 19:43:05,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:05,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:43:05,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226855113] [2019-10-13 19:43:05,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:05,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:05,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668211926] [2019-10-13 19:43:05,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:05,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:05,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:05,921 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 4 states. [2019-10-13 19:43:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:06,135 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2019-10-13 19:43:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:06,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-13 19:43:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:06,137 INFO L225 Difference]: With dead ends: 158 [2019-10-13 19:43:06,137 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 19:43:06,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 19:43:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-10-13 19:43:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-13 19:43:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2019-10-13 19:43:06,146 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2019-10-13 19:43:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:06,149 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2019-10-13 19:43:06,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2019-10-13 19:43:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:43:06,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:06,151 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 19:43:06,151 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash 180888733, now seen corresponding path program 1 times [2019-10-13 19:43:06,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:06,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264276976] [2019-10-13 19:43:06,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:43:06,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264276976] [2019-10-13 19:43:06,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:06,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:06,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303638023] [2019-10-13 19:43:06,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:06,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:06,232 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 4 states. [2019-10-13 19:43:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:06,357 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2019-10-13 19:43:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:06,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-13 19:43:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:06,358 INFO L225 Difference]: With dead ends: 166 [2019-10-13 19:43:06,359 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 19:43:06,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 19:43:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-13 19:43:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-13 19:43:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2019-10-13 19:43:06,367 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2019-10-13 19:43:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:06,367 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2019-10-13 19:43:06,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2019-10-13 19:43:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:43:06,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:06,369 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 19:43:06,369 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash 317242888, now seen corresponding path program 1 times [2019-10-13 19:43:06,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:06,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17706531] [2019-10-13 19:43:06,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:43:06,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17706531] [2019-10-13 19:43:06,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:06,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:06,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250814589] [2019-10-13 19:43:06,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:06,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:06,432 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 4 states. [2019-10-13 19:43:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:06,558 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2019-10-13 19:43:06,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:06,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-13 19:43:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:06,560 INFO L225 Difference]: With dead ends: 139 [2019-10-13 19:43:06,560 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 19:43:06,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 19:43:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-13 19:43:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 19:43:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2019-10-13 19:43:06,565 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2019-10-13 19:43:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:06,566 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-10-13 19:43:06,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2019-10-13 19:43:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:43:06,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:06,567 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 19:43:06,567 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196396, now seen corresponding path program 1 times [2019-10-13 19:43:06,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:06,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508504802] [2019-10-13 19:43:06,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:43:06,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508504802] [2019-10-13 19:43:06,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:06,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:06,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398486622] [2019-10-13 19:43:06,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:06,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:06,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:06,641 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 4 states. [2019-10-13 19:43:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:06,766 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-10-13 19:43:06,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:06,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-13 19:43:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:06,767 INFO L225 Difference]: With dead ends: 74 [2019-10-13 19:43:06,767 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 19:43:06,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 19:43:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-13 19:43:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:43:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2019-10-13 19:43:06,773 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2019-10-13 19:43:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:06,773 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2019-10-13 19:43:06,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2019-10-13 19:43:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:43:06,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:43:06,774 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-13 19:43:06,775 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:43:06,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:43:06,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1000030502, now seen corresponding path program 1 times [2019-10-13 19:43:06,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:43:06,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990087374] [2019-10-13 19:43:06,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:43:06,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:43:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:43:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:43:06,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990087374] [2019-10-13 19:43:06,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:43:06,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:43:06,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931807713] [2019-10-13 19:43:06,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:43:06,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:43:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:43:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:43:06,820 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2019-10-13 19:43:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:43:06,921 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2019-10-13 19:43:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:43:06,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-13 19:43:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:43:06,922 INFO L225 Difference]: With dead ends: 111 [2019-10-13 19:43:06,922 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:43:06,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:43:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:43:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:43:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:43:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:43:06,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-13 19:43:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:43:06,924 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:43:06,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:43:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:43:06,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:43:06,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:43:07,108 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:43:07,109 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|)) [2019-10-13 19:43:07,109 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:43:07,109 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:43:07,109 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:43:07,109 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:43:07,109 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:43:07,109 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-10-13 19:43:07,109 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-10-13 19:43:07,110 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-10-13 19:43:07,111 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2019-10-13 19:43:07,112 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-10-13 19:43:07,112 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-10-13 19:43:07,112 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-10-13 19:43:07,112 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (= main_~this_state~0 3) (<= 4 main_~q~0)) (and (<= main_~this_state~0 0) (= main_~q~0 0))) [2019-10-13 19:43:07,112 INFO L443 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-10-13 19:43:07,112 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-13 19:43:07,112 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-10-13 19:43:07,113 INFO L439 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-10-13 19:43:07,114 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-13 19:43:07,115 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-10-13 19:43:07,115 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-10-13 19:43:07,115 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-10-13 19:43:07,115 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2019-10-13 19:43:07,115 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-10-13 19:43:07,115 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-10-13 19:43:07,115 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-10-13 19:43:07,116 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-10-13 19:43:07,117 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L439 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= main_~this_state~0 3) (<= 4 main_~q~0)) (and .cse0 (= 2 main_~q~0)) (and .cse0 (= main_~q~0 0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)))) [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-10-13 19:43:07,118 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-10-13 19:43:07,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:43:07 BoogieIcfgContainer [2019-10-13 19:43:07,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:43:07,138 INFO L168 Benchmark]: Toolchain (without parser) took 4269.02 ms. Allocated memory was 138.9 MB in the beginning and 246.4 MB in the end (delta: 107.5 MB). Free memory was 104.1 MB in the beginning and 173.3 MB in the end (delta: -69.2 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:43:07,139 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:43:07,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.06 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.9 MB in the beginning and 182.1 MB in the end (delta: -78.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:43:07,141 INFO L168 Benchmark]: Boogie Preprocessor took 51.85 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:43:07,142 INFO L168 Benchmark]: RCFGBuilder took 577.07 ms. Allocated memory is still 203.4 MB. Free memory was 179.4 MB in the beginning and 151.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:43:07,143 INFO L168 Benchmark]: TraceAbstraction took 3213.08 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 151.6 MB in the beginning and 173.3 MB in the end (delta: -21.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:43:07,147 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 416.06 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.9 MB in the beginning and 182.1 MB in the end (delta: -78.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.85 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 577.07 ms. Allocated memory is still 203.4 MB. Free memory was 179.4 MB in the beginning and 151.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3213.08 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 151.6 MB in the beginning and 173.3 MB in the end (delta: -21.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 22]: Loop Invariant Derived loop invariant: (((this_state == 3 && 4 <= q) || (this_state <= 0 && 2 == q)) || (this_state <= 0 && q == 0)) || (3 == q && 2 == this_state) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state == 3 && 4 <= q) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1008 SDtfs, 1441 SDslu, 73 SDs, 0 SdLazy, 634 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, 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, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 67 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 15354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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...