./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.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 f345f307410a5ddbdd0513896d69ca703c67be23 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:07:00,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:07:00,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:07:00,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:07:00,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:07:00,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:07:00,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:07:00,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:07:00,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:07:00,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:07:00,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:07:00,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:07:00,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:07:00,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:07:00,175 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:07:00,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:07:00,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:07:00,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:07:00,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:07:00,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:07:00,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:07:00,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:07:00,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:07:00,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:07:00,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:07:00,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:07:00,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:07:00,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:07:00,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:07:00,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:07:00,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:07:00,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:07:00,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:07:00,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:07:00,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:07:00,196 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:07:00,196 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:07:00,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:07:00,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:07:00,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:07:00,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:07:00,232 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:07:00,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:07:00,233 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:07:00,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:07:00,233 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:07:00,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:07:00,233 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:07:00,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:07:00,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:07:00,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:07:00,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:07:00,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:07:00,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:07:00,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:07:00,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:07:00,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:07:00,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:07:00,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:07:00,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:07:00,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:07:00,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:07:00,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:07:00,239 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:07:00,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:07:00,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> f345f307410a5ddbdd0513896d69ca703c67be23 [2018-12-31 10:07:00,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:07:00,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:07:00,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:07:00,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:07:00,324 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:07:00,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-12-31 10:07:00,389 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2eb1432/b94cd49f3dc0451eaaae16b088a43294/FLAG21d54420b [2018-12-31 10:07:00,880 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:07:00,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-12-31 10:07:00,887 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2eb1432/b94cd49f3dc0451eaaae16b088a43294/FLAG21d54420b [2018-12-31 10:07:01,227 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2eb1432/b94cd49f3dc0451eaaae16b088a43294 [2018-12-31 10:07:01,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:07:01,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:07:01,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:07:01,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:07:01,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:07:01,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ddc4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01, skipping insertion in model container [2018-12-31 10:07:01,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:07:01,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:07:01,527 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:07:01,534 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:07:01,565 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:07:01,586 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:07:01,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01 WrapperNode [2018-12-31 10:07:01,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:07:01,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:07:01,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:07:01,590 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:07:01,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:07:01,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:07:01,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:07:01,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:07:01,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (1/1) ... [2018-12-31 10:07:01,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:07:01,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:07:01,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:07:01,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:07:01,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (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 [2018-12-31 10:07:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-12-31 10:07:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-12-31 10:07:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:07:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:07:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-12-31 10:07:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-12-31 10:07:02,147 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:07:02,147 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 10:07:02,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:07:02 BoogieIcfgContainer [2018-12-31 10:07:02,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:07:02,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:07:02,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:07:02,152 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:07:02,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:07:01" (1/3) ... [2018-12-31 10:07:02,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7278cb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:07:02, skipping insertion in model container [2018-12-31 10:07:02,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:01" (2/3) ... [2018-12-31 10:07:02,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7278cb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:07:02, skipping insertion in model container [2018-12-31 10:07:02,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:07:02" (3/3) ... [2018-12-31 10:07:02,156 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-12-31 10:07:02,166 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:07:02,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:07:02,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:07:02,230 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:07:02,230 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:07:02,231 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:07:02,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:07:02,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:07:02,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:07:02,231 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:07:02,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:07:02,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:07:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-31 10:07:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 10:07:02,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:02,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:02,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash -394807891, now seen corresponding path program 1 times [2018-12-31 10:07:02,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:02,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:07:02,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:02,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:02,623 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-12-31 10:07:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:02,706 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-31 10:07:02,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:02,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 10:07:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:02,720 INFO L225 Difference]: With dead ends: 35 [2018-12-31 10:07:02,720 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 10:07:02,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 10:07:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 10:07:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 10:07:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-12-31 10:07:02,769 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2018-12-31 10:07:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:02,770 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-31 10:07:02,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-12-31 10:07:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 10:07:02,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:02,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:02,772 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1343664860, now seen corresponding path program 1 times [2018-12-31 10:07:02,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:02,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:02,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:02,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:07:02,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:02,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:02,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:02,981 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2018-12-31 10:07:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:03,027 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-31 10:07:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:03,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-31 10:07:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:03,030 INFO L225 Difference]: With dead ends: 40 [2018-12-31 10:07:03,030 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 10:07:03,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 10:07:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 10:07:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:07:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-31 10:07:03,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-12-31 10:07:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:03,042 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-31 10:07:03,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-31 10:07:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 10:07:03,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:03,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:03,044 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1372294011, now seen corresponding path program 1 times [2018-12-31 10:07:03,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:03,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:03,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:03,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:07:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 10:07:03,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 10:07:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 10:07:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:07:03,494 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2018-12-31 10:07:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:03,583 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 10:07:03,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 10:07:03,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-31 10:07:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:03,584 INFO L225 Difference]: With dead ends: 32 [2018-12-31 10:07:03,585 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 10:07:03,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:07:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 10:07:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 10:07:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:07:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-31 10:07:03,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-12-31 10:07:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:03,592 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-31 10:07:03,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 10:07:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-31 10:07:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:07:03,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:03,594 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:03,594 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1000474712, now seen corresponding path program 1 times [2018-12-31 10:07:03,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:03,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:07:03,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:03,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:03,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:03,771 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-12-31 10:07:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:03,800 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-12-31 10:07:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:03,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 10:07:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:03,803 INFO L225 Difference]: With dead ends: 44 [2018-12-31 10:07:03,803 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 10:07:03,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 10:07:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-31 10:07:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 10:07:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 10:07:03,811 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2018-12-31 10:07:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:03,811 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 10:07:03,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 10:07:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:07:03,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:03,813 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:03,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1196988217, now seen corresponding path program 1 times [2018-12-31 10:07:03,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:03,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:03,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:03,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:07:03,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:03,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:03,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:03,941 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-12-31 10:07:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:03,983 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-31 10:07:03,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:03,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 10:07:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:03,985 INFO L225 Difference]: With dead ends: 36 [2018-12-31 10:07:03,986 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 10:07:03,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 10:07:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-31 10:07:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 10:07:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 10:07:03,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2018-12-31 10:07:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:03,993 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 10:07:03,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 10:07:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:07:03,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:03,995 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:03,995 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:03,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1168359066, now seen corresponding path program 1 times [2018-12-31 10:07:03,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:03,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:07:04,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:04,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:07:04,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:04,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:07:04,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:07:04,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-31 10:07:04,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 10:07:04,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 10:07:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:07:04,898 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2018-12-31 10:07:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:05,135 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-12-31 10:07:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 10:07:05,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-31 10:07:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:05,138 INFO L225 Difference]: With dead ends: 54 [2018-12-31 10:07:05,138 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 10:07:05,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:07:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 10:07:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-12-31 10:07:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 10:07:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 10:07:05,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2018-12-31 10:07:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:05,145 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 10:07:05,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 10:07:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 10:07:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 10:07:05,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:05,146 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:05,147 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash -26461427, now seen corresponding path program 1 times [2018-12-31 10:07:05,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:05,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:07:05,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:05,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:05,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:05,393 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-12-31 10:07:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:05,424 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-31 10:07:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:05,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 10:07:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:05,428 INFO L225 Difference]: With dead ends: 50 [2018-12-31 10:07:05,428 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 10:07:05,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 10:07:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-31 10:07:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 10:07:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-31 10:07:05,435 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 30 [2018-12-31 10:07:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:05,435 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-31 10:07:05,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-31 10:07:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 10:07:05,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:05,437 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:05,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -222974932, now seen corresponding path program 1 times [2018-12-31 10:07:05,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:05,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:05,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:07:05,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:05,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:07:05,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:05,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:07:05,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:07:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-31 10:07:05,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 10:07:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 10:07:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:07:05,993 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-12-31 10:07:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:06,148 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-12-31 10:07:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 10:07:06,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-12-31 10:07:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:06,152 INFO L225 Difference]: With dead ends: 66 [2018-12-31 10:07:06,153 INFO L226 Difference]: Without dead ends: 48 [2018-12-31 10:07:06,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:07:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-31 10:07:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-12-31 10:07:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 10:07:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-31 10:07:06,160 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2018-12-31 10:07:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:06,160 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-31 10:07:06,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 10:07:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-31 10:07:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 10:07:06,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:06,162 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:06,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash -141607649, now seen corresponding path program 2 times [2018-12-31 10:07:06,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:06,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:06,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 10:07:06,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:06,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:07:06,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:07:06,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:07:06,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:07:06,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 10:07:06,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:07:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 17 [2018-12-31 10:07:06,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 10:07:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 10:07:06,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-12-31 10:07:06,698 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 17 states. [2018-12-31 10:07:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:07,434 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-12-31 10:07:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 10:07:07,435 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-12-31 10:07:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:07,436 INFO L225 Difference]: With dead ends: 54 [2018-12-31 10:07:07,436 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 10:07:07,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-12-31 10:07:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 10:07:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 10:07:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 10:07:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 10:07:07,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-31 10:07:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:07,439 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 10:07:07,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 10:07:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 10:07:07,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 10:07:07,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 10:07:07,462 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-12-31 10:07:07,462 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2018-12-31 10:07:07,462 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 10:07:07,463 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 27) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-12-31 10:07:07,464 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2018-12-31 10:07:07,465 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-12-31 10:07:07,465 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-12-31 10:07:07,465 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-12-31 10:07:07,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:07:07 BoogieIcfgContainer [2018-12-31 10:07:07,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:07:07,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:07:07,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:07:07,469 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:07:07,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:07:02" (3/4) ... [2018-12-31 10:07:07,474 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 10:07:07,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-12-31 10:07:07,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-12-31 10:07:07,487 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 10:07:07,487 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 10:07:07,536 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:07:07,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:07:07,537 INFO L168 Benchmark]: Toolchain (without parser) took 6306.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 852.7 MB in the end (delta: 94.6 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:07,540 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:07,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.69 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:07,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.19 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:07,541 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:07,542 INFO L168 Benchmark]: RCFGBuilder took 485.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:07,543 INFO L168 Benchmark]: TraceAbstraction took 5319.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 852.7 MB in the end (delta: 256.6 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:07,543 INFO L168 Benchmark]: Witness Printer took 67.40 ms. Allocated memory is still 1.2 GB. Free memory is still 852.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:07,547 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.69 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.19 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 485.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5319.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 852.7 MB in the end (delta: 256.6 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. * Witness Printer took 67.40 ms. Allocated memory is still 1.2 GB. Free memory is still 852.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 27 SDslu, 1253 SDs, 0 SdLazy, 332 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 5 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 26281 SizeOfPredicates, 10 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 61/93 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...