./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/string-2.i --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/loops/string-2.i -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 77cd31699320cd40da64f32a92959020d19291bd ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/loops/string-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 77cd31699320cd40da64f32a92959020d19291bd .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:59:40,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:59:40,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:59:40,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:59:40,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:59:40,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:59:40,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:59:40,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:59:40,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:59:40,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:59:40,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:59:40,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:59:40,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:59:40,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:59:40,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:59:40,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:59:40,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:59:40,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:59:40,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:59:40,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:59:40,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:59:40,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:59:40,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:59:40,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:59:40,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:59:40,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:59:40,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:59:40,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:59:40,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:59:40,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:59:40,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:59:40,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:59:40,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:59:40,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:59:40,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:59:40,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:59:40,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:59:40,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:59:40,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:59:40,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:59:40,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:59:40,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:59:40,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:59:40,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:59:40,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:59:40,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:59:40,155 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:59:40,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:59:40,156 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:59:40,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:59:40,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:59:40,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:59:40,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:59:40,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:59:40,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:59:40,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:59:40,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:59:40,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:59:40,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:59:40,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:59:40,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:59:40,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:59:40,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:59:40,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:59:40,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:59:40,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:59:40,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:59:40,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:59:40,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:59:40,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:59:40,163 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 -> 77cd31699320cd40da64f32a92959020d19291bd [2019-11-27 23:59:40,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:59:40,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:59:40,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:59:40,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:59:40,482 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:59:40,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2019-11-27 23:59:40,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0748e2f0d/8c75a78b2bd5421bbd89456b3494fe4c/FLAG2655f7ea8 [2019-11-27 23:59:40,997 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:59:40,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2019-11-27 23:59:41,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0748e2f0d/8c75a78b2bd5421bbd89456b3494fe4c/FLAG2655f7ea8 [2019-11-27 23:59:41,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0748e2f0d/8c75a78b2bd5421bbd89456b3494fe4c [2019-11-27 23:59:41,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:59:41,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:59:41,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:59:41,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:59:41,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:59:41,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170d6946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41, skipping insertion in model container [2019-11-27 23:59:41,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:59:41,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:59:41,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:59:41,586 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:59:41,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:59:41,634 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:59:41,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41 WrapperNode [2019-11-27 23:59:41,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:59:41,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:59:41,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:59:41,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:59:41,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:59:41,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:59:41,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:59:41,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:59:41,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... [2019-11-27 23:59:41,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:59:41,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:59:41,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:59:41,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:59:41,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:59:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:59:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:59:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:59:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:59:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:59:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:59:42,152 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:59:42,153 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 23:59:42,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:42 BoogieIcfgContainer [2019-11-27 23:59:42,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:59:42,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:59:42,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:59:42,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:59:42,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:59:41" (1/3) ... [2019-11-27 23:59:42,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecb6df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:59:42, skipping insertion in model container [2019-11-27 23:59:42,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:41" (2/3) ... [2019-11-27 23:59:42,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecb6df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:59:42, skipping insertion in model container [2019-11-27 23:59:42,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:42" (3/3) ... [2019-11-27 23:59:42,172 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2019-11-27 23:59:42,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:59:42,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:59:42,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:59:42,220 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:59:42,221 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:59:42,221 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:59:42,221 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:59:42,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:59:42,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:59:42,222 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:59:42,222 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:59:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-27 23:59:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:59:42,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:42,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:42,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2019-11-27 23:59:42,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:42,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842930550] [2019-11-27 23:59:42,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:42,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842930550] [2019-11-27 23:59:42,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:42,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:59:42,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392994947] [2019-11-27 23:59:42,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:59:42,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:42,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:59:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:59:42,393 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-27 23:59:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:42,410 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2019-11-27 23:59:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:59:42,411 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 23:59:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:42,419 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:59:42,419 INFO L226 Difference]: Without dead ends: 22 [2019-11-27 23:59:42,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:59:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-27 23:59:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-27 23:59:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:59:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-27 23:59:42,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-11-27 23:59:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:42,457 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-27 23:59:42,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:59:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-11-27 23:59:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:59:42,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:42,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:42,460 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2019-11-27 23:59:42,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:42,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156075842] [2019-11-27 23:59:42,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:42,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156075842] [2019-11-27 23:59:42,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:42,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:59:42,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62589688] [2019-11-27 23:59:42,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:59:42,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:59:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:59:42,513 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2019-11-27 23:59:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:42,575 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-11-27 23:59:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:59:42,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 23:59:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:42,578 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:59:42,578 INFO L226 Difference]: Without dead ends: 32 [2019-11-27 23:59:42,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:59:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-27 23:59:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-11-27 23:59:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 23:59:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-11-27 23:59:42,587 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2019-11-27 23:59:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:42,587 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-27 23:59:42,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:59:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-11-27 23:59:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:59:42,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:42,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:42,589 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2019-11-27 23:59:42,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:42,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112237405] [2019-11-27 23:59:42,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:59:42,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112237405] [2019-11-27 23:59:42,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188612767] [2019-11-27 23:59:42,671 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-27 23:59:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:42,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:59:42,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:59:42,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:42,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-27 23:59:42,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432273096] [2019-11-27 23:59:42,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:59:42,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:59:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:59:42,790 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2019-11-27 23:59:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:42,868 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-11-27 23:59:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:59:42,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-27 23:59:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:42,871 INFO L225 Difference]: With dead ends: 61 [2019-11-27 23:59:42,871 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:59:42,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:59:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:59:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-11-27 23:59:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:59:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-27 23:59:42,877 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-11-27 23:59:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:42,878 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-27 23:59:42,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:59:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-27 23:59:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:59:42,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:42,879 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:43,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:43,083 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 2 times [2019-11-27 23:59:43,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:43,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481867931] [2019-11-27 23:59:43,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 23:59:43,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481867931] [2019-11-27 23:59:43,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506029161] [2019-11-27 23:59:43,180 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 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-27 23:59:43,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:59:43,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:43,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:59:43,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 23:59:43,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:43,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-27 23:59:43,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695203851] [2019-11-27 23:59:43,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:59:43,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:59:43,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:59:43,279 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2019-11-27 23:59:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:43,371 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2019-11-27 23:59:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:59:43,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-27 23:59:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:43,374 INFO L225 Difference]: With dead ends: 73 [2019-11-27 23:59:43,374 INFO L226 Difference]: Without dead ends: 52 [2019-11-27 23:59:43,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:59:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-27 23:59:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2019-11-27 23:59:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:59:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-27 23:59:43,382 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2019-11-27 23:59:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:43,382 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-27 23:59:43,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:59:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-27 23:59:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 23:59:43,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:43,384 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:43,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:43,593 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash -381068522, now seen corresponding path program 3 times [2019-11-27 23:59:43,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:43,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655135561] [2019-11-27 23:59:43,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 23:59:43,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655135561] [2019-11-27 23:59:43,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400835056] [2019-11-27 23:59:43,697 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-27 23:59:43,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-27 23:59:43,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:43,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:59:43,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 23:59:43,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:43,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-27 23:59:43,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058365271] [2019-11-27 23:59:43,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:59:43,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:43,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:59:43,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:59:43,780 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2019-11-27 23:59:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:43,884 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-11-27 23:59:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:59:43,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-27 23:59:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:43,886 INFO L225 Difference]: With dead ends: 85 [2019-11-27 23:59:43,886 INFO L226 Difference]: Without dead ends: 62 [2019-11-27 23:59:43,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:59:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-27 23:59:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2019-11-27 23:59:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-27 23:59:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-27 23:59:43,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2019-11-27 23:59:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:43,899 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-27 23:59:43,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:59:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-27 23:59:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 23:59:43,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:43,901 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:44,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:44,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:44,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 4 times [2019-11-27 23:59:44,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:44,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940419391] [2019-11-27 23:59:44,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 23:59:44,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940419391] [2019-11-27 23:59:44,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674709417] [2019-11-27 23:59:44,204 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-27 23:59:44,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 23:59:44,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:44,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:59:44,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 23:59:44,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:44,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-27 23:59:44,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615986720] [2019-11-27 23:59:44,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:59:44,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:59:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:59:44,275 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2019-11-27 23:59:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:44,394 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2019-11-27 23:59:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:59:44,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-27 23:59:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:44,396 INFO L225 Difference]: With dead ends: 95 [2019-11-27 23:59:44,396 INFO L226 Difference]: Without dead ends: 70 [2019-11-27 23:59:44,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:59:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-27 23:59:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-11-27 23:59:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-27 23:59:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-27 23:59:44,403 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2019-11-27 23:59:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:44,404 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-27 23:59:44,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:59:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-27 23:59:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 23:59:44,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:44,406 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:44,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:44,610 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 5 times [2019-11-27 23:59:44,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:44,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6717015] [2019-11-27 23:59:44,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:59:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:59:44,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:59:44,714 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:59:44,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:59:44 BoogieIcfgContainer [2019-11-27 23:59:44,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:59:44,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:59:44,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:59:44,759 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:59:44,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:42" (3/4) ... [2019-11-27 23:59:44,762 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:59:44,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:59:44,765 INFO L168 Benchmark]: Toolchain (without parser) took 3413.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 951.0 MB in the beginning and 922.0 MB in the end (delta: 29.0 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:44,766 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:44,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:44,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:44,768 INFO L168 Benchmark]: Boogie Preprocessor took 26.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:44,769 INFO L168 Benchmark]: RCFGBuilder took 391.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:44,770 INFO L168 Benchmark]: TraceAbstraction took 2602.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 922.0 MB in the end (delta: 166.2 MB). Peak memory consumption was 166.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:44,770 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.1 GB. Free memory is still 922.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:44,775 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 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 98.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 391.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2602.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 922.0 MB in the end (delta: 166.2 MB). Peak memory consumption was 166.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.1 GB. Free memory is still 922.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 55. Possible FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i<5) [L23] EXPR string_A[5 -1] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND FALSE !(i<5) [L27] EXPR string_B[5 -1] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 [L30] EXPR string_A[nc_A] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 [L34] EXPR string_B[nc_B] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 [L41] COND FALSE !((inc_B-1)< 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 -> 77cd31699320cd40da64f32a92959020d19291bd [2019-11-27 23:59:47,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:59:47,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:59:47,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:59:47,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:59:47,054 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:59:47,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2019-11-27 23:59:47,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29edfa767/92793dcd215b407ba2c5b1d0a22bc660/FLAG3ce22d2cc [2019-11-27 23:59:47,540 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:59:47,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2019-11-27 23:59:47,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29edfa767/92793dcd215b407ba2c5b1d0a22bc660/FLAG3ce22d2cc [2019-11-27 23:59:47,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29edfa767/92793dcd215b407ba2c5b1d0a22bc660 [2019-11-27 23:59:47,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:59:47,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:59:47,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:59:47,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:59:47,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:59:47,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:59:47" (1/1) ... [2019-11-27 23:59:47,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9b4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:47, skipping insertion in model container [2019-11-27 23:59:47,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:59:47" (1/1) ... [2019-11-27 23:59:47,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:59:47,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:59:48,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:59:48,198 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:59:48,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:59:48,315 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:59:48,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48 WrapperNode [2019-11-27 23:59:48,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:59:48,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:59:48,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:59:48,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:59:48,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:59:48,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:59:48,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:59:48,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:59:48,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... [2019-11-27 23:59:48,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:59:48,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:59:48,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:59:48,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:59:48,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:59:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-27 23:59:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:59:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:59:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-27 23:59:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:59:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:59:48,784 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:59:48,784 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 23:59:48,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:48 BoogieIcfgContainer [2019-11-27 23:59:48,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:59:48,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:59:48,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:59:48,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:59:48,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:59:47" (1/3) ... [2019-11-27 23:59:48,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d74c704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:59:48, skipping insertion in model container [2019-11-27 23:59:48,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:48" (2/3) ... [2019-11-27 23:59:48,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d74c704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:59:48, skipping insertion in model container [2019-11-27 23:59:48,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:48" (3/3) ... [2019-11-27 23:59:48,795 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2019-11-27 23:59:48,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:59:48,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:59:48,825 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:59:48,853 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:59:48,853 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:59:48,853 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:59:48,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:59:48,854 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:59:48,854 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:59:48,854 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:59:48,854 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:59:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-27 23:59:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:59:48,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:48,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:48,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2019-11-27 23:59:48,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:48,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555468010] [2019-11-27 23:59:48,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:49,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:59:49,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:49,052 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:59:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:49,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555468010] [2019-11-27 23:59:49,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:49,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:59:49,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427101235] [2019-11-27 23:59:49,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:59:49,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:59:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:59:49,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:59:49,081 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-27 23:59:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:49,101 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2019-11-27 23:59:49,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:59:49,102 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 23:59:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:49,112 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:59:49,112 INFO L226 Difference]: Without dead ends: 22 [2019-11-27 23:59:49,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:59:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-27 23:59:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-27 23:59:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:59:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-27 23:59:49,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-11-27 23:59:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:49,159 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-27 23:59:49,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:59:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-11-27 23:59:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:59:49,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:49,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:49,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:59:49,362 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2019-11-27 23:59:49,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:49,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254768854] [2019-11-27 23:59:49,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:49,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:59:49,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:49,452 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:59:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:49,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254768854] [2019-11-27 23:59:49,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:49,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 23:59:49,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942023904] [2019-11-27 23:59:49,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:59:49,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:59:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:59:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:59:49,469 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 4 states. [2019-11-27 23:59:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:49,585 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-11-27 23:59:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:59:49,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 23:59:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:49,589 INFO L225 Difference]: With dead ends: 58 [2019-11-27 23:59:49,591 INFO L226 Difference]: Without dead ends: 40 [2019-11-27 23:59:49,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:59:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-27 23:59:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-27 23:59:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:59:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-27 23:59:49,605 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-27 23:59:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:49,606 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-27 23:59:49,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:59:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-27 23:59:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:59:49,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:49,608 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:49,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:59:49,827 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 1 times [2019-11-27 23:59:49,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:49,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124154230] [2019-11-27 23:59:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:49,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:59:49,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 23:59:49,932 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:59:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 23:59:50,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124154230] [2019-11-27 23:59:50,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:50,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-27 23:59:50,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196906557] [2019-11-27 23:59:50,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:59:50,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:59:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:59:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:59:50,003 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 8 states. [2019-11-27 23:59:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:50,379 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-11-27 23:59:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:59:50,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-27 23:59:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:50,383 INFO L225 Difference]: With dead ends: 91 [2019-11-27 23:59:50,383 INFO L226 Difference]: Without dead ends: 70 [2019-11-27 23:59:50,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:59:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-27 23:59:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-11-27 23:59:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-27 23:59:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-27 23:59:50,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 26 [2019-11-27 23:59:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:50,396 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-27 23:59:50,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:59:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-27 23:59:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 23:59:50,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:50,398 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:50,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:59:50,609 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 2 times [2019-11-27 23:59:50,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:50,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311860939] [2019-11-27 23:59:50,613 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:50,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 23:59:50,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:50,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:59:50,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-27 23:59:50,698 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:59:50,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:59:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-27 23:59:50,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311860939] [2019-11-27 23:59:50,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:50,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:59:50,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922373730] [2019-11-27 23:59:50,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:59:50,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:59:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:59:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:59:50,802 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 6 states. [2019-11-27 23:59:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:50,938 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-11-27 23:59:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:59:50,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-27 23:59:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:50,940 INFO L225 Difference]: With dead ends: 46 [2019-11-27 23:59:50,940 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:59:50,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:59:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:59:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-11-27 23:59:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-27 23:59:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-27 23:59:50,948 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 38 [2019-11-27 23:59:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-27 23:59:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:59:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-27 23:59:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 23:59:50,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:50,950 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:51,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:59:51,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1799835385, now seen corresponding path program 1 times [2019-11-27 23:59:51,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:51,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312049165] [2019-11-27 23:59:51,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:51,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:59:51,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-27 23:59:51,284 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:59:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-27 23:59:51,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312049165] [2019-11-27 23:59:51,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:51,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:59:51,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534282895] [2019-11-27 23:59:51,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:59:51,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:59:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:59:51,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:59:51,311 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 6 states. [2019-11-27 23:59:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:51,388 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-27 23:59:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:59:51,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-27 23:59:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:51,390 INFO L225 Difference]: With dead ends: 54 [2019-11-27 23:59:51,390 INFO L226 Difference]: Without dead ends: 43 [2019-11-27 23:59:51,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:59:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-27 23:59:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-27 23:59:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:59:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-27 23:59:51,398 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2019-11-27 23:59:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:51,399 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-27 23:59:51,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:59:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-27 23:59:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 23:59:51,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:51,400 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:51,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:59:51,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1856180322, now seen corresponding path program 1 times [2019-11-27 23:59:51,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:51,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69247945] [2019-11-27 23:59:51,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:51,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:59:51,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-27 23:59:51,730 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:59:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-27 23:59:51,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69247945] [2019-11-27 23:59:51,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:51,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-27 23:59:51,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434543032] [2019-11-27 23:59:51,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:59:51,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:59:51,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:59:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:59:51,787 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2019-11-27 23:59:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:51,975 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-11-27 23:59:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:59:51,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-11-27 23:59:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:51,978 INFO L225 Difference]: With dead ends: 98 [2019-11-27 23:59:51,979 INFO L226 Difference]: Without dead ends: 88 [2019-11-27 23:59:51,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:59:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-27 23:59:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2019-11-27 23:59:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-27 23:59:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-27 23:59:51,997 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2019-11-27 23:59:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:51,998 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-27 23:59:51,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:59:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-27 23:59:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 23:59:52,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:52,002 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:52,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 23:59:52,223 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2019-11-27 23:59:52,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:59:52,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501996241] [2019-11-27 23:59:52,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 23:59:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:59:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:59:52,511 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-27 23:59:52,511 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:59:52,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 23:59:52,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:59:52 BoogieIcfgContainer [2019-11-27 23:59:52,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:59:52,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:59:52,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:59:52,759 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:59:52,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:48" (3/4) ... [2019-11-27 23:59:52,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:59:52,831 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:59:52,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:59:52,834 INFO L168 Benchmark]: Toolchain (without parser) took 4898.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 959.0 MB in the beginning and 884.1 MB in the end (delta: 74.9 MB). Peak memory consumption was 221.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:52,834 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:52,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:52,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:52,836 INFO L168 Benchmark]: Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:52,837 INFO L168 Benchmark]: RCFGBuilder took 400.27 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:52,838 INFO L168 Benchmark]: TraceAbstraction took 3971.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.7 MB in the end (delta: 214.4 MB). Peak memory consumption was 214.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:52,838 INFO L168 Benchmark]: Witness Printer took 72.65 ms. Allocated memory is still 1.2 GB. Free memory was 890.7 MB in the beginning and 884.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:52,842 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.24 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 378.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.42 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 400.27 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3971.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.7 MB in the end (delta: 214.4 MB). Peak memory consumption was 214.4 MB. Max. memory is 11.5 GB. * Witness Printer took 72.65 ms. Allocated memory is still 1.2 GB. Free memory was 890.7 MB in the beginning and 884.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i<5) [L23] EXPR string_A[5 -1] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND FALSE !(i<5) [L27] EXPR string_B[5 -1] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 [L30] EXPR string_A[nc_A] [L30] COND TRUE string_A[nc_A]!='\0' [L31] nc_A++ [L30] EXPR string_A[nc_A] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 [L34] EXPR string_B[nc_B] [L34] COND TRUE string_B[nc_B]!='\0' [L35] nc_B++ [L34] EXPR string_B[nc_B] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 [L41] COND TRUE (inc_B-1)<