./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 826ba3ecb74a591f4e23afc2c932e6d22d2291c8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 826ba3ecb74a591f4e23afc2c932e6d22d2291c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.1-dev-20ed64e [2021-08-26 03:10:15,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:10:15,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:10:15,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:10:15,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:10:15,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:10:15,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:10:15,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:10:15,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:10:15,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:10:15,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:10:15,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:10:15,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:10:15,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:10:15,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:10:15,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:10:15,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:10:15,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:10:15,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:10:15,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:10:15,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:10:15,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:10:15,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:10:15,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:10:15,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:10:15,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:10:15,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:10:15,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:10:15,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:10:15,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:10:15,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:10:15,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:10:15,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:10:15,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:10:15,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:10:15,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:10:15,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:10:15,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:10:15,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:10:15,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:10:15,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:10:15,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:10:15,341 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:10:15,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:10:15,343 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:10:15,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:10:15,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:10:15,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:10:15,345 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:10:15,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:10:15,346 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:10:15,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:10:15,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:10:15,347 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:10:15,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:10:15,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:10:15,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:10:15,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:10:15,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:15,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:10:15,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:10:15,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:10:15,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:10:15,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:10:15,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:10:15,354 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:10:15,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 826ba3ecb74a591f4e23afc2c932e6d22d2291c8 [2021-08-26 03:10:15,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:10:15,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:10:15,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:10:15,645 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:10:15,645 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:10:15,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2021-08-26 03:10:15,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0341a5e/d92002b5ddde4be389dd9a67bbaa71ef/FLAGc17c7febb [2021-08-26 03:10:15,991 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:10:15,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2021-08-26 03:10:15,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0341a5e/d92002b5ddde4be389dd9a67bbaa71ef/FLAGc17c7febb [2021-08-26 03:10:16,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0341a5e/d92002b5ddde4be389dd9a67bbaa71ef [2021-08-26 03:10:16,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:10:16,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:10:16,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:16,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:10:16,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:10:16,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f0f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16, skipping insertion in model container [2021-08-26 03:10:16,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:10:16,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:10:16,561 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-08-26 03:10:16,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:16,577 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:10:16,585 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-08-26 03:10:16,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:16,615 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:10:16,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16 WrapperNode [2021-08-26 03:10:16,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:16,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:16,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:10:16,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:10:16,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:16,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:10:16,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:10:16,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:10:16,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:10:16,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:10:16,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:10:16,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:10:16,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (1/1) ... [2021-08-26 03:10:16,701 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:16,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:16,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:10:16,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:10:16,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:10:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 03:10:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 03:10:16,982 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:10:16,982 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-26 03:10:16,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:16 BoogieIcfgContainer [2021-08-26 03:10:16,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:10:16,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:10:16,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:10:16,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:10:16,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:16" (1/3) ... [2021-08-26 03:10:16,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd4721e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:16, skipping insertion in model container [2021-08-26 03:10:16,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:16" (2/3) ... [2021-08-26 03:10:16,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd4721e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:16, skipping insertion in model container [2021-08-26 03:10:16,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:16" (3/3) ... [2021-08-26 03:10:16,988 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2021-08-26 03:10:16,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:10:16,992 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 03:10:17,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:10:17,023 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:10:17,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 03:10:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:10:17,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:17,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:17,043 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2021-08-26 03:10:17,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:17,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761564277] [2021-08-26 03:10:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:17,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:17,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:17,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761564277] [2021-08-26 03:10:17,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761564277] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:17,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:17,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:10:17,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755491418] [2021-08-26 03:10:17,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:10:17,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:10:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:17,219 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:17,276 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2021-08-26 03:10:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:10:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 03:10:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:17,284 INFO L225 Difference]: With dead ends: 62 [2021-08-26 03:10:17,284 INFO L226 Difference]: Without dead ends: 32 [2021-08-26 03:10:17,286 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:10:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-08-26 03:10:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2021-08-26 03:10:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-08-26 03:10:17,310 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2021-08-26 03:10:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:17,310 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-08-26 03:10:17,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-08-26 03:10:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 03:10:17,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:17,312 INFO L512 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] [2021-08-26 03:10:17,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:10:17,312 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2021-08-26 03:10:17,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:17,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817731072] [2021-08-26 03:10:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:17,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 03:10:17,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:17,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817731072] [2021-08-26 03:10:17,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817731072] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:17,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359523227] [2021-08-26 03:10:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:17,372 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:17,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:10:17,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 03:10:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 03:10:17,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 03:10:17,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359523227] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:17,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:17,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 03:10:17,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28611093] [2021-08-26 03:10:17,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:10:17,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:10:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:17,555 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:17,606 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-08-26 03:10:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 03:10:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:17,608 INFO L225 Difference]: With dead ends: 61 [2021-08-26 03:10:17,608 INFO L226 Difference]: Without dead ends: 42 [2021-08-26 03:10:17,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:10:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-26 03:10:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2021-08-26 03:10:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-08-26 03:10:17,617 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2021-08-26 03:10:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:17,617 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-26 03:10:17,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-08-26 03:10:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 03:10:17,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:17,619 INFO L512 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] [2021-08-26 03:10:17,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:17,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:17,829 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 2 times [2021-08-26 03:10:17,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:17,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119067434] [2021-08-26 03:10:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:17,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 03:10:17,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:17,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119067434] [2021-08-26 03:10:17,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119067434] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:17,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966132097] [2021-08-26 03:10:17,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 03:10:17,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:17,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:10:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 03:10:17,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 03:10:17,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:10:17,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:10:17,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 03:10:18,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966132097] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:18,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:18,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-26 03:10:18,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374130257] [2021-08-26 03:10:18,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:10:18,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:10:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:18,042 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:18,092 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2021-08-26 03:10:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:10:18,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 03:10:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:18,094 INFO L225 Difference]: With dead ends: 73 [2021-08-26 03:10:18,094 INFO L226 Difference]: Without dead ends: 52 [2021-08-26 03:10:18,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-26 03:10:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2021-08-26 03:10:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-08-26 03:10:18,107 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2021-08-26 03:10:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:18,107 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-08-26 03:10:18,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-08-26 03:10:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-26 03:10:18,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:18,108 INFO L512 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] [2021-08-26 03:10:18,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:18,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-08-26 03:10:18,317 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -381068522, now seen corresponding path program 3 times [2021-08-26 03:10:18,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:18,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194013762] [2021-08-26 03:10:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:18,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 03:10:18,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:18,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194013762] [2021-08-26 03:10:18,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194013762] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:18,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757873400] [2021-08-26 03:10:18,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 03:10:18,377 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:18,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:10:18,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 03:10:18,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-26 03:10:18,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:10:18,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 03:10:18,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 03:10:18,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757873400] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:18,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:18,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-26 03:10:18,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430008821] [2021-08-26 03:10:18,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 03:10:18,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:18,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 03:10:18,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:10:18,523 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:18,573 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2021-08-26 03:10:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:10:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-26 03:10:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:18,575 INFO L225 Difference]: With dead ends: 85 [2021-08-26 03:10:18,576 INFO L226 Difference]: Without dead ends: 62 [2021-08-26 03:10:18,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:10:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-08-26 03:10:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2021-08-26 03:10:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-26 03:10:18,583 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2021-08-26 03:10:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:18,583 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-26 03:10:18,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-08-26 03:10:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 03:10:18,585 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:18,585 INFO L512 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] [2021-08-26 03:10:18,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:18,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:18,802 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 4 times [2021-08-26 03:10:18,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:18,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517168292] [2021-08-26 03:10:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:18,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-26 03:10:18,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:10:18,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517168292] [2021-08-26 03:10:18,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517168292] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:18,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453420931] [2021-08-26 03:10:18,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 03:10:18,869 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:18,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:10:18,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 03:10:18,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 03:10:18,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:10:18,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 03:10:18,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-26 03:10:19,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453420931] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:10:19,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:19,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-26 03:10:19,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000165788] [2021-08-26 03:10:19,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 03:10:19,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:10:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 03:10:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:10:19,027 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:19,089 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2021-08-26 03:10:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:10:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 03:10:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:19,090 INFO L225 Difference]: With dead ends: 95 [2021-08-26 03:10:19,090 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 03:10:19,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 27.5ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:10:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 03:10:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2021-08-26 03:10:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-08-26 03:10:19,093 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2021-08-26 03:10:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:19,093 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-08-26 03:10:19,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-08-26 03:10:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 03:10:19,094 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:19,094 INFO L512 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] [2021-08-26 03:10:19,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:19,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:10:19,309 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 5 times [2021-08-26 03:10:19,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:10:19,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863134928] [2021-08-26 03:10:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:19,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:10:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:10:19,330 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 03:10:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:10:19,384 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 03:10:19,384 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 03:10:19,384 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:10:19,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:10:19,389 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:10:19,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:10:19 BoogieIcfgContainer [2021-08-26 03:10:19,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:10:19,409 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:10:19,409 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:10:19,409 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:10:19,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:16" (3/4) ... [2021-08-26 03:10:19,411 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 03:10:19,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:10:19,412 INFO L168 Benchmark]: Toolchain (without parser) took 2951.83 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 35.6 MB in the beginning and 60.6 MB in the end (delta: -25.0 MB). Peak memory consumption was 723.1 kB. Max. memory is 16.1 GB. [2021-08-26 03:10:19,413 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.5 MB in the beginning and 38.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:19,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.26 ms. Allocated memory is still 56.6 MB. Free memory was 35.5 MB in the beginning and 40.5 MB in the end (delta: -5.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:19,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 38.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:19,413 INFO L168 Benchmark]: Boogie Preprocessor took 32.74 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 37.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:19,414 INFO L168 Benchmark]: RCFGBuilder took 291.10 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 37.3 MB in the beginning and 46.1 MB in the end (delta: -8.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:19,414 INFO L168 Benchmark]: TraceAbstraction took 2424.08 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 45.8 MB in the beginning and 60.6 MB in the end (delta: -14.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:19,414 INFO L168 Benchmark]: Witness Printer took 2.34 ms. Allocated memory is still 83.9 MB. Free memory is still 60.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:19,417 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.5 MB in the beginning and 38.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 154.26 ms. Allocated memory is still 56.6 MB. Free memory was 35.5 MB in the beginning and 40.5 MB in the end (delta: -5.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 38.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.74 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 37.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 291.10 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 37.3 MB in the beginning and 46.1 MB in the end (delta: -8.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2424.08 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 45.8 MB in the beginning and 60.6 MB in the end (delta: -14.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 16.1 GB. * Witness Printer took 2.34 ms. Allocated memory is still 83.9 MB. Free memory is still 60.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND FALSE !(i<5) [L37] EXPR string_A[5 -1] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND FALSE !(i<5) [L41] EXPR string_B[5 -1] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 [L44] EXPR string_A[nc_A] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 [L48] EXPR string_B[nc_B] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 [L55] 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(reach_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 -> 826ba3ecb74a591f4e23afc2c932e6d22d2291c8 [2021-08-26 03:10:21,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:10:21,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:10:21,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:10:21,275 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:10:21,275 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:10:21,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2021-08-26 03:10:21,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f2dfcd2/d42a7ba9d0c444c2b9aa6507aa949b87/FLAG03d7d4549 [2021-08-26 03:10:21,702 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:10:21,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2021-08-26 03:10:21,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f2dfcd2/d42a7ba9d0c444c2b9aa6507aa949b87/FLAG03d7d4549 [2021-08-26 03:10:21,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f2dfcd2/d42a7ba9d0c444c2b9aa6507aa949b87 [2021-08-26 03:10:21,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:10:21,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:10:21,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:21,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:10:21,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:10:21,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:21,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c19da6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21, skipping insertion in model container [2021-08-26 03:10:21,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:21,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:10:21,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:10:21,861 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-08-26 03:10:21,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:21,918 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:10:21,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i[896,909] [2021-08-26 03:10:21,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:10:21,969 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:10:21,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21 WrapperNode [2021-08-26 03:10:21,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:10:21,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:21,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:10:21,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:10:21,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:21,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:10:22,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:10:22,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:10:22,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:10:22,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:10:22,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:10:22,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:10:22,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:10:22,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (1/1) ... [2021-08-26 03:10:22,054 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:10:22,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:10:22,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:10:22,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:10:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-26 03:10:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 03:10:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:10:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:10:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:10:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-26 03:10:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 03:10:22,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:10:22,398 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-26 03:10:22,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:22 BoogieIcfgContainer [2021-08-26 03:10:22,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:10:22,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:10:22,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:10:22,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:10:22,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:21" (1/3) ... [2021-08-26 03:10:22,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23303975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:22, skipping insertion in model container [2021-08-26 03:10:22,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:21" (2/3) ... [2021-08-26 03:10:22,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23303975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:22, skipping insertion in model container [2021-08-26 03:10:22,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:22" (3/3) ... [2021-08-26 03:10:22,404 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2021-08-26 03:10:22,407 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:10:22,407 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 03:10:22,437 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:10:22,442 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:10:22,442 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 03:10:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:10:22,454 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:22,455 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:22,456 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2021-08-26 03:10:22,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:22,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324948930] [2021-08-26 03:10:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:22,470 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:22,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:22,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 03:10:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:22,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 03:10:22,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:22,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:22,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:22,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324948930] [2021-08-26 03:10:22,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324948930] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:22,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:22,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 03:10:22,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916056570] [2021-08-26 03:10:22,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 03:10:22,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:22,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 03:10:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 03:10:22,679 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:22,689 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2021-08-26 03:10:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 03:10:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 03:10:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:22,694 INFO L225 Difference]: With dead ends: 48 [2021-08-26 03:10:22,695 INFO L226 Difference]: Without dead ends: 22 [2021-08-26 03:10:22,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 03:10:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-08-26 03:10:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-26 03:10:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-26 03:10:22,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2021-08-26 03:10:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:22,714 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-26 03:10:22,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-08-26 03:10:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:10:22,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:22,716 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:22,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:22,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:22,929 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2021-08-26 03:10:22,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:22,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422437379] [2021-08-26 03:10:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:22,934 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:22,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:22,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 03:10:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:22,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 03:10:22,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:23,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:10:23,127 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:23,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422437379] [2021-08-26 03:10:23,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422437379] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:23,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:23,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-26 03:10:23,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376395652] [2021-08-26 03:10:23,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:10:23,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:10:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:23,130 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:23,215 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2021-08-26 03:10:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:23,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:10:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:23,218 INFO L225 Difference]: With dead ends: 58 [2021-08-26 03:10:23,218 INFO L226 Difference]: Without dead ends: 40 [2021-08-26 03:10:23,219 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:10:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-26 03:10:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2021-08-26 03:10:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-08-26 03:10:23,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2021-08-26 03:10:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:23,234 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-26 03:10:23,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-08-26 03:10:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 03:10:23,234 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:23,235 INFO L512 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] [2021-08-26 03:10:23,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-26 03:10:23,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:23,445 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 1 times [2021-08-26 03:10:23,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:23,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793258039] [2021-08-26 03:10:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:23,446 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:23,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:23,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 03:10:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:23,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:10:23,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 03:10:23,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 03:10:23,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:23,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793258039] [2021-08-26 03:10:23,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793258039] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 03:10:23,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:23,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-26 03:10:23,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749598831] [2021-08-26 03:10:23,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 03:10:23,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 03:10:23,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:10:23,733 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:23,946 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2021-08-26 03:10:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:10:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 03:10:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:23,948 INFO L225 Difference]: With dead ends: 91 [2021-08-26 03:10:23,948 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 03:10:23,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.3ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:10:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 03:10:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2021-08-26 03:10:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-08-26 03:10:23,953 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 26 [2021-08-26 03:10:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:23,953 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-08-26 03:10:23,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-08-26 03:10:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 03:10:23,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:23,957 INFO L512 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] [2021-08-26 03:10:23,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:24,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:24,164 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 2 times [2021-08-26 03:10:24,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:24,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987156228] [2021-08-26 03:10:24,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 03:10:24,165 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:24,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:24,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 03:10:24,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-26 03:10:24,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:10:24,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 03:10:24,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-26 03:10:24,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-26 03:10:24,611 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:24,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987156228] [2021-08-26 03:10:24,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987156228] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:24,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:24,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:10:24,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128541247] [2021-08-26 03:10:24,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:10:24,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:10:24,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:24,613 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:24,686 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-08-26 03:10:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:10:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-08-26 03:10:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:24,688 INFO L225 Difference]: With dead ends: 46 [2021-08-26 03:10:24,688 INFO L226 Difference]: Without dead ends: 42 [2021-08-26 03:10:24,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:10:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-26 03:10:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-08-26 03:10:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2021-08-26 03:10:24,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 38 [2021-08-26 03:10:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:24,692 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-08-26 03:10:24,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2021-08-26 03:10:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 03:10:24,693 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:24,693 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:10:24,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:24,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:24,894 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1799835385, now seen corresponding path program 1 times [2021-08-26 03:10:24,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:24,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297108680] [2021-08-26 03:10:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:24,895 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:24,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:24,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 03:10:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:25,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:10:25,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-26 03:10:25,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-26 03:10:25,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:25,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297108680] [2021-08-26 03:10:25,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297108680] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 03:10:25,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:10:25,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 03:10:25,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111387519] [2021-08-26 03:10:25,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:10:25,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:10:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:25,228 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:25,279 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2021-08-26 03:10:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:10:25,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-26 03:10:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:25,281 INFO L225 Difference]: With dead ends: 54 [2021-08-26 03:10:25,281 INFO L226 Difference]: Without dead ends: 43 [2021-08-26 03:10:25,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:10:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-26 03:10:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-08-26 03:10:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2021-08-26 03:10:25,285 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2021-08-26 03:10:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:25,285 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2021-08-26 03:10:25,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2021-08-26 03:10:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-26 03:10:25,286 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:25,286 INFO L512 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] [2021-08-26 03:10:25,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:25,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:25,493 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1856180322, now seen corresponding path program 1 times [2021-08-26 03:10:25,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:25,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483291115] [2021-08-26 03:10:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:25,494 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:25,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:25,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:25,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 03:10:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:10:25,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:10:25,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:10:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-08-26 03:10:25,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 03:10:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-08-26 03:10:25,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 03:10:25,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483291115] [2021-08-26 03:10:25,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483291115] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 03:10:25,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:10:25,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-26 03:10:25,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168119317] [2021-08-26 03:10:25,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 03:10:25,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 03:10:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 03:10:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:10:25,882 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:10:26,013 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2021-08-26 03:10:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 03:10:26,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-08-26 03:10:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:10:26,014 INFO L225 Difference]: With dead ends: 98 [2021-08-26 03:10:26,014 INFO L226 Difference]: Without dead ends: 88 [2021-08-26 03:10:26,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 66.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-26 03:10:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-08-26 03:10:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2021-08-26 03:10:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-08-26 03:10:26,020 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2021-08-26 03:10:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:10:26,020 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-08-26 03:10:26,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:10:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-08-26 03:10:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-26 03:10:26,023 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:10:26,023 INFO L512 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] [2021-08-26 03:10:26,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 03:10:26,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:26,231 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:10:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:10:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2021-08-26 03:10:26,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 03:10:26,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177954043] [2021-08-26 03:10:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:10:26,232 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 03:10:26,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 03:10:26,233 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 03:10:26,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-26 03:10:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:10:26,443 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 03:10:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 03:10:26,564 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-26 03:10:26,573 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 03:10:26,573 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:10:26,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-08-26 03:10:26,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 03:10:26,779 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:10:26,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:10:26 BoogieIcfgContainer [2021-08-26 03:10:26,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:10:26,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:10:26,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:10:26,803 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:10:26,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:22" (3/4) ... [2021-08-26 03:10:26,804 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 03:10:26,849 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:10:26,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:10:26,852 INFO L168 Benchmark]: Toolchain (without parser) took 5132.30 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 45.9 MB in the beginning and 40.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 37.8 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:26,852 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 52.4 MB. Free memory was 33.8 MB in the beginning and 33.7 MB in the end (delta: 41.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:26,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.78 ms. Allocated memory is still 67.1 MB. Free memory was 45.7 MB in the beginning and 48.6 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:26,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.32 ms. Allocated memory is still 67.1 MB. Free memory was 48.4 MB in the beginning and 46.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:26,853 INFO L168 Benchmark]: Boogie Preprocessor took 38.21 ms. Allocated memory is still 67.1 MB. Free memory was 46.8 MB in the beginning and 45.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:10:26,854 INFO L168 Benchmark]: RCFGBuilder took 350.05 ms. Allocated memory is still 67.1 MB. Free memory was 45.3 MB in the beginning and 44.5 MB in the end (delta: 785.6 kB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:26,854 INFO L168 Benchmark]: TraceAbstraction took 4402.43 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 43.9 MB in the beginning and 43.8 MB in the end (delta: 107.5 kB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:26,856 INFO L168 Benchmark]: Witness Printer took 48.13 ms. Allocated memory is still 98.6 MB. Free memory was 43.8 MB in the beginning and 40.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:10:26,857 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 52.4 MB. Free memory was 33.8 MB in the beginning and 33.7 MB in the end (delta: 41.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 250.78 ms. Allocated memory is still 67.1 MB. Free memory was 45.7 MB in the beginning and 48.6 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.32 ms. Allocated memory is still 67.1 MB. Free memory was 48.4 MB in the beginning and 46.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.21 ms. Allocated memory is still 67.1 MB. Free memory was 46.8 MB in the beginning and 45.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 350.05 ms. Allocated memory is still 67.1 MB. Free memory was 45.3 MB in the beginning and 44.5 MB in the end (delta: 785.6 kB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4402.43 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 43.9 MB in the beginning and 43.8 MB in the end (delta: 107.5 kB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. * Witness Printer took 48.13 ms. Allocated memory is still 98.6 MB. Free memory was 43.8 MB in the beginning and 40.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND FALSE !(i<5) [L37] EXPR string_A[5 -1] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND FALSE !(i<5) [L41] EXPR string_B[5 -1] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 [L44] EXPR string_A[nc_A] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ [L44] EXPR string_A[nc_A] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 [L48] EXPR string_B[nc_B] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ [L48] EXPR string_B[nc_B] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 [L55] COND TRUE (inc_B-1)<