./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:12:01,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:12:01,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:12:01,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:12:01,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:12:01,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:12:01,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:12:01,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:12:01,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:12:01,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:12:01,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:12:01,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:12:01,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:12:01,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:12:01,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:12:01,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:12:01,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:12:01,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:12:01,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:12:01,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:12:01,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:12:01,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:12:01,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:12:01,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:12:01,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:12:01,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:12:01,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:12:01,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:12:01,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:12:01,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:12:01,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:12:01,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:12:01,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:12:01,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:12:01,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:12:01,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:12:01,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:12:01,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:12:01,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:12:01,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:12:01,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:12:01,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:12:01,667 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:12:01,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:12:01,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:12:01,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:12:01,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:12:01,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:12:01,686 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:12:01,686 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:12:01,686 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:12:01,687 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:12:01,687 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:12:01,687 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:12:01,688 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:12:01,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:12:01,688 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:12:01,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:12:01,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:12:01,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:12:01,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:12:01,689 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:12:01,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:12:01,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:12:01,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:12:01,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:12:01,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:12:01,691 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:12:01,691 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:12:01,692 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-14 23:12:02,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:12:02,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:12:02,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:12:02,093 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:12:02,094 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:12:02,095 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-14 23:12:02,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7270bc1/18791261377f42d99dd565734d0a9993/FLAG0d7a864f5 [2021-12-14 23:12:02,537 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:12:02,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2021-12-14 23:12:02,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7270bc1/18791261377f42d99dd565734d0a9993/FLAG0d7a864f5 [2021-12-14 23:12:02,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7270bc1/18791261377f42d99dd565734d0a9993 [2021-12-14 23:12:02,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:12:02,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:12:02,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:02,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:12:02,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:12:02,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbc1911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02, skipping insertion in model container [2021-12-14 23:12:02,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:12:02,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:12:02,776 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-14 23:12:02,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:02,784 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:12:02,816 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-14 23:12:02,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:02,829 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:12:02,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02 WrapperNode [2021-12-14 23:12:02,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:02,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:02,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:12:02,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:12:02,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,865 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2021-12-14 23:12:02,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:02,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:12:02,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:12:02,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:12:02,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:12:02,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:12:02,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:12:02,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:12:02,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (1/1) ... [2021-12-14 23:12:02,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:12:02,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:12:02,945 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-14 23:12:02,958 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-14 23:12:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:12:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:12:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:12:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:12:03,027 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:12:03,028 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:12:03,145 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:12:03,149 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:12:03,150 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:12:03,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:03 BoogieIcfgContainer [2021-12-14 23:12:03,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:12:03,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:12:03,152 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:12:03,154 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:12:03,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:03,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:12:02" (1/3) ... [2021-12-14 23:12:03,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a339e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:03, skipping insertion in model container [2021-12-14 23:12:03,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:03,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:02" (2/3) ... [2021-12-14 23:12:03,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a339e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:03, skipping insertion in model container [2021-12-14 23:12:03,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:03,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:03" (3/3) ... [2021-12-14 23:12:03,158 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2021-12-14 23:12:03,186 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:12:03,186 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:12:03,186 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:12:03,187 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:12:03,187 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:12:03,187 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:12:03,187 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:12:03,187 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:12:03,196 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-14 23:12:03,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-14 23:12:03,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:03,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:03,213 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:03,213 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-14 23:12:03,213 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:12:03,214 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-14 23:12:03,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-14 23:12:03,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:03,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:03,217 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:03,217 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-14 23:12:03,222 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-14 23:12:03,222 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-14 23:12:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:12:03,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632832903] [2021-12-14 23:12:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,357 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2021-12-14 23:12:03,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790228420] [2021-12-14 23:12:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:03,467 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-14 23:12:03,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:03,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790228420] [2021-12-14 23:12:03,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790228420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:03,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:03,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:03,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189604770] [2021-12-14 23:12:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:03,471 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:03,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:03,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:03,498 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-14 23:12:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:03,538 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2021-12-14 23:12:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:03,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2021-12-14 23:12:03,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2021-12-14 23:12:03,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2021-12-14 23:12:03,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-12-14 23:12:03,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-12-14 23:12:03,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2021-12-14 23:12:03,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:03,562 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-12-14 23:12:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2021-12-14 23:12:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-14 23:12:03,626 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-14 23:12:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2021-12-14 23:12:03,628 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-12-14 23:12:03,628 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2021-12-14 23:12:03,629 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:12:03,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2021-12-14 23:12:03,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2021-12-14 23:12:03,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:03,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:03,632 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:03,632 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-14 23:12:03,632 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-14 23:12:03,632 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-14 23:12:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-14 23:12:03,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173124489] [2021-12-14 23:12:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2021-12-14 23:12:03,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588136234] [2021-12-14 23:12:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:03,704 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-14 23:12:03,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:03,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588136234] [2021-12-14 23:12:03,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588136234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:03,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:03,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:03,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609055294] [2021-12-14 23:12:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:03,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:03,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:03,709 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-14 23:12:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:03,728 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2021-12-14 23:12:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:03,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2021-12-14 23:12:03,732 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2021-12-14 23:12:03,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2021-12-14 23:12:03,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-14 23:12:03,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-14 23:12:03,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2021-12-14 23:12:03,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:03,738 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-12-14 23:12:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2021-12-14 23:12:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-14 23:12:03,747 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-14 23:12:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2021-12-14 23:12:03,749 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-12-14 23:12:03,749 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2021-12-14 23:12:03,749 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:12:03,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2021-12-14 23:12:03,752 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2021-12-14 23:12:03,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:03,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:03,754 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:03,754 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-14 23:12:03,755 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-14 23:12:03,755 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-14 23:12:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-14 23:12:03,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248772427] [2021-12-14 23:12:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,770 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2021-12-14 23:12:03,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886452966] [2021-12-14 23:12:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:03,807 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-14 23:12:03,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886452966] [2021-12-14 23:12:03,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886452966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:03,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:03,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:03,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140980267] [2021-12-14 23:12:03,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:03,810 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:03,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:03,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:03,812 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-14 23:12:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:03,838 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2021-12-14 23:12:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:03,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2021-12-14 23:12:03,841 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2021-12-14 23:12:03,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2021-12-14 23:12:03,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2021-12-14 23:12:03,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2021-12-14 23:12:03,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2021-12-14 23:12:03,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:03,849 INFO L681 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-12-14 23:12:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2021-12-14 23:12:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-12-14 23:12:03,859 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-14 23:12:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2021-12-14 23:12:03,862 INFO L704 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-12-14 23:12:03,862 INFO L587 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2021-12-14 23:12:03,862 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:12:03,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2021-12-14 23:12:03,863 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2021-12-14 23:12:03,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:03,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:03,864 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:03,864 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-14 23:12:03,865 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-14 23:12:03,865 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-14 23:12:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-14 23:12:03,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291618275] [2021-12-14 23:12:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,877 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2021-12-14 23:12:03,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846055330] [2021-12-14 23:12:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:03,894 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-14 23:12:03,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:03,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846055330] [2021-12-14 23:12:03,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846055330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:03,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:03,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:03,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443499854] [2021-12-14 23:12:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:03,896 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:03,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:03,897 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-14 23:12:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:03,906 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2021-12-14 23:12:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:03,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2021-12-14 23:12:03,909 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2021-12-14 23:12:03,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2021-12-14 23:12:03,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2021-12-14 23:12:03,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2021-12-14 23:12:03,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2021-12-14 23:12:03,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:03,913 INFO L681 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-12-14 23:12:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2021-12-14 23:12:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-12-14 23:12:03,924 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-14 23:12:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2021-12-14 23:12:03,925 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-12-14 23:12:03,925 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2021-12-14 23:12:03,925 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:12:03,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2021-12-14 23:12:03,927 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2021-12-14 23:12:03,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:03,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:03,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:03,927 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-14 23:12:03,927 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-14 23:12:03,928 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-14 23:12:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-14 23:12:03,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95037665] [2021-12-14 23:12:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:03,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2021-12-14 23:12:03,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:03,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399278100] [2021-12-14 23:12:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:03,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:03,952 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-14 23:12:03,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:03,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399278100] [2021-12-14 23:12:03,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399278100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:03,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:03,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:03,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646229350] [2021-12-14 23:12:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:03,953 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:03,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:03,954 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-14 23:12:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:03,964 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2021-12-14 23:12:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:03,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2021-12-14 23:12:03,969 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2021-12-14 23:12:03,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2021-12-14 23:12:03,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2021-12-14 23:12:03,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2021-12-14 23:12:03,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2021-12-14 23:12:04,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:04,000 INFO L681 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-12-14 23:12:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2021-12-14 23:12:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2021-12-14 23:12:04,011 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-14 23:12:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2021-12-14 23:12:04,013 INFO L704 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-12-14 23:12:04,013 INFO L587 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2021-12-14 23:12:04,013 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:12:04,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2021-12-14 23:12:04,017 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2021-12-14 23:12:04,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:04,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:04,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:04,017 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-14 23:12:04,018 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-14 23:12:04,018 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-14 23:12:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-14 23:12:04,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546799447] [2021-12-14 23:12:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2021-12-14 23:12:04,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478455257] [2021-12-14 23:12:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:12:04,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478455257] [2021-12-14 23:12:04,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478455257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:04,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:04,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:04,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069371462] [2021-12-14 23:12:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:04,043 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:04,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:04,044 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-14 23:12:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:04,056 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2021-12-14 23:12:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:04,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2021-12-14 23:12:04,074 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2021-12-14 23:12:04,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2021-12-14 23:12:04,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2021-12-14 23:12:04,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2021-12-14 23:12:04,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2021-12-14 23:12:04,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:04,094 INFO L681 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-12-14 23:12:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2021-12-14 23:12:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2021-12-14 23:12:04,114 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-14 23:12:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2021-12-14 23:12:04,119 INFO L704 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-12-14 23:12:04,119 INFO L587 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2021-12-14 23:12:04,119 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:12:04,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2021-12-14 23:12:04,125 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2021-12-14 23:12:04,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:04,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:04,126 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:04,126 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-14 23:12:04,126 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-14 23:12:04,126 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-14 23:12:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-14 23:12:04,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744904081] [2021-12-14 23:12:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2021-12-14 23:12:04,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106851479] [2021-12-14 23:12:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:04,157 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-14 23:12:04,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:04,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106851479] [2021-12-14 23:12:04,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106851479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:04,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:04,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:04,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130388622] [2021-12-14 23:12:04,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:04,158 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:04,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:04,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:04,159 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-14 23:12:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:04,178 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2021-12-14 23:12:04,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:04,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2021-12-14 23:12:04,200 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2021-12-14 23:12:04,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2021-12-14 23:12:04,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2021-12-14 23:12:04,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2021-12-14 23:12:04,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2021-12-14 23:12:04,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:04,223 INFO L681 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-12-14 23:12:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2021-12-14 23:12:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2021-12-14 23:12:04,267 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-14 23:12:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2021-12-14 23:12:04,275 INFO L704 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-12-14 23:12:04,275 INFO L587 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2021-12-14 23:12:04,275 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:12:04,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2021-12-14 23:12:04,296 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2021-12-14 23:12:04,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:04,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:04,297 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:04,297 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-14 23:12:04,297 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-14 23:12:04,297 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-14 23:12:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-14 23:12:04,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691220903] [2021-12-14 23:12:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,304 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2021-12-14 23:12:04,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450995564] [2021-12-14 23:12:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:04,316 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-14 23:12:04,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450995564] [2021-12-14 23:12:04,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450995564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:04,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:04,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:04,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158345655] [2021-12-14 23:12:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:04,318 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:04,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:04,318 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-14 23:12:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:04,345 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2021-12-14 23:12:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:04,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2021-12-14 23:12:04,381 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2021-12-14 23:12:04,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2021-12-14 23:12:04,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2021-12-14 23:12:04,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2021-12-14 23:12:04,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2021-12-14 23:12:04,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:04,426 INFO L681 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-12-14 23:12:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2021-12-14 23:12:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2021-12-14 23:12:04,527 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-14 23:12:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2021-12-14 23:12:04,545 INFO L704 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-12-14 23:12:04,545 INFO L587 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2021-12-14 23:12:04,546 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:12:04,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2021-12-14 23:12:04,568 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2021-12-14 23:12:04,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:04,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:04,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:04,569 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-14 23:12:04,569 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-14 23:12:04,569 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-14 23:12:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,569 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-14 23:12:04,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342886688] [2021-12-14 23:12:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:04,587 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2021-12-14 23:12:04,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942153841] [2021-12-14 23:12:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:04,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:04,614 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-14 23:12:04,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942153841] [2021-12-14 23:12:04,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942153841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:04,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:04,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:12:04,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514644824] [2021-12-14 23:12:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:04,617 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:04,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:04,618 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-14 23:12:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:04,732 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2021-12-14 23:12:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:04,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2021-12-14 23:12:04,850 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2021-12-14 23:12:04,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2021-12-14 23:12:04,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2021-12-14 23:12:04,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2021-12-14 23:12:04,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2021-12-14 23:12:04,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:04,970 INFO L681 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-12-14 23:12:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2021-12-14 23:12:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2021-12-14 23:12:05,192 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-14 23:12:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2021-12-14 23:12:05,214 INFO L704 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-12-14 23:12:05,214 INFO L587 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2021-12-14 23:12:05,214 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:12:05,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2021-12-14 23:12:05,295 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2021-12-14 23:12:05,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:05,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:05,296 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:05,296 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-14 23:12:05,296 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-14 23:12:05,296 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-14 23:12:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-14 23:12:05,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:05,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320089359] [2021-12-14 23:12:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:05,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:05,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:05,301 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2021-12-14 23:12:05,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:05,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155939273] [2021-12-14 23:12:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:05,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:05,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:05,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2021-12-14 23:12:05,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:05,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780879741] [2021-12-14 23:12:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:05,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:05,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:05,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:05,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:12:05 BoogieIcfgContainer [2021-12-14 23:12:05,513 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:12:05,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:12:05,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:12:05,513 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:12:05,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:03" (3/4) ... [2021-12-14 23:12:05,515 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-14 23:12:05,539 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 23:12:05,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:12:05,540 INFO L158 Benchmark]: Toolchain (without parser) took 2970.23ms. Allocated memory was 100.7MB in the beginning and 230.7MB in the end (delta: 130.0MB). Free memory was 71.9MB in the beginning and 89.5MB in the end (delta: -17.6MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,540 INFO L158 Benchmark]: CDTParser took 11.52ms. Allocated memory is still 83.9MB. Free memory was 40.4MB in the beginning and 40.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:12:05,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.26ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 76.7MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.88ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,541 INFO L158 Benchmark]: Boogie Preprocessor took 35.41ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,542 INFO L158 Benchmark]: RCFGBuilder took 249.05ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 62.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,542 INFO L158 Benchmark]: BuchiAutomizer took 2360.87ms. Allocated memory was 100.7MB in the beginning and 230.7MB in the end (delta: 130.0MB). Free memory was 62.5MB in the beginning and 92.6MB in the end (delta: -30.1MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,542 INFO L158 Benchmark]: Witness Printer took 26.71ms. Allocated memory is still 230.7MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:05,543 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 11.52ms. Allocated memory is still 83.9MB. Free memory was 40.4MB in the beginning and 40.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.26ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 76.7MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.88ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.41ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 249.05ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 62.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2360.87ms. Allocated memory was 100.7MB in the beginning and 230.7MB in the end (delta: 130.0MB). Free memory was 62.5MB in the beginning and 92.6MB in the end (delta: -30.1MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * Witness Printer took 26.71ms. Allocated memory is still 230.7MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 14082 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1167 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 722 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {lk5=0, p1=0, NULL=0, p9=0, lk9=0, NULL=1, cond=4, p5=0, p10=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@624d530c=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b05a50d=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@674aa61c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50056556=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@285346c0=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d6eb804=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dc560ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@518974d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44c6bf85=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7691849b=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74d32afc=4} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-14 23:12:05,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)