./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_security.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_security.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cc1f38a976dda42d71f86348e088e61d77f90eb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:25:42,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:25:42,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:25:42,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:25:42,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:25:42,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:25:42,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:25:42,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:25:42,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:25:42,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:25:42,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:25:42,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:25:42,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:25:42,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:25:42,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:25:42,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:25:42,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:25:42,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:25:42,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:25:42,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:25:42,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:25:42,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:25:42,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:25:42,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:25:42,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:25:42,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:25:42,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:25:42,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:25:42,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:25:42,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:25:42,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:25:42,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:25:42,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:25:42,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:25:42,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:25:42,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:25:42,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:25:42,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:25:42,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:25:42,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:25:42,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:25:42,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:25:42,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:25:42,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:25:42,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:25:42,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:25:42,178 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:25:42,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:25:42,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:25:42,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:25:42,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:25:42,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:25:42,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:25:42,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:25:42,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:25:42,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:25:42,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:25:42,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:25:42,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:25:42,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:25:42,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:25:42,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:25:42,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:25:42,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:25:42,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:25:42,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:25:42,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:25:42,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:25:42,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:25:42,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:25:42,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2019-11-27 23:25:42,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:25:42,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:25:42,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:25:42,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:25:42,521 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:25:42,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_security.c [2019-11-27 23:25:42,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43d7c2fd/3da88b889fe24f418ff49eda67e44e39/FLAG09683733b [2019-11-27 23:25:43,081 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:25:43,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_security.c [2019-11-27 23:25:43,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43d7c2fd/3da88b889fe24f418ff49eda67e44e39/FLAG09683733b [2019-11-27 23:25:43,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43d7c2fd/3da88b889fe24f418ff49eda67e44e39 [2019-11-27 23:25:43,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:25:43,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:25:43,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:25:43,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:25:43,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:25:43,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a58cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43, skipping insertion in model container [2019-11-27 23:25:43,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:25:43,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:25:43,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:25:43,797 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:25:43,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:25:43,916 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:25:43,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43 WrapperNode [2019-11-27 23:25:43,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:25:43,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:25:43,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:25:43,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:25:43,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:25:43,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:25:43,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:25:43,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:25:43,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:43,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:44,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:44,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:44,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (1/1) ... [2019-11-27 23:25:44,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:25:44,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:25:44,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:25:44,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:25:44,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (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-27 23:25:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:25:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:25:44,558 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:25:44,558 INFO L297 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-27 23:25:44,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:44 BoogieIcfgContainer [2019-11-27 23:25:44,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:25:44,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:25:44,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:25:44,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:25:44,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:25:43" (1/3) ... [2019-11-27 23:25:44,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ff395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:44, skipping insertion in model container [2019-11-27 23:25:44,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:43" (2/3) ... [2019-11-27 23:25:44,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ff395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:44, skipping insertion in model container [2019-11-27 23:25:44,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:44" (3/3) ... [2019-11-27 23:25:44,570 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-11-27 23:25:44,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:25:44,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:25:44,601 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:25:44,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:25:44,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:25:44,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:25:44,627 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:25:44,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:25:44,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:25:44,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:25:44,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:25:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-27 23:25:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:25:44,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:44,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:44,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash 352571364, now seen corresponding path program 1 times [2019-11-27 23:25:44,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:44,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310968576] [2019-11-27 23:25:44,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:44,779 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-27 23:25:44,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310968576] [2019-11-27 23:25:44,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:44,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:25:44,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658861543] [2019-11-27 23:25:44,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:25:44,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:44,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:25:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:25:44,808 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-27 23:25:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:44,838 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2019-11-27 23:25:44,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:25:44,840 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-27 23:25:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:44,853 INFO L225 Difference]: With dead ends: 154 [2019-11-27 23:25:44,854 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:25:44,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:25:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:25:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-27 23:25:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:25:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-11-27 23:25:44,904 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2019-11-27 23:25:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:44,904 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-27 23:25:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:25:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-11-27 23:25:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:25:44,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:44,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:44,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697708, now seen corresponding path program 1 times [2019-11-27 23:25:44,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:44,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975492255] [2019-11-27 23:25:44,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:44,946 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-27 23:25:44,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975492255] [2019-11-27 23:25:44,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:44,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:44,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685443404] [2019-11-27 23:25:44,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:44,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:44,949 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 3 states. [2019-11-27 23:25:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,022 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2019-11-27 23:25:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 23:25:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,024 INFO L225 Difference]: With dead ends: 149 [2019-11-27 23:25:45,024 INFO L226 Difference]: Without dead ends: 77 [2019-11-27 23:25:45,026 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-27 23:25:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-27 23:25:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-27 23:25:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-27 23:25:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-11-27 23:25:45,036 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2019-11-27 23:25:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,036 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-11-27 23:25:45,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-11-27 23:25:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:25:45,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,039 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:45,040 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 658032583, now seen corresponding path program 1 times [2019-11-27 23:25:45,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638950528] [2019-11-27 23:25:45,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:45,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638950528] [2019-11-27 23:25:45,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:45,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:45,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492907151] [2019-11-27 23:25:45,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:45,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:45,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:45,123 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2019-11-27 23:25:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,215 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2019-11-27 23:25:45,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 23:25:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,220 INFO L225 Difference]: With dead ends: 142 [2019-11-27 23:25:45,220 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 23:25:45,222 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-27 23:25:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 23:25:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-27 23:25:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-27 23:25:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-11-27 23:25:45,241 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2019-11-27 23:25:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,241 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-11-27 23:25:45,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-11-27 23:25:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:25:45,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,246 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:45,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2066489199, now seen corresponding path program 1 times [2019-11-27 23:25:45,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011525767] [2019-11-27 23:25:45,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:45,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011525767] [2019-11-27 23:25:45,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:45,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:45,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495275845] [2019-11-27 23:25:45,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:45,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:45,301 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 3 states. [2019-11-27 23:25:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,414 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-11-27 23:25:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 23:25:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,416 INFO L225 Difference]: With dead ends: 188 [2019-11-27 23:25:45,416 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 23:25:45,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-27 23:25:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 23:25:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2019-11-27 23:25:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-27 23:25:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2019-11-27 23:25:45,428 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 18 [2019-11-27 23:25:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,429 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2019-11-27 23:25:45,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2019-11-27 23:25:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:25:45,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,430 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:45,431 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,431 INFO L82 PathProgramCache]: Analyzing trace with hash 290326405, now seen corresponding path program 1 times [2019-11-27 23:25:45,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331157333] [2019-11-27 23:25:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:45,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331157333] [2019-11-27 23:25:45,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:45,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:45,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872398033] [2019-11-27 23:25:45,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:45,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:45,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:45,458 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 3 states. [2019-11-27 23:25:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,506 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2019-11-27 23:25:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 23:25:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,511 INFO L225 Difference]: With dead ends: 179 [2019-11-27 23:25:45,511 INFO L226 Difference]: Without dead ends: 83 [2019-11-27 23:25:45,512 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-27 23:25:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-27 23:25:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-27 23:25:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-27 23:25:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-11-27 23:25:45,520 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 19 [2019-11-27 23:25:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,520 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-11-27 23:25:45,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-11-27 23:25:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:25:45,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,522 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:45,522 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1696736468, now seen corresponding path program 1 times [2019-11-27 23:25:45,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871695644] [2019-11-27 23:25:45,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:45,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871695644] [2019-11-27 23:25:45,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:45,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:45,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201572149] [2019-11-27 23:25:45,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:45,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:45,567 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 3 states. [2019-11-27 23:25:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,612 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2019-11-27 23:25:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 23:25:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,614 INFO L225 Difference]: With dead ends: 130 [2019-11-27 23:25:45,614 INFO L226 Difference]: Without dead ends: 66 [2019-11-27 23:25:45,615 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-27 23:25:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-27 23:25:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-27 23:25:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-27 23:25:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2019-11-27 23:25:45,621 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2019-11-27 23:25:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,622 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-11-27 23:25:45,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2019-11-27 23:25:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:25:45,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,623 INFO L410 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] [2019-11-27 23:25:45,624 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1712893632, now seen corresponding path program 1 times [2019-11-27 23:25:45,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772412184] [2019-11-27 23:25:45,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:45,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772412184] [2019-11-27 23:25:45,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:45,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:45,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871876360] [2019-11-27 23:25:45,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:45,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:45,684 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 3 states. [2019-11-27 23:25:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,782 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2019-11-27 23:25:45,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 23:25:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,784 INFO L225 Difference]: With dead ends: 154 [2019-11-27 23:25:45,785 INFO L226 Difference]: Without dead ends: 107 [2019-11-27 23:25:45,785 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-27 23:25:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-27 23:25:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-27 23:25:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-27 23:25:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2019-11-27 23:25:45,807 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 26 [2019-11-27 23:25:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,807 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2019-11-27 23:25:45,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2019-11-27 23:25:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:25:45,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,810 INFO L410 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] [2019-11-27 23:25:45,811 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1584038971, now seen corresponding path program 1 times [2019-11-27 23:25:45,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715167672] [2019-11-27 23:25:45,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:45,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715167672] [2019-11-27 23:25:45,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:45,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:45,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691332793] [2019-11-27 23:25:45,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:45,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:45,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:45,866 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand 3 states. [2019-11-27 23:25:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:45,915 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2019-11-27 23:25:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:45,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 23:25:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:45,917 INFO L225 Difference]: With dead ends: 162 [2019-11-27 23:25:45,917 INFO L226 Difference]: Without dead ends: 88 [2019-11-27 23:25:45,921 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-27 23:25:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-27 23:25:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-27 23:25:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-27 23:25:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-11-27 23:25:45,938 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 27 [2019-11-27 23:25:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:45,939 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-11-27 23:25:45,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-11-27 23:25:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:25:45,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:45,946 INFO L410 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] [2019-11-27 23:25:45,946 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1447684816, now seen corresponding path program 1 times [2019-11-27 23:25:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:45,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371389964] [2019-11-27 23:25:45,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:46,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371389964] [2019-11-27 23:25:46,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:46,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:46,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286158038] [2019-11-27 23:25:46,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:46,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:46,006 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 3 states. [2019-11-27 23:25:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:46,057 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2019-11-27 23:25:46,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:46,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 23:25:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:46,059 INFO L225 Difference]: With dead ends: 135 [2019-11-27 23:25:46,059 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 23:25:46,060 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-27 23:25:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 23:25:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-27 23:25:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-27 23:25:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-11-27 23:25:46,066 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 27 [2019-11-27 23:25:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:46,070 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-11-27 23:25:46,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2019-11-27 23:25:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:25:46,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:46,073 INFO L410 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] [2019-11-27 23:25:46,073 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash -573380405, now seen corresponding path program 1 times [2019-11-27 23:25:46,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:46,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204462855] [2019-11-27 23:25:46,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:46,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204462855] [2019-11-27 23:25:46,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:46,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:46,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336575048] [2019-11-27 23:25:46,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:46,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:46,139 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 3 states. [2019-11-27 23:25:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:46,189 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-27 23:25:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:46,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-27 23:25:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:46,193 INFO L225 Difference]: With dead ends: 70 [2019-11-27 23:25:46,193 INFO L226 Difference]: Without dead ends: 66 [2019-11-27 23:25:46,197 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-27 23:25:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-27 23:25:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-27 23:25:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-27 23:25:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-27 23:25:46,205 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 28 [2019-11-27 23:25:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:46,208 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-27 23:25:46,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-27 23:25:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:25:46,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:46,209 INFO L410 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] [2019-11-27 23:25:46,209 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash -583473182, now seen corresponding path program 1 times [2019-11-27 23:25:46,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:46,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596153546] [2019-11-27 23:25:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:46,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596153546] [2019-11-27 23:25:46,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:46,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:46,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82286565] [2019-11-27 23:25:46,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:46,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:46,250 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-27 23:25:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:46,283 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2019-11-27 23:25:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:46,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-27 23:25:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:46,284 INFO L225 Difference]: With dead ends: 107 [2019-11-27 23:25:46,284 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:25:46,285 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-27 23:25:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:25:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:25:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:25:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:25:46,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-27 23:25:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:46,286 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:25:46,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:25:46,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:25:46,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:25:46,393 INFO L246 CegarLoopResult]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-11-27 23:25:46,393 INFO L246 CegarLoopResult]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-11-27 23:25:46,394 INFO L246 CegarLoopResult]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-11-27 23:25:46,395 INFO L246 CegarLoopResult]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-11-27 23:25:46,396 INFO L246 CegarLoopResult]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-11-27 23:25:46,396 INFO L246 CegarLoopResult]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-11-27 23:25:46,396 INFO L246 CegarLoopResult]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-11-27 23:25:46,396 INFO L246 CegarLoopResult]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-11-27 23:25:46,396 INFO L246 CegarLoopResult]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-11-27 23:25:46,396 INFO L246 CegarLoopResult]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-11-27 23:25:46,397 INFO L242 CegarLoopResult]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-27 23:25:46,397 INFO L246 CegarLoopResult]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-11-27 23:25:46,397 INFO L246 CegarLoopResult]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-27 23:25:46,397 INFO L246 CegarLoopResult]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-11-27 23:25:46,397 INFO L246 CegarLoopResult]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-11-27 23:25:46,398 INFO L246 CegarLoopResult]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-11-27 23:25:46,398 INFO L246 CegarLoopResult]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-27 23:25:46,398 INFO L246 CegarLoopResult]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-11-27 23:25:46,398 INFO L246 CegarLoopResult]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-11-27 23:25:46,398 INFO L246 CegarLoopResult]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-11-27 23:25:46,398 INFO L246 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-11-27 23:25:46,399 INFO L242 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-11-27 23:25:46,399 INFO L246 CegarLoopResult]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-11-27 23:25:46,399 INFO L246 CegarLoopResult]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-11-27 23:25:46,399 INFO L246 CegarLoopResult]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-11-27 23:25:46,399 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:25:46,399 INFO L246 CegarLoopResult]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-11-27 23:25:46,399 INFO L246 CegarLoopResult]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-11-27 23:25:46,400 INFO L246 CegarLoopResult]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-27 23:25:46,400 INFO L246 CegarLoopResult]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-11-27 23:25:46,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:25:46,400 INFO L246 CegarLoopResult]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-11-27 23:25:46,400 INFO L249 CegarLoopResult]: At program point L13(lines 13 390) the Hoare annotation is: true [2019-11-27 23:25:46,400 INFO L246 CegarLoopResult]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-27 23:25:46,400 INFO L246 CegarLoopResult]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-11-27 23:25:46,401 INFO L246 CegarLoopResult]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-11-27 23:25:46,401 INFO L246 CegarLoopResult]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-11-27 23:25:46,401 INFO L246 CegarLoopResult]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-11-27 23:25:46,401 INFO L246 CegarLoopResult]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-11-27 23:25:46,401 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:25:46,401 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-11-27 23:25:46,402 INFO L246 CegarLoopResult]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-11-27 23:25:46,403 INFO L246 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-27 23:25:46,404 INFO L242 CegarLoopResult]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (= ULTIMATE.start_main_~q~0 3) (= 2 ULTIMATE.start_main_~this_state~0)) (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-27 23:25:46,404 INFO L246 CegarLoopResult]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-11-27 23:25:46,404 INFO L246 CegarLoopResult]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-11-27 23:25:46,404 INFO L246 CegarLoopResult]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-11-27 23:25:46,404 INFO L246 CegarLoopResult]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-11-27 23:25:46,404 INFO L246 CegarLoopResult]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-11-27 23:25:46,405 INFO L246 CegarLoopResult]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-11-27 23:25:46,405 INFO L246 CegarLoopResult]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-11-27 23:25:46,405 INFO L246 CegarLoopResult]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-11-27 23:25:46,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:25:46 BoogieIcfgContainer [2019-11-27 23:25:46,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:25:46,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:25:46,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:25:46,430 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:25:46,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:44" (3/4) ... [2019-11-27 23:25:46,435 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:25:46,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 23:25:46,474 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 23:25:46,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:25:46,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:25:46,561 INFO L168 Benchmark]: Toolchain (without parser) took 3070.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 950.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 156.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:46,562 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:25:46,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:46,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:25:46,569 INFO L168 Benchmark]: Boogie Preprocessor took 45.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:25:46,570 INFO L168 Benchmark]: RCFGBuilder took 538.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:46,572 INFO L168 Benchmark]: TraceAbstraction took 1867.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 950.9 MB in the end (delta: 151.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:46,574 INFO L168 Benchmark]: Witness Printer took 128.43 ms. Allocated memory is still 1.2 GB. Free memory is still 950.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:25:46,583 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 538.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1867.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 950.9 MB in the end (delta: 151.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. * Witness Printer took 128.43 ms. Allocated memory is still 1.2 GB. Free memory is still 950.9 MB. There was no memory consumed. Max. memory is 11.5 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: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((q == 3 && 2 == this_state) || (4 <= q && 3 == this_state)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && 3 == this_state) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 963 SDtfs, 337 SDslu, 415 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8086 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...