./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 678e0110 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-678e011 [2019-11-19 21:15:47,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:15:47,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:15:47,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:15:47,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:15:47,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:15:47,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:15:47,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:15:47,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:15:47,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:15:47,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:15:47,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:15:47,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:15:47,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:15:47,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:15:47,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:15:47,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:15:47,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:15:47,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:15:47,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:15:47,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:15:47,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:15:47,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:15:47,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:15:47,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:15:47,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:15:47,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:15:47,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:15:47,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:15:47,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:15:47,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:15:47,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:15:47,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:15:47,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:15:47,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:15:47,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:15:47,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:15:47,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:15:47,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:15:47,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:15:47,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:15:47,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:15:47,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:15:47,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:15:47,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:15:47,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:15:47,922 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:15:47,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:15:47,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:15:47,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:15:47,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:15:47,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:15:47,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:15:47,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:15:47,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:15:47,925 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:15:47,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:15:47,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:15:47,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:15:47,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:15:47,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:15:47,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:15:47,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:15:47,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:15:47,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:15:47,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:15:47,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:15:47,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:15:47,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:15:47,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:15:47,930 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-19 21:15:48,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:15:48,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:15:48,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:15:48,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:15:48,236 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:15:48,237 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-19 21:15:48,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eda5a2d1/06edfb8647d24ab9acde44441dec5c88/FLAG08db41b3c [2019-11-19 21:15:48,749 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:15:48,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2019-11-19 21:15:48,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eda5a2d1/06edfb8647d24ab9acde44441dec5c88/FLAG08db41b3c [2019-11-19 21:15:49,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eda5a2d1/06edfb8647d24ab9acde44441dec5c88 [2019-11-19 21:15:49,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:15:49,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:15:49,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:15:49,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:15:49,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:15:49,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6b4667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49, skipping insertion in model container [2019-11-19 21:15:49,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,132 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:15:49,152 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:15:49,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:15:49,356 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:15:49,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:15:49,466 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:15:49,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49 WrapperNode [2019-11-19 21:15:49,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:15:49,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:15:49,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:15:49,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:15:49,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:15:49,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:15:49,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:15:49,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:15:49,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (1/1) ... [2019-11-19 21:15:49,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:15:49,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:15:49,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:15:49,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:15:49,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (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-19 21:15:49,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:15:49,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:15:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:15:49,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:15:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:15:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:15:49,923 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:15:49,923 INFO L285 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-19 21:15:49,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:49 BoogieIcfgContainer [2019-11-19 21:15:49,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:15:49,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:15:49,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:15:49,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:15:49,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:15:49" (1/3) ... [2019-11-19 21:15:49,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c75c4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:49, skipping insertion in model container [2019-11-19 21:15:49,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:49" (2/3) ... [2019-11-19 21:15:49,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c75c4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:49, skipping insertion in model container [2019-11-19 21:15:49,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:49" (3/3) ... [2019-11-19 21:15:49,932 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2019-11-19 21:15:49,941 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:15:49,948 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:15:49,961 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:15:49,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:15:49,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:15:49,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:15:49,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:15:49,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:15:49,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:15:49,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:15:49,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:15:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-19 21:15:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:15:50,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:50,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:15:50,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2019-11-19 21:15:50,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:50,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007793163] [2019-11-19 21:15:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:50,142 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-19 21:15:50,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007793163] [2019-11-19 21:15:50,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:15:50,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508116608] [2019-11-19 21:15:50,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:15:50,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:15:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:15:50,165 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-19 21:15:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:50,184 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2019-11-19 21:15:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:15:50,185 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 21:15:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:50,195 INFO L225 Difference]: With dead ends: 48 [2019-11-19 21:15:50,195 INFO L226 Difference]: Without dead ends: 22 [2019-11-19 21:15:50,198 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-19 21:15:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-19 21:15:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-19 21:15:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-19 21:15:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-19 21:15:50,233 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-11-19 21:15:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:50,233 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-19 21:15:50,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:15:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-11-19 21:15:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:15:50,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:50,234 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-19 21:15:50,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2019-11-19 21:15:50,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:50,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102638568] [2019-11-19 21:15:50,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:50,284 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-19 21:15:50,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102638568] [2019-11-19 21:15:50,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:50,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:15:50,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947807531] [2019-11-19 21:15:50,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:15:50,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:15:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:15:50,288 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2019-11-19 21:15:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:50,373 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-11-19 21:15:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:15:50,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-19 21:15:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:50,376 INFO L225 Difference]: With dead ends: 50 [2019-11-19 21:15:50,376 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:15:50,377 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-19 21:15:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:15:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-11-19 21:15:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-19 21:15:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-11-19 21:15:50,384 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2019-11-19 21:15:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:50,385 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-19 21:15:50,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:15:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-11-19 21:15:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:15:50,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:50,386 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-19 21:15:50,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2019-11-19 21:15:50,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:50,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528025518] [2019-11-19 21:15:50,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:50,466 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-19 21:15:50,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528025518] [2019-11-19 21:15:50,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033973722] [2019-11-19 21:15:50,467 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-19 21:15:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:50,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:15:50,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:50,578 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-19 21:15:50,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:50,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 21:15:50,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426362551] [2019-11-19 21:15:50,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:15:50,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:15:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:15:50,582 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2019-11-19 21:15:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:50,657 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-11-19 21:15:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:15:50,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 21:15:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:50,659 INFO L225 Difference]: With dead ends: 61 [2019-11-19 21:15:50,660 INFO L226 Difference]: Without dead ends: 42 [2019-11-19 21:15:50,660 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-19 21:15:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-19 21:15:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-11-19 21:15:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:15:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-19 21:15:50,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-11-19 21:15:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:50,666 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-19 21:15:50,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:15:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-19 21:15:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 21:15:50,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:50,669 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-19 21:15:50,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:50,873 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:50,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 2 times [2019-11-19 21:15:50,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:50,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635322007] [2019-11-19 21:15:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:50,997 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-19 21:15:50,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635322007] [2019-11-19 21:15:50,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139028097] [2019-11-19 21:15:51,000 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-19 21:15:51,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:15:51,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:51,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:15:51,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:51,097 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-19 21:15:51,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:51,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 21:15:51,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398746062] [2019-11-19 21:15:51,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:15:51,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:51,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:15:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:15:51,100 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2019-11-19 21:15:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:51,191 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2019-11-19 21:15:51,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:15:51,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-19 21:15:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:51,193 INFO L225 Difference]: With dead ends: 73 [2019-11-19 21:15:51,193 INFO L226 Difference]: Without dead ends: 52 [2019-11-19 21:15:51,194 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-19 21:15:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-19 21:15:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2019-11-19 21:15:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:15:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-19 21:15:51,200 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2019-11-19 21:15:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:51,201 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-19 21:15:51,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:15:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-19 21:15:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:15:51,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:51,202 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-19 21:15:51,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:51,406 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash -381068522, now seen corresponding path program 3 times [2019-11-19 21:15:51,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160285915] [2019-11-19 21:15:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:51,537 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-19 21:15:51,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160285915] [2019-11-19 21:15:51,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842369930] [2019-11-19 21:15:51,538 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-19 21:15:51,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 21:15:51,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:51,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 21:15:51,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:51,618 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-19 21:15:51,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:51,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 21:15:51,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4714919] [2019-11-19 21:15:51,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:15:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:15:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:15:51,621 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2019-11-19 21:15:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:51,727 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-11-19 21:15:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:15:51,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:15:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:51,730 INFO L225 Difference]: With dead ends: 85 [2019-11-19 21:15:51,730 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 21:15:51,731 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-19 21:15:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 21:15:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2019-11-19 21:15:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 21:15:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-19 21:15:51,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2019-11-19 21:15:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:51,739 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-19 21:15:51,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:15:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-19 21:15:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 21:15:51,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:51,741 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-19 21:15:51,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:51,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 4 times [2019-11-19 21:15:51,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:51,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965235109] [2019-11-19 21:15:51,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:52,081 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-19 21:15:52,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965235109] [2019-11-19 21:15:52,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990839234] [2019-11-19 21:15:52,082 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-19 21:15:52,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:15:52,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:52,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:15:52,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:52,176 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-19 21:15:52,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:52,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 21:15:52,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298851883] [2019-11-19 21:15:52,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:15:52,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:52,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:15:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:15:52,181 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2019-11-19 21:15:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:52,319 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2019-11-19 21:15:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:15:52,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-19 21:15:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:52,323 INFO L225 Difference]: With dead ends: 95 [2019-11-19 21:15:52,323 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 21:15:52,324 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-19 21:15:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 21:15:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-11-19 21:15:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 21:15:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-19 21:15:52,335 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2019-11-19 21:15:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:52,336 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-19 21:15:52,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:15:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-19 21:15:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:15:52,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:52,340 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-19 21:15:52,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:52,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 5 times [2019-11-19 21:15:52,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:52,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601973610] [2019-11-19 21:15:52,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:15:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:15:52,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:15:52,648 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:15:52,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:15:52 BoogieIcfgContainer [2019-11-19 21:15:52,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:15:52,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:15:52,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:15:52,697 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:15:52,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:49" (3/4) ... [2019-11-19 21:15:52,701 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:15:52,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:15:52,705 INFO L168 Benchmark]: Toolchain (without parser) took 3589.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 950.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:52,706 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-19 21:15:52,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:52,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.44 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:52,709 INFO L168 Benchmark]: Boogie Preprocessor took 28.91 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-19 21:15:52,710 INFO L168 Benchmark]: RCFGBuilder took 378.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:52,711 INFO L168 Benchmark]: TraceAbstraction took 2770.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 950.3 MB in the end (delta: 157.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:52,711 INFO L168 Benchmark]: Witness Printer took 5.73 ms. Allocated memory is still 1.2 GB. Free memory is still 950.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:15:52,716 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 352.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.44 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.91 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 378.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2770.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 950.3 MB in the end (delta: 157.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.73 ms. Allocated memory is still 1.2 GB. Free memory is still 950.3 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-19 21:15:55,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:15:55,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:15:55,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:15:55,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:15:55,251 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:15:55,253 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-19 21:15:55,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c02460928/f210fef111ed45e0b0857e2d37692b74/FLAG8f9754d07 [2019-11-19 21:15:55,757 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:15:55,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2019-11-19 21:15:55,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c02460928/f210fef111ed45e0b0857e2d37692b74/FLAG8f9754d07 [2019-11-19 21:15:56,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c02460928/f210fef111ed45e0b0857e2d37692b74 [2019-11-19 21:15:56,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:15:56,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:15:56,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:15:56,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:15:56,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:15:56,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cee9cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56, skipping insertion in model container [2019-11-19 21:15:56,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,198 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:15:56,220 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:15:56,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:15:56,412 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:15:56,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:15:56,516 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:15:56,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56 WrapperNode [2019-11-19 21:15:56,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:15:56,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:15:56,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:15:56,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:15:56,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:15:56,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:15:56,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:15:56,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:15:56,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (1/1) ... [2019-11-19 21:15:56,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:15:56,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:15:56,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:15:56,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:15:56,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (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-19 21:15:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-19 21:15:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:15:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:15:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-19 21:15:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:15:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:15:57,042 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:15:57,043 INFO L285 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-19 21:15:57,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:57 BoogieIcfgContainer [2019-11-19 21:15:57,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:15:57,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:15:57,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:15:57,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:15:57,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:15:56" (1/3) ... [2019-11-19 21:15:57,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb9eac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:57, skipping insertion in model container [2019-11-19 21:15:57,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:56" (2/3) ... [2019-11-19 21:15:57,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb9eac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:57, skipping insertion in model container [2019-11-19 21:15:57,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:57" (3/3) ... [2019-11-19 21:15:57,055 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2019-11-19 21:15:57,064 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:15:57,070 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:15:57,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:15:57,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:15:57,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:15:57,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:15:57,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:15:57,101 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:15:57,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:15:57,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:15:57,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:15:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-19 21:15:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:15:57,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:57,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:15:57,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2019-11-19 21:15:57,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:15:57,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2010452997] [2019-11-19 21:15:57,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:57,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 21:15:57,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:57,252 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-19 21:15:57,252 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:15:57,257 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-19 21:15:57,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010452997] [2019-11-19 21:15:57,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:57,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 21:15:57,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499230920] [2019-11-19 21:15:57,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:15:57,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:15:57,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:15:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:15:57,284 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-19 21:15:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:57,304 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2019-11-19 21:15:57,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:15:57,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 21:15:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:57,316 INFO L225 Difference]: With dead ends: 48 [2019-11-19 21:15:57,317 INFO L226 Difference]: Without dead ends: 22 [2019-11-19 21:15:57,321 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-19 21:15:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-19 21:15:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-19 21:15:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-19 21:15:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-19 21:15:57,358 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-11-19 21:15:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:57,359 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-19 21:15:57,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:15:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-11-19 21:15:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:15:57,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:57,360 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-19 21:15:57,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:57,563 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2019-11-19 21:15:57,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:15:57,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [942542401] [2019-11-19 21:15:57,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:57,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:15:57,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:57,717 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-19 21:15:57,717 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:15:57,741 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-19 21:15:57,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942542401] [2019-11-19 21:15:57,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:57,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 21:15:57,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884796940] [2019-11-19 21:15:57,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:15:57,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:15:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:15:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:15:57,746 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 4 states. [2019-11-19 21:15:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:57,864 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-11-19 21:15:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:15:57,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-19 21:15:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:57,869 INFO L225 Difference]: With dead ends: 58 [2019-11-19 21:15:57,869 INFO L226 Difference]: Without dead ends: 40 [2019-11-19 21:15:57,870 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-19 21:15:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-19 21:15:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-19 21:15:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:15:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-19 21:15:57,878 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-19 21:15:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:57,878 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-19 21:15:57,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:15:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-19 21:15:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 21:15:57,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:57,880 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-19 21:15:58,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:58,088 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 1 times [2019-11-19 21:15:58,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:15:58,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [5561316] [2019-11-19 21:15:58,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:58,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:15:58,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:58,257 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-19 21:15:58,257 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:15:58,336 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-19 21:15:58,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [5561316] [2019-11-19 21:15:58,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:58,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-19 21:15:58,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650155688] [2019-11-19 21:15:58,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:15:58,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:15:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:15:58,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:15:58,340 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 8 states. [2019-11-19 21:15:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:58,715 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-11-19 21:15:58,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:15:58,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-19 21:15:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:58,718 INFO L225 Difference]: With dead ends: 91 [2019-11-19 21:15:58,718 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 21:15:58,719 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-19 21:15:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 21:15:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-11-19 21:15:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 21:15:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-19 21:15:58,729 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 26 [2019-11-19 21:15:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:58,729 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-19 21:15:58,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:15:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-19 21:15:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:15:58,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:58,731 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-19 21:15:58,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:58,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 2 times [2019-11-19 21:15:58,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:15:58,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1390104916] [2019-11-19 21:15:58,936 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:59,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-19 21:15:59,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:59,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:15:59,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:59,095 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-19 21:15:59,096 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:15:59,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:59,210 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-19 21:15:59,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1390104916] [2019-11-19 21:15:59,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:59,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-19 21:15:59,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369221920] [2019-11-19 21:15:59,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:15:59,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:15:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:15:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:15:59,213 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2019-11-19 21:15:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:59,667 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2019-11-19 21:15:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:15:59,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-11-19 21:15:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:59,670 INFO L225 Difference]: With dead ends: 70 [2019-11-19 21:15:59,670 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 21:15:59,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:15:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 21:15:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2019-11-19 21:15:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 21:15:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-19 21:15:59,680 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2019-11-19 21:15:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:59,680 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-19 21:15:59,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:15:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-11-19 21:15:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 21:15:59,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:59,682 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-19 21:15:59,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:15:59,886 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2019-11-19 21:15:59,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:15:59,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1489984825] [2019-11-19 21:15:59,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:16:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:00,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:16:00,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:16:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-19 21:16:00,060 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:16:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-19 21:16:00,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1489984825] [2019-11-19 21:16:00,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:00,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:16:00,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414277838] [2019-11-19 21:16:00,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:16:00,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:16:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:16:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:00,091 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2019-11-19 21:16:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:00,185 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-11-19 21:16:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:00,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-19 21:16:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:00,188 INFO L225 Difference]: With dead ends: 56 [2019-11-19 21:16:00,188 INFO L226 Difference]: Without dead ends: 43 [2019-11-19 21:16:00,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 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-19 21:16:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-19 21:16:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-19 21:16:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 21:16:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-19 21:16:00,202 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 42 [2019-11-19 21:16:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:00,202 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-19 21:16:00,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:16:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-19 21:16:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 21:16:00,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:00,207 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-19 21:16:00,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:16:00,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1856180322, now seen corresponding path program 1 times [2019-11-19 21:16:00,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:16:00,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [632468169] [2019-11-19 21:16:00,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:16:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:00,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:16:00,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:16:00,613 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-19 21:16:00,614 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:16:00,653 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-19 21:16:00,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632468169] [2019-11-19 21:16:00,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:16:00,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-19 21:16:00,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107730171] [2019-11-19 21:16:00,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:16:00,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:16:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:16:00,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:16:00,656 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2019-11-19 21:16:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:00,845 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-11-19 21:16:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:16:00,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-11-19 21:16:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:00,847 INFO L225 Difference]: With dead ends: 98 [2019-11-19 21:16:00,847 INFO L226 Difference]: Without dead ends: 88 [2019-11-19 21:16:00,848 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-19 21:16:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-19 21:16:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2019-11-19 21:16:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 21:16:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-19 21:16:00,856 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2019-11-19 21:16:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-19 21:16:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:16:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-19 21:16:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 21:16:00,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:00,859 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-19 21:16:01,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:16:01,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2019-11-19 21:16:01,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:16:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2080908378] [2019-11-19 21:16:01,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:16:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:16:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:16:01,959 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 21:16:01,960 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:16:02,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:16:02,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:16:02 BoogieIcfgContainer [2019-11-19 21:16:02,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:16:02,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:16:02,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:16:02,215 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:16:02,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:57" (3/4) ... [2019-11-19 21:16:02,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:16:02,305 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:16:02,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:16:02,308 INFO L168 Benchmark]: Toolchain (without parser) took 6126.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.7 MB in the beginning and 874.3 MB in the end (delta: 83.4 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:02,308 INFO L168 Benchmark]: CDTParser took 0.31 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-19 21:16:02,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:02,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.49 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-19 21:16:02,310 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:02,311 INFO L168 Benchmark]: RCFGBuilder took 447.04 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:02,311 INFO L168 Benchmark]: TraceAbstraction took 5169.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 880.8 MB in the end (delta: 229.6 MB). Peak memory consumption was 229.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:02,312 INFO L168 Benchmark]: Witness Printer took 90.60 ms. Allocated memory is still 1.2 GB. Free memory was 880.8 MB in the beginning and 874.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:02,315 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.31 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 334.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.49 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.25 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.04 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5169.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 880.8 MB in the end (delta: 229.6 MB). Peak memory consumption was 229.6 MB. Max. memory is 11.5 GB. * Witness Printer took 90.60 ms. Allocated memory is still 1.2 GB. Free memory was 880.8 MB in the beginning and 874.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 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)<