./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:11:19,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:11:19,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:11:19,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:11:19,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:11:19,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:11:19,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:11:19,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:11:19,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:11:19,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:11:19,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:11:19,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:11:19,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:11:19,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:11:19,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:11:19,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:11:19,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:11:19,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:11:19,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:11:19,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:11:19,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:11:19,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:11:19,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:11:19,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:11:19,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:11:19,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:11:19,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:11:19,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:11:19,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:11:19,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:11:19,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:11:19,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:11:19,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:11:19,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:11:19,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:11:19,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:11:19,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:11:19,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:11:19,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:11:19,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:11:19,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:11:19,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:11:19,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:11:19,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:11:19,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:11:19,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:11:19,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:11:19,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:11:19,405 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:11:19,405 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:11:19,405 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:11:19,405 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:11:19,406 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:11:19,406 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:11:19,406 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:11:19,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:11:19,406 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:11:19,406 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:11:19,407 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:11:19,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:11:19,408 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:11:19,409 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:11:19,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:11:19,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:11:19,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:11:19,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:11:19,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:11:19,409 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:11:19,410 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:11:19,410 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2021-12-15 17:11:19,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:11:19,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:11:19,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:11:19,635 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:11:19,635 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:11:19,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2021-12-15 17:11:19,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0e06204/c6b17c0a0e114ab6b729762fd9b330bd/FLAG0b65650b9 [2021-12-15 17:11:19,980 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:11:19,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2021-12-15 17:11:19,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0e06204/c6b17c0a0e114ab6b729762fd9b330bd/FLAG0b65650b9 [2021-12-15 17:11:20,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0e06204/c6b17c0a0e114ab6b729762fd9b330bd [2021-12-15 17:11:20,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:11:20,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:11:20,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:11:20,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:11:20,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:11:20,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f28b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20, skipping insertion in model container [2021-12-15 17:11:20,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:11:20,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:11:20,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i[893,906] [2021-12-15 17:11:20,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:11:20,573 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:11:20,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i[893,906] [2021-12-15 17:11:20,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:11:20,592 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:11:20,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20 WrapperNode [2021-12-15 17:11:20,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:11:20,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:11:20,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:11:20,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:11:20,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,616 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2021-12-15 17:11:20,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:11:20,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:11:20,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:11:20,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:11:20,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:11:20,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:11:20,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:11:20,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:11:20,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (1/1) ... [2021-12-15 17:11:20,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:11:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:20,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:11:20,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:11:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:11:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:11:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:11:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:11:20,745 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:11:20,746 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:11:20,840 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:11:20,843 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:11:20,844 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:11:20,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:11:20 BoogieIcfgContainer [2021-12-15 17:11:20,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:11:20,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:11:20,845 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:11:20,847 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:11:20,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:11:20,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:11:20" (1/3) ... [2021-12-15 17:11:20,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39837efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:11:20, skipping insertion in model container [2021-12-15 17:11:20,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:11:20,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:11:20" (2/3) ... [2021-12-15 17:11:20,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39837efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:11:20, skipping insertion in model container [2021-12-15 17:11:20,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:11:20,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:11:20" (3/3) ... [2021-12-15 17:11:20,850 INFO L388 chiAutomizerObserver]: Analyzing ICFG id_build.i [2021-12-15 17:11:20,878 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:11:20,878 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:11:20,878 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:11:20,878 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:11:20,878 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:11:20,878 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:11:20,878 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:11:20,879 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:11:20,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-12-15 17:11:20,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-12-15 17:11:20,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:20,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:20,903 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:11:20,903 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:11:20,903 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:11:20,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-12-15 17:11:20,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-12-15 17:11:20,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:20,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:20,905 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:11:20,905 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:11:20,909 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 15#L27-3true [2021-12-15 17:11:20,909 INFO L793 eck$LassoCheckResult]: Loop: 15#L27-3true assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 16#L28-3true assume !(main_~j~0#1 < 8); 11#L27-2true main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15#L27-3true [2021-12-15 17:11:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:11:20,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:20,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633252823] [2021-12-15 17:11:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:20,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:20,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:20,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:20,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 39941, now seen corresponding path program 1 times [2021-12-15 17:11:20,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:20,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149810219] [2021-12-15 17:11:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:20,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:11:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149810219] [2021-12-15 17:11:21,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149810219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:11:21,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:11:21,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:11:21,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626125704] [2021-12-15 17:11:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:11:21,047 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:11:21,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:11:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:11:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:11:21,072 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-12-15 17:11:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:11:21,091 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-12-15 17:11:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:11:21,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2021-12-15 17:11:21,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-12-15 17:11:21,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 17 transitions. [2021-12-15 17:11:21,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 17:11:21,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-15 17:11:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2021-12-15 17:11:21,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:11:21,104 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-12-15 17:11:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2021-12-15 17:11:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2021-12-15 17:11:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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-12-15 17:11:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-12-15 17:11:21,122 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-15 17:11:21,123 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-15 17:11:21,123 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:11:21,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-12-15 17:11:21,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:11:21,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:21,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:21,124 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:11:21,124 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:11:21,124 INFO L791 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 56#L27-3 [2021-12-15 17:11:21,125 INFO L793 eck$LassoCheckResult]: Loop: 56#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 57#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 53#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 54#L18-5 assume { :end_inline___VERIFIER_assert } true; 55#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 58#L28-3 assume !(main_~j~0#1 < 8); 59#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 56#L27-3 [2021-12-15 17:11:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:11:21,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183556104] [2021-12-15 17:11:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,149 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1762492053, now seen corresponding path program 1 times [2021-12-15 17:11:21,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558641654] [2021-12-15 17:11:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:11:21,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558641654] [2021-12-15 17:11:21,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558641654] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:11:21,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158320041] [2021-12-15 17:11:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:11:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:21,210 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-12-15 17:11:21,211 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-12-15 17:11:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:21,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:11:21,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:11:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158320041] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:11:21,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:11:21,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-15 17:11:21,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880157766] [2021-12-15 17:11:21,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:11:21,332 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:11:21,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:11:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 17:11:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-15 17:11:21,334 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-12-15 17:11:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:11:21,360 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-15 17:11:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:11:21,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2021-12-15 17:11:21,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-12-15 17:11:21,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2021-12-15 17:11:21,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-15 17:11:21,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-15 17:11:21,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2021-12-15 17:11:21,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:11:21,364 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-15 17:11:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2021-12-15 17:11:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 17:11:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 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-12-15 17:11:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-12-15 17:11:21,366 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-15 17:11:21,366 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-15 17:11:21,366 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:11:21,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2021-12-15 17:11:21,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-12-15 17:11:21,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:21,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:21,368 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:11:21,368 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 1, 1, 1] [2021-12-15 17:11:21,368 INFO L791 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 155#L27-3 [2021-12-15 17:11:21,368 INFO L793 eck$LassoCheckResult]: Loop: 155#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 156#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 147#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 154#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 152#L18-5 assume { :end_inline___VERIFIER_assert } true; 153#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 157#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 150#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 151#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 173#L18-5 assume { :end_inline___VERIFIER_assert } true; 172#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 171#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 169#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 168#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 167#L18-5 assume { :end_inline___VERIFIER_assert } true; 166#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 165#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 160#L18 assume !(0 == __VERIFIER_assert_~cond#1); 164#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 163#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 162#L18-5 assume { :end_inline___VERIFIER_assert } true; 161#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 159#L28-3 assume !(main_~j~0#1 < 8); 158#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 155#L27-3 [2021-12-15 17:11:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:11:21,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140616420] [2021-12-15 17:11:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,380 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1080615355, now seen corresponding path program 2 times [2021-12-15 17:11:21,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459157375] [2021-12-15 17:11:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:11:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:11:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459157375] [2021-12-15 17:11:21,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459157375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:11:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616569437] [2021-12-15 17:11:21,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:11:21,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:11:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:11:21,442 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-12-15 17:11:21,443 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-12-15 17:11:21,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:11:21,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:11:21,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:11:21,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:11:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:11:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:11:21,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616569437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:11:21,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:11:21,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-15 17:11:21,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734461619] [2021-12-15 17:11:21,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:11:21,672 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:11:21,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:11:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 17:11:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-12-15 17:11:21,673 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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-12-15 17:11:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:11:21,704 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2021-12-15 17:11:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:11:21,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 54 transitions. [2021-12-15 17:11:21,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-15 17:11:21,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 54 transitions. [2021-12-15 17:11:21,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-12-15 17:11:21,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-12-15 17:11:21,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 54 transitions. [2021-12-15 17:11:21,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:11:21,708 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-12-15 17:11:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 54 transitions. [2021-12-15 17:11:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-15 17:11:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 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-12-15 17:11:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-12-15 17:11:21,713 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-12-15 17:11:21,713 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-12-15 17:11:21,713 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:11:21,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 54 transitions. [2021-12-15 17:11:21,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-15 17:11:21,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:11:21,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:11:21,714 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:11:21,714 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 1, 1, 1] [2021-12-15 17:11:21,715 INFO L791 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 406#L27-3 [2021-12-15 17:11:21,719 INFO L793 eck$LassoCheckResult]: Loop: 406#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 407#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 398#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 405#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 403#L18-5 assume { :end_inline___VERIFIER_assert } true; 404#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 408#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 401#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 402#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 448#L18-5 assume { :end_inline___VERIFIER_assert } true; 447#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 446#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 444#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 443#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 442#L18-5 assume { :end_inline___VERIFIER_assert } true; 441#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 440#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 439#L18 assume !(0 == __VERIFIER_assert_~cond#1); 438#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 437#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 436#L18-5 assume { :end_inline___VERIFIER_assert } true; 435#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 434#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 433#L18 assume !(0 == __VERIFIER_assert_~cond#1); 432#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 431#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 430#L18-5 assume { :end_inline___VERIFIER_assert } true; 429#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 428#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 426#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 425#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 424#L18-5 assume { :end_inline___VERIFIER_assert } true; 423#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 422#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 421#L18 assume !(0 == __VERIFIER_assert_~cond#1); 420#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 419#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 418#L18-5 assume { :end_inline___VERIFIER_assert } true; 417#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 416#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 415#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 414#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 413#L18-5 assume { :end_inline___VERIFIER_assert } true; 412#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 410#L28-3 assume !(main_~j~0#1 < 8); 409#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 406#L27-3 [2021-12-15 17:11:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:11:21,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658154596] [2021-12-15 17:11:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 811262085, now seen corresponding path program 3 times [2021-12-15 17:11:21,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76763915] [2021-12-15 17:11:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,749 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,788 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:11:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2018441603, now seen corresponding path program 1 times [2021-12-15 17:11:21,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:11:21,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153764158] [2021-12-15 17:11:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:11:21,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:11:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:11:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:11:21,838 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:11:22,333 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:11:22,336 INFO L158 Benchmark]: Toolchain (without parser) took 1926.72ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 83.5MB in the beginning and 123.7MB in the end (delta: -40.2MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2021-12-15 17:11:22,336 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 92.7MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:11:22,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.28ms. Allocated memory is still 119.5MB. Free memory was 83.2MB in the beginning and 94.3MB in the end (delta: -11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:11:22,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.65ms. Allocated memory is still 119.5MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:11:22,337 INFO L158 Benchmark]: Boogie Preprocessor took 22.03ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 91.5MB in the end (delta: 671.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:11:22,337 INFO L158 Benchmark]: RCFGBuilder took 205.72ms. Allocated memory is still 119.5MB. Free memory was 91.5MB in the beginning and 82.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:11:22,338 INFO L158 Benchmark]: BuchiAutomizer took 1489.38ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 82.4MB in the beginning and 123.7MB in the end (delta: -41.3MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2021-12-15 17:11:22,340 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.17ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 92.7MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.28ms. Allocated memory is still 119.5MB. Free memory was 83.2MB in the beginning and 94.3MB in the end (delta: -11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.65ms. Allocated memory is still 119.5MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.03ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 91.5MB in the end (delta: 671.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.72ms. Allocated memory is still 119.5MB. Free memory was 91.5MB in the beginning and 82.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1489.38ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 82.4MB in the beginning and 123.7MB in the end (delta: -41.3MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:11:22,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-15 17:11:22,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 17:11:22,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable