./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_b5_o10.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/recursive-simple/id2_b5_o10.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 6f330f622534898bf170bbd5a7ac37bee3deb574 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:35,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:35,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:35,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:35,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:35,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:35,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:35,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:35,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:35,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:35,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:35,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:35,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:35,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:35,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:35,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:35,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:35,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:35,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:35,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:35,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:35,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:35,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:35,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:35,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:35,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:35,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:35,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:35,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:35,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:35,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:35,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:35,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:35,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:35,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:35,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:35,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:35,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:35,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:35,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:35,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:35,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:35,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:35,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:35,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:35,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:35,862 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:35,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:35,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:35,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:35,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:35,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:35,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:35,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:35,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:35,866 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:35,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:35,867 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:35,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:35,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:35,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:35,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:35,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:35,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:35,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:35,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:35,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:35,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:35,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:35,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:35,870 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 -> 6f330f622534898bf170bbd5a7ac37bee3deb574 [2019-11-28 00:25:36,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:36,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:36,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:36,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:36,221 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:36,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_b5_o10.c [2019-11-28 00:25:36,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029b73f2b/8ff3452aca124f01bc5c7f76eb5641a6/FLAGd90457b17 [2019-11-28 00:25:36,727 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:36,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_b5_o10.c [2019-11-28 00:25:36,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029b73f2b/8ff3452aca124f01bc5c7f76eb5641a6/FLAGd90457b17 [2019-11-28 00:25:37,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029b73f2b/8ff3452aca124f01bc5c7f76eb5641a6 [2019-11-28 00:25:37,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:37,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:37,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:37,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:37,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:37,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afdabe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37, skipping insertion in model container [2019-11-28 00:25:37,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:37,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:37,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:37,410 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:37,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:37,441 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:37,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37 WrapperNode [2019-11-28 00:25:37,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:37,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:37,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:37,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:37,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:37,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:37,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:37,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:37,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (1/1) ... [2019-11-28 00:25:37,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:37,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:37,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:37,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:37,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (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-28 00:25:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-11-28 00:25:37,614 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-11-28 00:25:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:37,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 00:25:37,614 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 00:25:37,828 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:37,829 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:37,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:37 BoogieIcfgContainer [2019-11-28 00:25:37,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:37,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:37,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:37,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:37,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:37" (1/3) ... [2019-11-28 00:25:37,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f85544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:37, skipping insertion in model container [2019-11-28 00:25:37,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:37" (2/3) ... [2019-11-28 00:25:37,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f85544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:37, skipping insertion in model container [2019-11-28 00:25:37,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:37" (3/3) ... [2019-11-28 00:25:37,860 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_b5_o10.c [2019-11-28 00:25:37,887 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:37,905 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:37,928 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:37,956 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:37,956 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:37,956 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:37,957 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:37,957 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:37,957 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:37,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:37,958 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-28 00:25:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:37,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:37,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:37,982 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash -394807891, now seen corresponding path program 1 times [2019-11-28 00:25:37,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:37,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942334666] [2019-11-28 00:25:37,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,233 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-28 00:25:38,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942334666] [2019-11-28 00:25:38,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:38,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:38,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776421249] [2019-11-28 00:25:38,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:38,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,261 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-28 00:25:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,312 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-28 00:25:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:38,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:25:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,325 INFO L225 Difference]: With dead ends: 35 [2019-11-28 00:25:38,325 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 00:25:38,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 00:25:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 00:25:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 00:25:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 00:25:38,370 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2019-11-28 00:25:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,371 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 00:25:38,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-28 00:25:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:25:38,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,374 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1343664860, now seen corresponding path program 1 times [2019-11-28 00:25:38,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307719248] [2019-11-28 00:25:38,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,524 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-28 00:25:38,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307719248] [2019-11-28 00:25:38,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:38,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:38,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308651285] [2019-11-28 00:25:38,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:38,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,531 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-11-28 00:25:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,560 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-11-28 00:25:38,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:38,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 00:25:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,562 INFO L225 Difference]: With dead ends: 28 [2019-11-28 00:25:38,562 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 00:25:38,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 00:25:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 00:25:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 00:25:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 00:25:38,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-11-28 00:25:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,572 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 00:25:38,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-28 00:25:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:25:38,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,574 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1372294011, now seen corresponding path program 1 times [2019-11-28 00:25:38,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818228371] [2019-11-28 00:25:38,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,756 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-28 00:25:38,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818228371] [2019-11-28 00:25:38,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:38,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:25:38,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509890996] [2019-11-28 00:25:38,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:25:38,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:38,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:25:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:38,759 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2019-11-28 00:25:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:38,832 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-11-28 00:25:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:38,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 00:25:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:38,837 INFO L225 Difference]: With dead ends: 44 [2019-11-28 00:25:38,837 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 00:25:38,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:25:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 00:25:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 00:25:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-28 00:25:38,855 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-28 00:25:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:38,857 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 00:25:38,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:25:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-28 00:25:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:38,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:38,860 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:38,860 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash -971845561, now seen corresponding path program 1 times [2019-11-28 00:25:38,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:38,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367741895] [2019-11-28 00:25:38,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:39,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367741895] [2019-11-28 00:25:39,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:39,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:39,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98679236] [2019-11-28 00:25:39,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:39,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:39,095 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-11-28 00:25:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:39,127 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-28 00:25:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:39,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 00:25:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:39,131 INFO L225 Difference]: With dead ends: 46 [2019-11-28 00:25:39,131 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:25:39,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:25:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 00:25:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 00:25:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-28 00:25:39,148 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-11-28 00:25:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:39,148 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-28 00:25:39,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-28 00:25:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:25:39,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:39,150 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:39,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1168359066, now seen corresponding path program 1 times [2019-11-28 00:25:39,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:39,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226856606] [2019-11-28 00:25:39,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:39,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226856606] [2019-11-28 00:25:39,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172527627] [2019-11-28 00:25:39,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:39,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:25:39,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:39,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:39,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-28 00:25:39,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823027545] [2019-11-28 00:25:39,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:39,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:39,582 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2019-11-28 00:25:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:39,732 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-28 00:25:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 00:25:39,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 00:25:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:39,734 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:25:39,737 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 00:25:39,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 00:25:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-28 00:25:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:25:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-28 00:25:39,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-11-28 00:25:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:39,753 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-28 00:25:39,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-28 00:25:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:25:39,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:39,755 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:39,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:39,959 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash -222974932, now seen corresponding path program 1 times [2019-11-28 00:25:39,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:39,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670656821] [2019-11-28 00:25:39,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:25:40,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670656821] [2019-11-28 00:25:40,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028639089] [2019-11-28 00:25:40,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:40,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:25:40,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:25:40,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:40,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-28 00:25:40,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109284120] [2019-11-28 00:25:40,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:25:40,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:25:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:25:40,503 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 15 states. [2019-11-28 00:25:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:40,685 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-28 00:25:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:25:40,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-11-28 00:25:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:40,688 INFO L225 Difference]: With dead ends: 68 [2019-11-28 00:25:40,688 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 00:25:40,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 00:25:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2019-11-28 00:25:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:25:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 00:25:40,697 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-11-28 00:25:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:40,698 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 00:25:40,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:25:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 00:25:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:25:40,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:40,701 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:40,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:40,907 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash -141607649, now seen corresponding path program 2 times [2019-11-28 00:25:40,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:40,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201002519] [2019-11-28 00:25:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 00:25:41,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201002519] [2019-11-28 00:25:41,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415030702] [2019-11-28 00:25:41,334 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:41,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:41,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:41,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:25:41,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 00:25:41,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:41,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-11-28 00:25:41,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851758433] [2019-11-28 00:25:41,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:25:41,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:25:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:41,455 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 18 states. [2019-11-28 00:25:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:41,717 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-11-28 00:25:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:41,719 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-11-28 00:25:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:41,723 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:25:41,724 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:25:41,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:25:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-11-28 00:25:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 00:25:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 00:25:41,737 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 37 [2019-11-28 00:25:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:41,738 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 00:25:41,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:25:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 00:25:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:25:41,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:41,740 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:41,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:41,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash -90623267, now seen corresponding path program 2 times [2019-11-28 00:25:41,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:41,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441460393] [2019-11-28 00:25:41,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 00:25:42,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441460393] [2019-11-28 00:25:42,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661946944] [2019-11-28 00:25:42,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:42,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 00:25:42,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:42,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:42,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 00:25:42,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:25:42,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2019-11-28 00:25:42,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130181435] [2019-11-28 00:25:42,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:42,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:42,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:25:42,501 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-28 00:25:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:42,514 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-28 00:25:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:42,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-28 00:25:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:42,515 INFO L225 Difference]: With dead ends: 42 [2019-11-28 00:25:42,515 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:25:42,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:25:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:25:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:25:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:25:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:25:42,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-28 00:25:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:42,517 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:25:42,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:25:42,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:25:42,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:42,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:25:42,737 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 00:25:42,737 INFO L249 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2019-11-28 00:25:42,737 INFO L246 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2019-11-28 00:25:42,737 INFO L246 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-28 00:25:42,737 INFO L246 CegarLoopResult]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2019-11-28 00:25:42,738 INFO L249 CegarLoopResult]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2019-11-28 00:25:42,738 INFO L246 CegarLoopResult]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2019-11-28 00:25:42,738 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:25:42,738 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:25:42,738 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:25:42,738 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-28 00:25:42,738 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L249 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2019-11-28 00:25:42,739 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L246 CegarLoopResult]: For program point L21(lines 21 27) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L246 CegarLoopResult]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L246 CegarLoopResult]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-28 00:25:42,739 INFO L249 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2019-11-28 00:25:42,740 INFO L246 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2019-11-28 00:25:42,740 INFO L246 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-28 00:25:42,740 INFO L249 CegarLoopResult]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2019-11-28 00:25:42,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:25:42 BoogieIcfgContainer [2019-11-28 00:25:42,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:25:42,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:25:42,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:25:42,746 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:25:42,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:37" (3/4) ... [2019-11-28 00:25:42,749 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:25:42,757 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2019-11-28 00:25:42,757 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-11-28 00:25:42,762 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:25:42,762 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:25:42,813 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:25:42,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:25:42,816 INFO L168 Benchmark]: Toolchain (without parser) took 5686.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,820 INFO L168 Benchmark]: CDTParser took 0.28 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-28 00:25:42,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.99 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,827 INFO L168 Benchmark]: Boogie Preprocessor took 19.32 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-28 00:25:42,829 INFO L168 Benchmark]: RCFGBuilder took 277.26 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,830 INFO L168 Benchmark]: TraceAbstraction took 4912.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,832 INFO L168 Benchmark]: Witness Printer took 68.41 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:25:42,837 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.28 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 311.99 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 91.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.32 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 277.26 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4912.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. * Witness Printer took 68.41 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: 7.7 MB). Peak memory consumption was 7.7 MB. 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. Result: SAFE, OverallTime: 4.7s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 204 SDtfs, 25 SDslu, 1327 SDs, 0 SdLazy, 412 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 187 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 332 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 36678 SizeOfPredicates, 14 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 90/150 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...