./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --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/locks/test_locks_10.c -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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:52,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:52,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:52,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:52,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:52,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:52,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:52,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:52,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:52,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:52,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:52,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:52,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:52,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:52,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:52,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:52,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:52,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:52,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:52,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:52,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:52,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:52,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:52,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:52,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:52,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:52,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:52,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:52,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:52,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:52,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:52,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:52,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:52,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:52,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:52,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:52,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:52,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:52,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:52,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:52,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:52,974 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:06:53,000 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:53,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:53,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:53,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:53,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:53,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:53,002 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:53,003 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:53,003 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:53,003 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:53,004 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:53,004 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:53,004 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:53,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:53,004 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:53,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:53,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:53,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:53,006 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:53,006 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:53,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:53,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:53,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:53,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:53,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:53,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:53,008 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:53,008 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2021-12-15 17:06:53,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:53,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:53,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:53,235 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:53,235 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:53,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2021-12-15 17:06:53,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142e44141/f6c6fd15461c4689ba0fdedcbca400e2/FLAGc645a77f2 [2021-12-15 17:06:53,621 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:53,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2021-12-15 17:06:53,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142e44141/f6c6fd15461c4689ba0fdedcbca400e2/FLAGc645a77f2 [2021-12-15 17:06:54,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142e44141/f6c6fd15461c4689ba0fdedcbca400e2 [2021-12-15 17:06:54,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:54,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:54,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:54,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:54,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:54,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc3b6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54, skipping insertion in model container [2021-12-15 17:06:54,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:54,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:54,214 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/locks/test_locks_10.c[3901,3914] [2021-12-15 17:06:54,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:54,222 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:54,254 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/locks/test_locks_10.c[3901,3914] [2021-12-15 17:06:54,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:54,267 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:54,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54 WrapperNode [2021-12-15 17:06:54,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:54,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:54,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:54,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:54,276 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:06:54" (1/1) ... [2021-12-15 17:06:54,281 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:06:54" (1/1) ... [2021-12-15 17:06:54,301 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2021-12-15 17:06:54,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:54,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:54,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:54,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:54,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:54,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:54,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:54,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:54,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (1/1) ... [2021-12-15 17:06:54,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:54,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:54,383 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:06:54,411 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:06:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:54,466 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:54,467 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:54,571 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:54,575 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:54,575 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:06:54,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:54 BoogieIcfgContainer [2021-12-15 17:06:54,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:54,577 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:54,577 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:54,579 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:54,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:54,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:54" (1/3) ... [2021-12-15 17:06:54,595 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b431e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:54, skipping insertion in model container [2021-12-15 17:06:54,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:54,595 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:54" (2/3) ... [2021-12-15 17:06:54,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b431e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:54, skipping insertion in model container [2021-12-15 17:06:54,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:54,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:54" (3/3) ... [2021-12-15 17:06:54,597 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2021-12-15 17:06:54,644 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:54,644 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:54,645 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:54,645 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:54,645 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:54,645 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:54,645 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:54,645 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:54,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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:06:54,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-15 17:06:54,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:54,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:54,699 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:54,699 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:54,699 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:54,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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:06:54,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-15 17:06:54,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:54,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:54,716 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:54,716 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:54,721 INFO L791 eck$LassoCheckResult]: Stem: 24#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(16, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 30#L155-1true [2021-12-15 17:06:54,721 INFO L793 eck$LassoCheckResult]: Loop: 30#L155-1true assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 27#L43true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 31#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 10#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4#L72-1true assume !(0 != main_~p3~0#1); 19#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 18#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 7#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 39#L104-1true assume !(0 != main_~p1~0#1); 25#L110-1true assume !(0 != main_~p2~0#1); 34#L115-1true assume !(0 != main_~p3~0#1); 17#L120-1true assume !(0 != main_~p4~0#1); 29#L125-1true assume !(0 != main_~p5~0#1); 36#L130-1true assume !(0 != main_~p6~0#1); 16#L135-1true assume !(0 != main_~p7~0#1); 14#L140-1true assume !(0 != main_~p8~0#1); 40#L145-1true assume !(0 != main_~p9~0#1); 11#L150-1true assume !(0 != main_~p10~0#1); 30#L155-1true [2021-12-15 17:06:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:06:54,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:54,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593048226] [2021-12-15 17:06:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:54,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:54,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:54,841 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2021-12-15 17:06:54,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:54,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968802028] [2021-12-15 17:06:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:54,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:54,949 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:06:54,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:54,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968802028] [2021-12-15 17:06:54,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968802028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:54,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:54,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:54,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585858779] [2021-12-15 17:06:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:54,955 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:54,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:54,982 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,023 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2021-12-15 17:06:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2021-12-15 17:06:55,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2021-12-15 17:06:55,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2021-12-15 17:06:55,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-12-15 17:06:55,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-12-15 17:06:55,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2021-12-15 17:06:55,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,049 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-12-15 17:06:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2021-12-15 17:06:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-15 17:06:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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:06:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2021-12-15 17:06:55,071 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-12-15 17:06:55,071 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-12-15 17:06:55,072 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:06:55,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2021-12-15 17:06:55,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2021-12-15 17:06:55,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,074 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,074 INFO L791 eck$LassoCheckResult]: Stem: 150#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(16, 2);call #Ultimate.allocInit(12, 3); 132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 133#L155-1 [2021-12-15 17:06:55,075 INFO L793 eck$LassoCheckResult]: Loop: 133#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 154#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 155#L68 assume !(0 != main_~p1~0#1); 134#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 123#L72-1 assume !(0 != main_~p3~0#1); 124#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 146#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 167#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 166#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 125#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 126#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 131#L104-1 assume !(0 != main_~p1~0#1); 151#L110-1 assume !(0 != main_~p2~0#1); 152#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 128#L125-1 assume !(0 != main_~p5~0#1); 138#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 139#L140-1 assume !(0 != main_~p8~0#1); 140#L145-1 assume !(0 != main_~p9~0#1); 135#L150-1 assume !(0 != main_~p10~0#1); 133#L155-1 [2021-12-15 17:06:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:06:55,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910194379] [2021-12-15 17:06:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,100 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2021-12-15 17:06:55,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927670818] [2021-12-15 17:06:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,136 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:06:55,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927670818] [2021-12-15 17:06:55,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927670818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983677856] [2021-12-15 17:06:55,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,138 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,139 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,151 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2021-12-15 17:06:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2021-12-15 17:06:55,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2021-12-15 17:06:55,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2021-12-15 17:06:55,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-15 17:06:55,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-15 17:06:55,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2021-12-15 17:06:55,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,159 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-12-15 17:06:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2021-12-15 17:06:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-15 17:06:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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:06:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2021-12-15 17:06:55,168 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-12-15 17:06:55,168 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-12-15 17:06:55,168 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:06:55,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2021-12-15 17:06:55,170 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2021-12-15 17:06:55,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,173 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,173 INFO L791 eck$LassoCheckResult]: Stem: 347#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(16, 2);call #Ultimate.allocInit(12, 3); 328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 329#L155-1 [2021-12-15 17:06:55,173 INFO L793 eck$LassoCheckResult]: Loop: 329#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 373#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 371#L68 assume !(0 != main_~p1~0#1); 369#L68-2 assume !(0 != main_~p2~0#1); 368#L72-1 assume !(0 != main_~p3~0#1); 367#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 366#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 365#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 364#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 363#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 362#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 361#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 359#L104-1 assume !(0 != main_~p1~0#1); 360#L110-1 assume !(0 != main_~p2~0#1); 391#L115-1 assume !(0 != main_~p3~0#1); 388#L120-1 assume !(0 != main_~p4~0#1); 385#L125-1 assume !(0 != main_~p5~0#1); 383#L130-1 assume !(0 != main_~p6~0#1); 381#L135-1 assume !(0 != main_~p7~0#1); 379#L140-1 assume !(0 != main_~p8~0#1); 377#L145-1 assume !(0 != main_~p9~0#1); 375#L150-1 assume !(0 != main_~p10~0#1); 329#L155-1 [2021-12-15 17:06:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:06:55,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922349401] [2021-12-15 17:06:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2021-12-15 17:06:55,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008741044] [2021-12-15 17:06:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,228 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:06:55,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008741044] [2021-12-15 17:06:55,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008741044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034092642] [2021-12-15 17:06:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,231 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,232 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,254 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2021-12-15 17:06:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2021-12-15 17:06:55,257 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2021-12-15 17:06:55,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2021-12-15 17:06:55,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2021-12-15 17:06:55,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2021-12-15 17:06:55,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2021-12-15 17:06:55,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,261 INFO L681 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-12-15 17:06:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2021-12-15 17:06:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-12-15 17:06:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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:06:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2021-12-15 17:06:55,274 INFO L704 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-12-15 17:06:55,274 INFO L587 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-12-15 17:06:55,274 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:06:55,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2021-12-15 17:06:55,276 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2021-12-15 17:06:55,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,277 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,277 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,277 INFO L791 eck$LassoCheckResult]: Stem: 729#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(16, 2);call #Ultimate.allocInit(12, 3); 706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 707#L155-1 [2021-12-15 17:06:55,277 INFO L793 eck$LassoCheckResult]: Loop: 707#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 776#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 773#L68 assume !(0 != main_~p1~0#1); 769#L68-2 assume !(0 != main_~p2~0#1); 767#L72-1 assume !(0 != main_~p3~0#1); 764#L76-1 assume !(0 != main_~p4~0#1); 765#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 759#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 760#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 755#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 756#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 751#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 752#L104-1 assume !(0 != main_~p1~0#1); 807#L110-1 assume !(0 != main_~p2~0#1); 805#L115-1 assume !(0 != main_~p3~0#1); 802#L120-1 assume !(0 != main_~p4~0#1); 799#L125-1 assume !(0 != main_~p5~0#1); 795#L130-1 assume !(0 != main_~p6~0#1); 791#L135-1 assume !(0 != main_~p7~0#1); 787#L140-1 assume !(0 != main_~p8~0#1); 783#L145-1 assume !(0 != main_~p9~0#1); 781#L150-1 assume !(0 != main_~p10~0#1); 707#L155-1 [2021-12-15 17:06:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:06:55,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952950475] [2021-12-15 17:06:55,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2021-12-15 17:06:55,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328150197] [2021-12-15 17:06:55,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,310 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:06:55,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328150197] [2021-12-15 17:06:55,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328150197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446964384] [2021-12-15 17:06:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,315 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,315 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,326 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2021-12-15 17:06:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2021-12-15 17:06:55,337 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2021-12-15 17:06:55,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2021-12-15 17:06:55,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2021-12-15 17:06:55,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2021-12-15 17:06:55,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2021-12-15 17:06:55,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,344 INFO L681 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-12-15 17:06:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2021-12-15 17:06:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-12-15 17:06:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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:06:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2021-12-15 17:06:55,370 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-12-15 17:06:55,370 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-12-15 17:06:55,370 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:06:55,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2021-12-15 17:06:55,372 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2021-12-15 17:06:55,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,379 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,379 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,379 INFO L791 eck$LassoCheckResult]: Stem: 1462#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(16, 2);call #Ultimate.allocInit(12, 3); 1440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 1441#L155-1 [2021-12-15 17:06:55,381 INFO L793 eck$LassoCheckResult]: Loop: 1441#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1511#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 1508#L68 assume !(0 != main_~p1~0#1); 1504#L68-2 assume !(0 != main_~p2~0#1); 1501#L72-1 assume !(0 != main_~p3~0#1); 1498#L76-1 assume !(0 != main_~p4~0#1); 1499#L80-1 assume !(0 != main_~p5~0#1); 1562#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1559#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1556#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1553#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1551#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1548#L104-1 assume !(0 != main_~p1~0#1); 1544#L110-1 assume !(0 != main_~p2~0#1); 1541#L115-1 assume !(0 != main_~p3~0#1); 1537#L120-1 assume !(0 != main_~p4~0#1); 1534#L125-1 assume !(0 != main_~p5~0#1); 1532#L130-1 assume !(0 != main_~p6~0#1); 1528#L135-1 assume !(0 != main_~p7~0#1); 1524#L140-1 assume !(0 != main_~p8~0#1); 1520#L145-1 assume !(0 != main_~p9~0#1); 1516#L150-1 assume !(0 != main_~p10~0#1); 1441#L155-1 [2021-12-15 17:06:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:06:55,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050060928] [2021-12-15 17:06:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,402 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2021-12-15 17:06:55,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076200896] [2021-12-15 17:06:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,420 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:06:55,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076200896] [2021-12-15 17:06:55,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076200896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708837979] [2021-12-15 17:06:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,426 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,427 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,457 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2021-12-15 17:06:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2021-12-15 17:06:55,465 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2021-12-15 17:06:55,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2021-12-15 17:06:55,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2021-12-15 17:06:55,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2021-12-15 17:06:55,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2021-12-15 17:06:55,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,487 INFO L681 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-12-15 17:06:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2021-12-15 17:06:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2021-12-15 17:06:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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:06:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2021-12-15 17:06:55,514 INFO L704 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-12-15 17:06:55,514 INFO L587 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-12-15 17:06:55,514 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:06:55,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2021-12-15 17:06:55,517 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2021-12-15 17:06:55,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,518 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,518 INFO L791 eck$LassoCheckResult]: Stem: 2899#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(16, 2);call #Ultimate.allocInit(12, 3); 2874#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 2875#L155-1 [2021-12-15 17:06:55,518 INFO L793 eck$LassoCheckResult]: Loop: 2875#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 2948#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 2949#L68 assume !(0 != main_~p1~0#1); 3042#L68-2 assume !(0 != main_~p2~0#1); 3037#L72-1 assume !(0 != main_~p3~0#1); 3031#L76-1 assume !(0 != main_~p4~0#1); 3032#L80-1 assume !(0 != main_~p5~0#1); 3051#L84-1 assume !(0 != main_~p6~0#1); 3047#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3045#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3039#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3035#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3028#L104-1 assume !(0 != main_~p1~0#1); 3001#L110-1 assume !(0 != main_~p2~0#1); 2998#L115-1 assume !(0 != main_~p3~0#1); 2993#L120-1 assume !(0 != main_~p4~0#1); 2989#L125-1 assume !(0 != main_~p5~0#1); 2987#L130-1 assume !(0 != main_~p6~0#1); 2972#L135-1 assume !(0 != main_~p7~0#1); 2971#L140-1 assume !(0 != main_~p8~0#1); 3067#L145-1 assume !(0 != main_~p9~0#1); 2956#L150-1 assume !(0 != main_~p10~0#1); 2875#L155-1 [2021-12-15 17:06:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:06:55,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760290894] [2021-12-15 17:06:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2021-12-15 17:06:55,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416826833] [2021-12-15 17:06:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,546 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:06:55,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416826833] [2021-12-15 17:06:55,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416826833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745932340] [2021-12-15 17:06:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,548 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,549 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,562 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2021-12-15 17:06:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2021-12-15 17:06:55,582 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2021-12-15 17:06:55,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2021-12-15 17:06:55,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2021-12-15 17:06:55,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2021-12-15 17:06:55,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2021-12-15 17:06:55,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,592 INFO L681 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-12-15 17:06:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2021-12-15 17:06:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2021-12-15 17:06:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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:06:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2021-12-15 17:06:55,618 INFO L704 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-12-15 17:06:55,618 INFO L587 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-12-15 17:06:55,618 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:06:55,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2021-12-15 17:06:55,625 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2021-12-15 17:06:55,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,626 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,626 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,626 INFO L791 eck$LassoCheckResult]: Stem: 5706#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(16, 2);call #Ultimate.allocInit(12, 3); 5684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 5685#L155-1 [2021-12-15 17:06:55,626 INFO L793 eck$LassoCheckResult]: Loop: 5685#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5885#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 5882#L68 assume !(0 != main_~p1~0#1); 5878#L68-2 assume !(0 != main_~p2~0#1); 5875#L72-1 assume !(0 != main_~p3~0#1); 5873#L76-1 assume !(0 != main_~p4~0#1); 5863#L80-1 assume !(0 != main_~p5~0#1); 5865#L84-1 assume !(0 != main_~p6~0#1); 5850#L88-1 assume !(0 != main_~p7~0#1); 5852#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5838#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5839#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5825#L104-1 assume !(0 != main_~p1~0#1); 5826#L110-1 assume !(0 != main_~p2~0#1); 5804#L115-1 assume !(0 != main_~p3~0#1); 5803#L120-1 assume !(0 != main_~p4~0#1); 5903#L125-1 assume !(0 != main_~p5~0#1); 5901#L130-1 assume !(0 != main_~p6~0#1); 5899#L135-1 assume !(0 != main_~p7~0#1); 5896#L140-1 assume !(0 != main_~p8~0#1); 5894#L145-1 assume !(0 != main_~p9~0#1); 5890#L150-1 assume !(0 != main_~p10~0#1); 5685#L155-1 [2021-12-15 17:06:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-15 17:06:55,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874731853] [2021-12-15 17:06:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2021-12-15 17:06:55,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190995281] [2021-12-15 17:06:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,649 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:06:55,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190995281] [2021-12-15 17:06:55,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190995281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608799015] [2021-12-15 17:06:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,650 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,651 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,671 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2021-12-15 17:06:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2021-12-15 17:06:55,709 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2021-12-15 17:06:55,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2021-12-15 17:06:55,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2021-12-15 17:06:55,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2021-12-15 17:06:55,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2021-12-15 17:06:55,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:55,727 INFO L681 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-12-15 17:06:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2021-12-15 17:06:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2021-12-15 17:06:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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:06:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2021-12-15 17:06:55,776 INFO L704 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-12-15 17:06:55,776 INFO L587 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-12-15 17:06:55,776 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:06:55,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2021-12-15 17:06:55,790 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2021-12-15 17:06:55,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:55,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:55,791 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:55,791 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:55,791 INFO L791 eck$LassoCheckResult]: Stem: 11221#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(16, 2);call #Ultimate.allocInit(12, 3); 11198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 11199#L155-1 [2021-12-15 17:06:55,791 INFO L793 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11355#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 11352#L68 assume !(0 != main_~p1~0#1); 11348#L68-2 assume !(0 != main_~p2~0#1); 11345#L72-1 assume !(0 != main_~p3~0#1); 11342#L76-1 assume !(0 != main_~p4~0#1); 11291#L80-1 assume !(0 != main_~p5~0#1); 11277#L84-1 assume !(0 != main_~p6~0#1); 11279#L88-1 assume !(0 != main_~p7~0#1); 11480#L92-1 assume !(0 != main_~p8~0#1); 11481#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11482#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11439#L104-1 assume !(0 != main_~p1~0#1); 11436#L110-1 assume !(0 != main_~p2~0#1); 11423#L115-1 assume !(0 != main_~p3~0#1); 11416#L120-1 assume !(0 != main_~p4~0#1); 11411#L125-1 assume !(0 != main_~p5~0#1); 11404#L130-1 assume !(0 != main_~p6~0#1); 11398#L135-1 assume !(0 != main_~p7~0#1); 11393#L140-1 assume !(0 != main_~p8~0#1); 11387#L145-1 assume !(0 != main_~p9~0#1); 11360#L150-1 assume !(0 != main_~p10~0#1); 11199#L155-1 [2021-12-15 17:06:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-15 17:06:55,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100186049] [2021-12-15 17:06:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:55,799 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2021-12-15 17:06:55,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:55,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148728620] [2021-12-15 17:06:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:55,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:55,813 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:06:55,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:55,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148728620] [2021-12-15 17:06:55,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148728620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:55,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:55,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:55,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457007939] [2021-12-15 17:06:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:55,815 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:55,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:55,816 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:06:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:55,844 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2021-12-15 17:06:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:55,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2021-12-15 17:06:55,944 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2021-12-15 17:06:56,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2021-12-15 17:06:56,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2021-12-15 17:06:56,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2021-12-15 17:06:56,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2021-12-15 17:06:56,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:56,035 INFO L681 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-12-15 17:06:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2021-12-15 17:06:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2021-12-15 17:06:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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:06:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2021-12-15 17:06:56,214 INFO L704 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-12-15 17:06:56,214 INFO L587 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-12-15 17:06:56,215 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:06:56,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2021-12-15 17:06:56,236 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2021-12-15 17:06:56,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:56,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:56,237 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:56,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:56,237 INFO L791 eck$LassoCheckResult]: Stem: 22047#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(16, 2);call #Ultimate.allocInit(12, 3); 22025#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 22026#L155-1 [2021-12-15 17:06:56,237 INFO L793 eck$LassoCheckResult]: Loop: 22026#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 22222#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 22212#L68 assume !(0 != main_~p1~0#1); 22214#L68-2 assume !(0 != main_~p2~0#1); 22204#L72-1 assume !(0 != main_~p3~0#1); 22205#L76-1 assume !(0 != main_~p4~0#1); 22437#L80-1 assume !(0 != main_~p5~0#1); 22435#L84-1 assume !(0 != main_~p6~0#1); 22431#L88-1 assume !(0 != main_~p7~0#1); 22427#L92-1 assume !(0 != main_~p8~0#1); 22423#L96-1 assume !(0 != main_~p9~0#1); 22421#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22417#L104-1 assume !(0 != main_~p1~0#1); 22413#L110-1 assume !(0 != main_~p2~0#1); 22409#L115-1 assume !(0 != main_~p3~0#1); 22406#L120-1 assume !(0 != main_~p4~0#1); 22401#L125-1 assume !(0 != main_~p5~0#1); 22402#L130-1 assume !(0 != main_~p6~0#1); 22391#L135-1 assume !(0 != main_~p7~0#1); 22392#L140-1 assume !(0 != main_~p8~0#1); 22228#L145-1 assume !(0 != main_~p9~0#1); 22229#L150-1 assume !(0 != main_~p10~0#1); 22026#L155-1 [2021-12-15 17:06:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-15 17:06:56,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:56,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766544424] [2021-12-15 17:06:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:56,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,241 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2021-12-15 17:06:56,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540719093] [2021-12-15 17:06:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:56,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:56,265 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:06:56,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:56,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540719093] [2021-12-15 17:06:56,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540719093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:56,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:56,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:06:56,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428616649] [2021-12-15 17:06:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:56,266 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:56,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:56,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:56,267 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:06:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:56,393 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2021-12-15 17:06:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:56,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2021-12-15 17:06:56,442 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2021-12-15 17:06:56,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2021-12-15 17:06:56,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2021-12-15 17:06:56,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2021-12-15 17:06:56,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2021-12-15 17:06:56,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:56,623 INFO L681 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-12-15 17:06:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2021-12-15 17:06:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2021-12-15 17:06:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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:06:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2021-12-15 17:06:56,876 INFO L704 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-12-15 17:06:56,876 INFO L587 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-12-15 17:06:56,876 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:06:56,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2021-12-15 17:06:56,963 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2021-12-15 17:06:56,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:56,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:56,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:56,965 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:56,965 INFO L791 eck$LassoCheckResult]: Stem: 43305#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(16, 2);call #Ultimate.allocInit(12, 3); 43283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 43284#L155-1 [2021-12-15 17:06:56,966 INFO L793 eck$LassoCheckResult]: Loop: 43284#L155-1 assume !false;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 43670#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 43660#L68 assume !(0 != main_~p1~0#1); 43662#L68-2 assume !(0 != main_~p2~0#1); 43651#L72-1 assume !(0 != main_~p3~0#1); 43652#L76-1 assume !(0 != main_~p4~0#1); 43620#L80-1 assume !(0 != main_~p5~0#1); 43622#L84-1 assume !(0 != main_~p6~0#1); 43715#L88-1 assume !(0 != main_~p7~0#1); 43717#L92-1 assume !(0 != main_~p8~0#1); 43779#L96-1 assume !(0 != main_~p9~0#1); 43776#L100-1 assume !(0 != main_~p10~0#1); 43772#L104-1 assume !(0 != main_~p1~0#1); 43768#L110-1 assume !(0 != main_~p2~0#1); 43765#L115-1 assume !(0 != main_~p3~0#1); 43761#L120-1 assume !(0 != main_~p4~0#1); 43444#L125-1 assume !(0 != main_~p5~0#1); 43445#L130-1 assume !(0 != main_~p6~0#1); 43434#L135-1 assume !(0 != main_~p7~0#1); 43436#L140-1 assume !(0 != main_~p8~0#1); 43679#L145-1 assume !(0 != main_~p9~0#1); 43681#L150-1 assume !(0 != main_~p10~0#1); 43284#L155-1 [2021-12-15 17:06:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-15 17:06:56,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:56,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410093951] [2021-12-15 17:06:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:56,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,980 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2021-12-15 17:06:56,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:56,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997655121] [2021-12-15 17:06:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:56,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2021-12-15 17:06:56,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:56,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633479142] [2021-12-15 17:06:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:56,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:56,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,001 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,134 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:06:57,137 INFO L158 Benchmark]: Toolchain (without parser) took 3104.74ms. Allocated memory was 94.4MB in the beginning and 331.4MB in the end (delta: 237.0MB). Free memory was 67.2MB in the beginning and 202.6MB in the end (delta: -135.4MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2021-12-15 17:06:57,137 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:06:57,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.96ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 68.4MB in the end (delta: -1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:06:57,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 66.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:06:57,138 INFO L158 Benchmark]: Boogie Preprocessor took 35.08ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 65.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:06:57,138 INFO L158 Benchmark]: RCFGBuilder took 238.32ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 54.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:06:57,139 INFO L158 Benchmark]: BuchiAutomizer took 2558.67ms. Allocated memory was 94.4MB in the beginning and 331.4MB in the end (delta: 237.0MB). Free memory was 54.2MB in the beginning and 202.6MB in the end (delta: -148.4MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2021-12-15 17:06:57,140 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.14ms. Allocated memory is still 94.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.96ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 68.4MB in the end (delta: -1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 66.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.08ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 65.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 238.32ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 54.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2558.67ms. Allocated memory was 94.4MB in the beginning and 331.4MB in the end (delta: 237.0MB). Free memory was 54.2MB in the beginning and 202.6MB in the end (delta: -148.4MB). Peak memory consumption was 90.7MB. 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:06:57,164 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