./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:57,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:57,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:57,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:57,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:57,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:57,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:57,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:57,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:57,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:57,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:57,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:57,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:57,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:57,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:57,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:57,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:57,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:57,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:57,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:57,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:57,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:57,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:57,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:57,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:57,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:57,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:57,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:57,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:57,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:57,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:57,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:57,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:57,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:57,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:57,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:57,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:57,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:57,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:57,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:57,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:57,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:57,839 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:57,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:57,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:57,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:57,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:57,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:57,842 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:57,842 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:57,842 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:57,842 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:57,843 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:57,843 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:57,843 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:57,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:57,843 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:57,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:57,845 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:57,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:57,846 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:57,846 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:57,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:57,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:57,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:57,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:57,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:57,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:57,848 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:57,848 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2021-12-15 17:06:58,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:58,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:58,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:58,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:58,062 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:58,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2021-12-15 17:06:58,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956c15624/32be8c88ab284d50941ef4f1d79e314c/FLAGd17886107 [2021-12-15 17:06:58,487 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:58,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2021-12-15 17:06:58,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956c15624/32be8c88ab284d50941ef4f1d79e314c/FLAGd17886107 [2021-12-15 17:06:58,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956c15624/32be8c88ab284d50941ef4f1d79e314c [2021-12-15 17:06:58,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:58,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:58,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:58,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:58,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:58,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:58" (1/1) ... [2021-12-15 17:06:58,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224505d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:58, skipping insertion in model container [2021-12-15 17:06:58,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:58" (1/1) ... [2021-12-15 17:06:58,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:58,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:59,068 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_14-1.c[5283,5296] [2021-12-15 17:06:59,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:59,077 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:59,096 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_14-1.c[5283,5296] [2021-12-15 17:06:59,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:59,106 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:59,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59 WrapperNode [2021-12-15 17:06:59,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:59,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:59,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:59,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:59,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,144 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 167 [2021-12-15 17:06:59,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:59,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:59,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:59,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:59,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:59,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:59,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:59,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:59,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (1/1) ... [2021-12-15 17:06:59,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:59,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:06:59,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:06:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:59,330 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:59,331 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:59,519 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:59,523 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:59,524 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:06:59,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:59 BoogieIcfgContainer [2021-12-15 17:06:59,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:59,526 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:59,526 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:59,528 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:59,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:59,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:58" (1/3) ... [2021-12-15 17:06:59,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2123ff63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:59, skipping insertion in model container [2021-12-15 17:06:59,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:59,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:59" (2/3) ... [2021-12-15 17:06:59,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2123ff63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:59, skipping insertion in model container [2021-12-15 17:06:59,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:59,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:59" (3/3) ... [2021-12-15 17:06:59,532 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2021-12-15 17:06:59,560 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:59,560 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:59,560 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:59,561 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:59,561 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:59,561 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:59,561 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:59,561 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:59,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:59,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-15 17:06:59,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,617 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:59,618 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:59,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:59,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-15 17:06:59,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,628 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,628 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:59,636 INFO L791 eck$LassoCheckResult]: Stem: 42#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(18, 2);call #Ultimate.allocInit(12, 3); 35#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 37#L211-1true [2021-12-15 17:06:59,638 INFO L793 eck$LassoCheckResult]: Loop: 37#L211-1true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 46#L55true 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 22#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 12#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33#L92-1true assume !(0 != main_~p3~0#1); 4#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 7#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 49#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 52#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 26#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 40#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L124-1true assume !(0 != main_~p11~0#1); 16#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 47#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 43#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 39#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume !(0 != main_~p2~0#1); 31#L151-1true assume !(0 != main_~p3~0#1); 29#L156-1true assume !(0 != main_~p4~0#1); 5#L161-1true assume !(0 != main_~p5~0#1); 11#L166-1true assume !(0 != main_~p6~0#1); 24#L171-1true assume !(0 != main_~p7~0#1); 20#L176-1true assume !(0 != main_~p8~0#1); 50#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 38#L191-1true assume !(0 != main_~p11~0#1); 51#L196-1true assume !(0 != main_~p12~0#1); 25#L201-1true assume !(0 != main_~p13~0#1); 14#L206-1true assume !(0 != main_~p14~0#1); 37#L211-1true [2021-12-15 17:06:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:06:59,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174149003] [2021-12-15 17:06:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,824 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2021-12-15 17:06:59,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122419800] [2021-12-15 17:06:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122419800] [2021-12-15 17:06:59,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122419800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:59,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872845811] [2021-12-15 17:06:59,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,939 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,968 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,014 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2021-12-15 17:07:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2021-12-15 17:07:00,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-12-15 17:07:00,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2021-12-15 17:07:00,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-12-15 17:07:00,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-12-15 17:07:00,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2021-12-15 17:07:00,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,037 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-12-15 17:07:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2021-12-15 17:07:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-15 17:07:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2021-12-15 17:07:00,065 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-12-15 17:07:00,065 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-12-15 17:07:00,065 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:07:00,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2021-12-15 17:07:00,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-12-15 17:07:00,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,071 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,071 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,071 INFO L791 eck$LassoCheckResult]: Stem: 190#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(18, 2);call #Ultimate.allocInit(12, 3); 174#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 168#L211-1 [2021-12-15 17:07:00,071 INFO L793 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 179#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 202#L88 assume !(0 != main_~p1~0#1); 221#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 220#L92-1 assume !(0 != main_~p3~0#1); 219#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 218#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 208#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 192#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 213#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 211#L140-1 assume !(0 != main_~p1~0#1); 212#L146-1 assume !(0 != main_~p2~0#1); 246#L151-1 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 207#L181-1 assume !(0 != main_~p9~0#1); 194#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 189#L201-1 assume !(0 != main_~p13~0#1); 166#L206-1 assume !(0 != main_~p14~0#1); 168#L211-1 [2021-12-15 17:07:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:07:00,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636267984] [2021-12-15 17:07:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,109 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2021-12-15 17:07:00,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528693072] [2021-12-15 17:07:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528693072] [2021-12-15 17:07:00,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528693072] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683697307] [2021-12-15 17:07:00,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,174 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,175 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,197 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2021-12-15 17:07:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2021-12-15 17:07:00,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-12-15 17:07:00,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2021-12-15 17:07:00,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-12-15 17:07:00,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-12-15 17:07:00,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2021-12-15 17:07:00,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,208 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-12-15 17:07:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2021-12-15 17:07:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-12-15 17:07:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2021-12-15 17:07:00,220 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-12-15 17:07:00,220 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-12-15 17:07:00,221 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:07:00,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2021-12-15 17:07:00,221 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-12-15 17:07:00,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,223 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,223 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,223 INFO L791 eck$LassoCheckResult]: Stem: 465#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(18, 2);call #Ultimate.allocInit(12, 3); 444#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 445#L211-1 [2021-12-15 17:07:00,223 INFO L793 eck$LassoCheckResult]: Loop: 445#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 527#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 525#L88 assume !(0 != main_~p1~0#1); 522#L88-2 assume !(0 != main_~p2~0#1); 517#L92-1 assume !(0 != main_~p3~0#1); 516#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 512#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 511#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 510#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 509#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 508#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 507#L124-1 assume !(0 != main_~p11~0#1); 506#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 505#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 499#L146-1 assume !(0 != main_~p2~0#1); 501#L151-1 assume !(0 != main_~p3~0#1); 550#L156-1 assume !(0 != main_~p4~0#1); 548#L161-1 assume !(0 != main_~p5~0#1); 546#L166-1 assume !(0 != main_~p6~0#1); 543#L171-1 assume !(0 != main_~p7~0#1); 542#L176-1 assume !(0 != main_~p8~0#1); 540#L181-1 assume !(0 != main_~p9~0#1); 537#L186-1 assume !(0 != main_~p10~0#1); 536#L191-1 assume !(0 != main_~p11~0#1); 534#L196-1 assume !(0 != main_~p12~0#1); 532#L201-1 assume !(0 != main_~p13~0#1); 530#L206-1 assume !(0 != main_~p14~0#1); 445#L211-1 [2021-12-15 17:07:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:07:00,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019941399] [2021-12-15 17:07:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2021-12-15 17:07:00,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806279024] [2021-12-15 17:07:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806279024] [2021-12-15 17:07:00,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806279024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670475823] [2021-12-15 17:07:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,280 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,280 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,308 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2021-12-15 17:07:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2021-12-15 17:07:00,310 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-12-15 17:07:00,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2021-12-15 17:07:00,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2021-12-15 17:07:00,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2021-12-15 17:07:00,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2021-12-15 17:07:00,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,314 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-12-15 17:07:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2021-12-15 17:07:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-12-15 17:07:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2021-12-15 17:07:00,335 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-12-15 17:07:00,336 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-12-15 17:07:00,336 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:07:00,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2021-12-15 17:07:00,337 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-12-15 17:07:00,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,338 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,338 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,338 INFO L791 eck$LassoCheckResult]: Stem: 983#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(18, 2);call #Ultimate.allocInit(12, 3); 967#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 968#L211-1 [2021-12-15 17:07:00,338 INFO L793 eck$LassoCheckResult]: Loop: 968#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1027#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1022#L88 assume !(0 != main_~p1~0#1); 1023#L88-2 assume !(0 != main_~p2~0#1); 1152#L92-1 assume !(0 != main_~p3~0#1); 1149#L96-1 assume !(0 != main_~p4~0#1); 1147#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1145#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1143#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1141#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1137#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1135#L124-1 assume !(0 != main_~p11~0#1); 1133#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1131#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1129#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1125#L140-1 assume !(0 != main_~p1~0#1); 1123#L146-1 assume !(0 != main_~p2~0#1); 1121#L151-1 assume !(0 != main_~p3~0#1); 1116#L156-1 assume !(0 != main_~p4~0#1); 1114#L161-1 assume !(0 != main_~p5~0#1); 1108#L166-1 assume !(0 != main_~p6~0#1); 1103#L171-1 assume !(0 != main_~p7~0#1); 1100#L176-1 assume !(0 != main_~p8~0#1); 1098#L181-1 assume !(0 != main_~p9~0#1); 1095#L186-1 assume !(0 != main_~p10~0#1); 1092#L191-1 assume !(0 != main_~p11~0#1); 1088#L196-1 assume !(0 != main_~p12~0#1); 1068#L201-1 assume !(0 != main_~p13~0#1); 1038#L206-1 assume !(0 != main_~p14~0#1); 968#L211-1 [2021-12-15 17:07:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:07:00,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805878200] [2021-12-15 17:07:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,353 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2021-12-15 17:07:00,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112490469] [2021-12-15 17:07:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112490469] [2021-12-15 17:07:00,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112490469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008097374] [2021-12-15 17:07:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,380 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,381 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,391 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2021-12-15 17:07:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2021-12-15 17:07:00,396 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-12-15 17:07:00,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2021-12-15 17:07:00,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2021-12-15 17:07:00,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2021-12-15 17:07:00,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2021-12-15 17:07:00,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,402 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-12-15 17:07:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2021-12-15 17:07:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-12-15 17:07:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2021-12-15 17:07:00,428 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-12-15 17:07:00,428 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-12-15 17:07:00,428 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:07:00,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2021-12-15 17:07:00,430 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-12-15 17:07:00,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,431 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,431 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,431 INFO L791 eck$LassoCheckResult]: Stem: 2005#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(18, 2);call #Ultimate.allocInit(12, 3); 1986#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1987#L211-1 [2021-12-15 17:07:00,432 INFO L793 eck$LassoCheckResult]: Loop: 1987#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2105#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2103#L88 assume !(0 != main_~p1~0#1); 2104#L88-2 assume !(0 != main_~p2~0#1); 2147#L92-1 assume !(0 != main_~p3~0#1); 2145#L96-1 assume !(0 != main_~p4~0#1); 2143#L100-1 assume !(0 != main_~p5~0#1); 2142#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2141#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2138#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2137#L124-1 assume !(0 != main_~p11~0#1); 2136#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2135#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2134#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2132#L140-1 assume !(0 != main_~p1~0#1); 2130#L146-1 assume !(0 != main_~p2~0#1); 2129#L151-1 assume !(0 != main_~p3~0#1); 2126#L156-1 assume !(0 != main_~p4~0#1); 2124#L161-1 assume !(0 != main_~p5~0#1); 2123#L166-1 assume !(0 != main_~p6~0#1); 2120#L171-1 assume !(0 != main_~p7~0#1); 2119#L176-1 assume !(0 != main_~p8~0#1); 2117#L181-1 assume !(0 != main_~p9~0#1); 2114#L186-1 assume !(0 != main_~p10~0#1); 2113#L191-1 assume !(0 != main_~p11~0#1); 2111#L196-1 assume !(0 != main_~p12~0#1); 2109#L201-1 assume !(0 != main_~p13~0#1); 2107#L206-1 assume !(0 != main_~p14~0#1); 1987#L211-1 [2021-12-15 17:07:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:07:00,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438438833] [2021-12-15 17:07:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2021-12-15 17:07:00,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666039438] [2021-12-15 17:07:00,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,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-15 17:07:00,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666039438] [2021-12-15 17:07:00,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666039438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961533714] [2021-12-15 17:07:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,469 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,470 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,489 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2021-12-15 17:07:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2021-12-15 17:07:00,496 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-12-15 17:07:00,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-12-15 17:07:00,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-12-15 17:07:00,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-12-15 17:07:00,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2021-12-15 17:07:00,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,523 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-12-15 17:07:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2021-12-15 17:07:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-12-15 17:07:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-12-15 17:07:00,545 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-12-15 17:07:00,545 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-12-15 17:07:00,545 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:07:00,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2021-12-15 17:07:00,549 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-12-15 17:07:00,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,550 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,550 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,550 INFO L791 eck$LassoCheckResult]: Stem: 4017#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(18, 2);call #Ultimate.allocInit(12, 3); 3996#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3997#L211-1 [2021-12-15 17:07:00,550 INFO L793 eck$LassoCheckResult]: Loop: 3997#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4074#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4061#L88 assume !(0 != main_~p1~0#1); 4054#L88-2 assume !(0 != main_~p2~0#1); 4055#L92-1 assume !(0 != main_~p3~0#1); 4048#L96-1 assume !(0 != main_~p4~0#1); 4050#L100-1 assume !(0 != main_~p5~0#1); 4187#L104-1 assume !(0 != main_~p6~0#1); 4189#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4179#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4180#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4171#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4172#L124-1 assume !(0 != main_~p11~0#1); 4163#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4164#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4155#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4156#L140-1 assume !(0 != main_~p1~0#1); 4355#L146-1 assume !(0 != main_~p2~0#1); 4353#L151-1 assume !(0 != main_~p3~0#1); 4348#L156-1 assume !(0 != main_~p4~0#1); 4346#L161-1 assume !(0 != main_~p5~0#1); 4345#L166-1 assume !(0 != main_~p6~0#1); 4342#L171-1 assume !(0 != main_~p7~0#1); 4341#L176-1 assume !(0 != main_~p8~0#1); 4338#L181-1 assume !(0 != main_~p9~0#1); 4335#L186-1 assume !(0 != main_~p10~0#1); 4317#L191-1 assume !(0 != main_~p11~0#1); 4289#L196-1 assume !(0 != main_~p12~0#1); 4288#L201-1 assume !(0 != main_~p13~0#1); 4292#L206-1 assume !(0 != main_~p14~0#1); 3997#L211-1 [2021-12-15 17:07:00,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:07:00,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618587242] [2021-12-15 17:07:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,559 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,574 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2021-12-15 17:07:00,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239049945] [2021-12-15 17:07:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239049945] [2021-12-15 17:07:00,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239049945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869586889] [2021-12-15 17:07:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,594 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,595 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,615 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2021-12-15 17:07:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2021-12-15 17:07:00,638 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-12-15 17:07:00,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-12-15 17:07:00,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-12-15 17:07:00,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-12-15 17:07:00,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2021-12-15 17:07:00,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,672 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-12-15 17:07:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2021-12-15 17:07:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-12-15 17:07:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-12-15 17:07:00,710 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-12-15 17:07:00,710 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-12-15 17:07:00,710 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:07:00,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2021-12-15 17:07:00,720 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-12-15 17:07:00,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,721 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,721 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,721 INFO L791 eck$LassoCheckResult]: Stem: 7974#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(18, 2);call #Ultimate.allocInit(12, 3); 7958#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7959#L211-1 [2021-12-15 17:07:00,721 INFO L793 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8097#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8093#L88 assume !(0 != main_~p1~0#1); 8086#L88-2 assume !(0 != main_~p2~0#1); 8081#L92-1 assume !(0 != main_~p3~0#1); 8074#L96-1 assume !(0 != main_~p4~0#1); 8066#L100-1 assume !(0 != main_~p5~0#1); 8058#L104-1 assume !(0 != main_~p6~0#1); 8052#L108-1 assume !(0 != main_~p7~0#1); 8047#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8048#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8041#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8042#L124-1 assume !(0 != main_~p11~0#1); 8035#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8036#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8028#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8029#L140-1 assume !(0 != main_~p1~0#1); 8194#L146-1 assume !(0 != main_~p2~0#1); 8174#L151-1 assume !(0 != main_~p3~0#1); 8168#L156-1 assume !(0 != main_~p4~0#1); 8163#L161-1 assume !(0 != main_~p5~0#1); 8159#L166-1 assume !(0 != main_~p6~0#1); 8157#L171-1 assume !(0 != main_~p7~0#1); 8156#L176-1 assume !(0 != main_~p8~0#1); 8154#L181-1 assume !(0 != main_~p9~0#1); 8141#L186-1 assume !(0 != main_~p10~0#1); 8122#L191-1 assume !(0 != main_~p11~0#1); 8118#L196-1 assume !(0 != main_~p12~0#1); 8116#L201-1 assume !(0 != main_~p13~0#1); 8106#L206-1 assume !(0 != main_~p14~0#1); 7959#L211-1 [2021-12-15 17:07:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-15 17:07:00,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932763825] [2021-12-15 17:07:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:00,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2021-12-15 17:07:00,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460323015] [2021-12-15 17:07:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:00,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:00,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:00,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460323015] [2021-12-15 17:07:00,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460323015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:00,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:00,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:00,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185307822] [2021-12-15 17:07:00,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:00,748 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:00,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:00,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:00,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:00,749 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,771 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2021-12-15 17:07:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2021-12-15 17:07:00,830 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-12-15 17:07:00,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-12-15 17:07:00,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2021-12-15 17:07:00,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2021-12-15 17:07:00,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2021-12-15 17:07:00,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,859 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-12-15 17:07:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2021-12-15 17:07:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2021-12-15 17:07:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-12-15 17:07:00,935 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-12-15 17:07:00,935 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-12-15 17:07:00,935 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:07:00,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2021-12-15 17:07:00,998 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-12-15 17:07:00,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:00,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:00,998 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:00,998 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:00,999 INFO L791 eck$LassoCheckResult]: Stem: 15796#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(18, 2);call #Ultimate.allocInit(12, 3); 15777#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15778#L211-1 [2021-12-15 17:07:00,999 INFO L793 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16332#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16329#L88 assume !(0 != main_~p1~0#1); 16326#L88-2 assume !(0 != main_~p2~0#1); 16324#L92-1 assume !(0 != main_~p3~0#1); 16321#L96-1 assume !(0 != main_~p4~0#1); 16317#L100-1 assume !(0 != main_~p5~0#1); 16314#L104-1 assume !(0 != main_~p6~0#1); 16311#L108-1 assume !(0 != main_~p7~0#1); 16140#L112-1 assume !(0 != main_~p8~0#1); 16142#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16090#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16091#L124-1 assume !(0 != main_~p11~0#1); 16082#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16083#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16481#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16477#L140-1 assume !(0 != main_~p1~0#1); 16066#L146-1 assume !(0 != main_~p2~0#1); 16068#L151-1 assume !(0 != main_~p3~0#1); 16057#L156-1 assume !(0 != main_~p4~0#1); 16059#L161-1 assume !(0 != main_~p5~0#1); 16363#L166-1 assume !(0 != main_~p6~0#1); 16361#L171-1 assume !(0 != main_~p7~0#1); 16359#L176-1 assume !(0 != main_~p8~0#1); 16357#L181-1 assume !(0 != main_~p9~0#1); 16352#L186-1 assume !(0 != main_~p10~0#1); 16349#L191-1 assume !(0 != main_~p11~0#1); 16345#L196-1 assume !(0 != main_~p12~0#1); 16341#L201-1 assume !(0 != main_~p13~0#1); 16337#L206-1 assume !(0 != main_~p14~0#1); 15778#L211-1 [2021-12-15 17:07:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-15 17:07:00,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:00,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186724482] [2021-12-15 17:07:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,006 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2021-12-15 17:07:01,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976761564] [2021-12-15 17:07:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976761564] [2021-12-15 17:07:01,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976761564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:01,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488345256] [2021-12-15 17:07:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,053 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,054 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:01,124 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2021-12-15 17:07:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:01,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2021-12-15 17:07:01,243 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-12-15 17:07:01,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-12-15 17:07:01,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2021-12-15 17:07:01,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2021-12-15 17:07:01,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2021-12-15 17:07:01,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:01,371 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-12-15 17:07:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2021-12-15 17:07:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2021-12-15 17:07:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-12-15 17:07:01,574 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-12-15 17:07:01,574 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-12-15 17:07:01,574 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:07:01,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2021-12-15 17:07:01,642 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-12-15 17:07:01,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,643 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,643 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:01,644 INFO L791 eck$LassoCheckResult]: Stem: 31228#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(18, 2);call #Ultimate.allocInit(12, 3); 31211#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31212#L211-1 [2021-12-15 17:07:01,645 INFO L793 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31931#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31927#L88 assume !(0 != main_~p1~0#1); 31923#L88-2 assume !(0 != main_~p2~0#1); 31921#L92-1 assume !(0 != main_~p3~0#1); 31917#L96-1 assume !(0 != main_~p4~0#1); 31913#L100-1 assume !(0 != main_~p5~0#1); 31910#L104-1 assume !(0 != main_~p6~0#1); 31911#L108-1 assume !(0 != main_~p7~0#1); 31996#L112-1 assume !(0 != main_~p8~0#1); 31993#L116-1 assume !(0 != main_~p9~0#1); 31991#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 31989#L124-1 assume !(0 != main_~p11~0#1); 31987#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31985#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31982#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31978#L140-1 assume !(0 != main_~p1~0#1); 31974#L146-1 assume !(0 != main_~p2~0#1); 31972#L151-1 assume !(0 != main_~p3~0#1); 31968#L156-1 assume !(0 != main_~p4~0#1); 31965#L161-1 assume !(0 != main_~p5~0#1); 31964#L166-1 assume !(0 != main_~p6~0#1); 31962#L171-1 assume !(0 != main_~p7~0#1); 31958#L176-1 assume !(0 != main_~p8~0#1); 31954#L181-1 assume !(0 != main_~p9~0#1); 31950#L186-1 assume !(0 != main_~p10~0#1); 31947#L191-1 assume !(0 != main_~p11~0#1); 31943#L196-1 assume !(0 != main_~p12~0#1); 31939#L201-1 assume !(0 != main_~p13~0#1); 31935#L206-1 assume !(0 != main_~p14~0#1); 31212#L211-1 [2021-12-15 17:07:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-15 17:07:01,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153157004] [2021-12-15 17:07:01,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2021-12-15 17:07:01,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466407297] [2021-12-15 17:07:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:01,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:01,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466407297] [2021-12-15 17:07:01,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466407297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:01,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:01,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:01,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202589396] [2021-12-15 17:07:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:01,693 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:01,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:01,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:01,694 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:01,756 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2021-12-15 17:07:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:01,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2021-12-15 17:07:01,904 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-12-15 17:07:01,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-12-15 17:07:01,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2021-12-15 17:07:01,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2021-12-15 17:07:01,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2021-12-15 17:07:01,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:01,987 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-12-15 17:07:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2021-12-15 17:07:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2021-12-15 17:07:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-12-15 17:07:02,425 INFO L704 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-12-15 17:07:02,426 INFO L587 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-12-15 17:07:02,426 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:07:02,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2021-12-15 17:07:02,523 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-12-15 17:07:02,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:02,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:02,524 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:02,524 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:02,525 INFO L791 eck$LassoCheckResult]: Stem: 61703#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(18, 2);call #Ultimate.allocInit(12, 3); 61684#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61685#L211-1 [2021-12-15 17:07:02,525 INFO L793 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62023#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62020#L88 assume !(0 != main_~p1~0#1); 62016#L88-2 assume !(0 != main_~p2~0#1); 62013#L92-1 assume !(0 != main_~p3~0#1); 62010#L96-1 assume !(0 != main_~p4~0#1); 62006#L100-1 assume !(0 != main_~p5~0#1); 62002#L104-1 assume !(0 != main_~p6~0#1); 61995#L108-1 assume !(0 != main_~p7~0#1); 61996#L112-1 assume !(0 != main_~p8~0#1); 62085#L116-1 assume !(0 != main_~p9~0#1); 62081#L120-1 assume !(0 != main_~p10~0#1); 62079#L124-1 assume !(0 != main_~p11~0#1); 62077#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 62075#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62073#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62069#L140-1 assume !(0 != main_~p1~0#1); 62065#L146-1 assume !(0 != main_~p2~0#1); 62062#L151-1 assume !(0 != main_~p3~0#1); 62057#L156-1 assume !(0 != main_~p4~0#1); 62053#L161-1 assume !(0 != main_~p5~0#1); 62049#L166-1 assume !(0 != main_~p6~0#1); 62047#L171-1 assume !(0 != main_~p7~0#1); 62045#L176-1 assume !(0 != main_~p8~0#1); 62043#L181-1 assume !(0 != main_~p9~0#1); 62041#L186-1 assume !(0 != main_~p10~0#1); 62040#L191-1 assume !(0 != main_~p11~0#1); 62036#L196-1 assume !(0 != main_~p12~0#1); 62032#L201-1 assume !(0 != main_~p13~0#1); 62028#L206-1 assume !(0 != main_~p14~0#1); 61685#L211-1 [2021-12-15 17:07:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-15 17:07:02,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:02,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249463026] [2021-12-15 17:07:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:02,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:02,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:02,531 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2021-12-15 17:07:02,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:02,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222734783] [2021-12-15 17:07:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:02,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:02,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222734783] [2021-12-15 17:07:02,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222734783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:02,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:02,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:02,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324546291] [2021-12-15 17:07:02,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:02,547 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:02,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:02,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:02,547 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:02,780 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2021-12-15 17:07:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:02,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2021-12-15 17:07:02,944 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-12-15 17:07:03,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-12-15 17:07:03,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2021-12-15 17:07:03,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2021-12-15 17:07:03,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2021-12-15 17:07:03,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:03,184 INFO L681 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-12-15 17:07:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2021-12-15 17:07:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2021-12-15 17:07:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-12-15 17:07:03,799 INFO L704 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-12-15 17:07:03,799 INFO L587 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-12-15 17:07:03,799 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:07:03,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2021-12-15 17:07:03,919 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-12-15 17:07:03,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:03,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:03,920 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:03,921 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:03,921 INFO L791 eck$LassoCheckResult]: Stem: 121875#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(18, 2);call #Ultimate.allocInit(12, 3); 121856#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121857#L211-1 [2021-12-15 17:07:03,921 INFO L793 eck$LassoCheckResult]: Loop: 121857#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122012#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122010#L88 assume !(0 != main_~p1~0#1); 122006#L88-2 assume !(0 != main_~p2~0#1); 122004#L92-1 assume !(0 != main_~p3~0#1); 122000#L96-1 assume !(0 != main_~p4~0#1); 121996#L100-1 assume !(0 != main_~p5~0#1); 121992#L104-1 assume !(0 != main_~p6~0#1); 121988#L108-1 assume !(0 != main_~p7~0#1); 121984#L112-1 assume !(0 != main_~p8~0#1); 121980#L116-1 assume !(0 != main_~p9~0#1); 121976#L120-1 assume !(0 != main_~p10~0#1); 121974#L124-1 assume !(0 != main_~p11~0#1); 121970#L128-1 assume !(0 != main_~p12~0#1); 121968#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 121966#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121963#L140-1 assume !(0 != main_~p1~0#1); 121964#L146-1 assume !(0 != main_~p2~0#1); 122060#L151-1 assume !(0 != main_~p3~0#1); 122055#L156-1 assume !(0 != main_~p4~0#1); 122051#L161-1 assume !(0 != main_~p5~0#1); 122047#L166-1 assume !(0 != main_~p6~0#1); 122043#L171-1 assume !(0 != main_~p7~0#1); 122039#L176-1 assume !(0 != main_~p8~0#1); 122035#L181-1 assume !(0 != main_~p9~0#1); 122031#L186-1 assume !(0 != main_~p10~0#1); 122028#L191-1 assume !(0 != main_~p11~0#1); 122023#L196-1 assume !(0 != main_~p12~0#1); 122020#L201-1 assume !(0 != main_~p13~0#1); 122016#L206-1 assume !(0 != main_~p14~0#1); 121857#L211-1 [2021-12-15 17:07:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-15 17:07:03,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874710207] [2021-12-15 17:07:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:03,928 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:03,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2021-12-15 17:07:03,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:03,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035631877] [2021-12-15 17:07:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:03,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:03,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:03,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035631877] [2021-12-15 17:07:03,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035631877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:03,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:03,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:07:03,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273903808] [2021-12-15 17:07:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:03,943 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:03,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:03,944 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:04,253 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2021-12-15 17:07:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:04,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2021-12-15 17:07:04,542 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-12-15 17:07:04,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-12-15 17:07:04,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2021-12-15 17:07:04,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2021-12-15 17:07:04,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2021-12-15 17:07:04,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:04,996 INFO L681 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-12-15 17:07:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2021-12-15 17:07:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2021-12-15 17:07:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-12-15 17:07:06,137 INFO L704 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-12-15 17:07:06,137 INFO L587 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-12-15 17:07:06,138 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:07:06,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2021-12-15 17:07:06,643 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-12-15 17:07:06,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:06,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:06,646 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:06,646 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:06,646 INFO L791 eck$LassoCheckResult]: Stem: 240669#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(18, 2);call #Ultimate.allocInit(12, 3); 240648#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 240649#L211-1 [2021-12-15 17:07:06,647 INFO L793 eck$LassoCheckResult]: Loop: 240649#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 241123#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 241119#L88 assume !(0 != main_~p1~0#1); 241113#L88-2 assume !(0 != main_~p2~0#1); 241108#L92-1 assume !(0 != main_~p3~0#1); 241104#L96-1 assume !(0 != main_~p4~0#1); 241098#L100-1 assume !(0 != main_~p5~0#1); 241068#L104-1 assume !(0 != main_~p6~0#1); 241070#L108-1 assume !(0 != main_~p7~0#1); 241092#L112-1 assume !(0 != main_~p8~0#1); 241206#L116-1 assume !(0 != main_~p9~0#1); 241203#L120-1 assume !(0 != main_~p10~0#1); 241200#L124-1 assume !(0 != main_~p11~0#1); 241197#L128-1 assume !(0 != main_~p12~0#1); 241193#L132-1 assume !(0 != main_~p13~0#1); 241194#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 241224#L140-1 assume !(0 != main_~p1~0#1); 241222#L146-1 assume !(0 != main_~p2~0#1); 241221#L151-1 assume !(0 != main_~p3~0#1); 241218#L156-1 assume !(0 != main_~p4~0#1); 241216#L161-1 assume !(0 != main_~p5~0#1); 241214#L166-1 assume !(0 != main_~p6~0#1); 241007#L171-1 assume !(0 != main_~p7~0#1); 241002#L176-1 assume !(0 != main_~p8~0#1); 240997#L181-1 assume !(0 != main_~p9~0#1); 240992#L186-1 assume !(0 != main_~p10~0#1); 240993#L191-1 assume !(0 != main_~p11~0#1); 240982#L196-1 assume !(0 != main_~p12~0#1); 240984#L201-1 assume !(0 != main_~p13~0#1); 241131#L206-1 assume !(0 != main_~p14~0#1); 240649#L211-1 [2021-12-15 17:07:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-12-15 17:07:06,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:06,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668702305] [2021-12-15 17:07:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:06,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:06,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:06,695 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2021-12-15 17:07:06,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569500693] [2021-12-15 17:07:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:06,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:07:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:07:06,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:07:06,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569500693] [2021-12-15 17:07:06,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569500693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:07:06,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:07:06,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:07:06,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074613105] [2021-12-15 17:07:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:07:06,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:07:06,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:07:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:07:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:07:06,708 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:07,532 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2021-12-15 17:07:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:07,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2021-12-15 17:07:08,447 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-12-15 17:07:09,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-12-15 17:07:09,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2021-12-15 17:07:09,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2021-12-15 17:07:09,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2021-12-15 17:07:09,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:09,227 INFO L681 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-12-15 17:07:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2021-12-15 17:07:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2021-12-15 17:07:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:07:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-12-15 17:07:11,740 INFO L704 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-12-15 17:07:11,740 INFO L587 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-12-15 17:07:11,740 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:07:11,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2021-12-15 17:07:12,151 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-12-15 17:07:12,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:12,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:12,153 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:12,153 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:07:12,153 INFO L791 eck$LassoCheckResult]: Stem: 475174#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(18, 2);call #Ultimate.allocInit(12, 3); 475155#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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~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;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 475156#L211-1 [2021-12-15 17:07:12,154 INFO L793 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 476630#L55 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 476626#L88 assume !(0 != main_~p1~0#1); 476622#L88-2 assume !(0 != main_~p2~0#1); 476620#L92-1 assume !(0 != main_~p3~0#1); 476615#L96-1 assume !(0 != main_~p4~0#1); 476603#L100-1 assume !(0 != main_~p5~0#1); 476604#L104-1 assume !(0 != main_~p6~0#1); 476674#L108-1 assume !(0 != main_~p7~0#1); 476661#L112-1 assume !(0 != main_~p8~0#1); 476659#L116-1 assume !(0 != main_~p9~0#1); 476569#L120-1 assume !(0 != main_~p10~0#1); 476571#L124-1 assume !(0 != main_~p11~0#1); 476544#L128-1 assume !(0 != main_~p12~0#1); 476546#L132-1 assume !(0 != main_~p13~0#1); 476521#L136-1 assume !(0 != main_~p14~0#1); 476523#L140-1 assume !(0 != main_~p1~0#1); 476485#L146-1 assume !(0 != main_~p2~0#1); 476487#L151-1 assume !(0 != main_~p3~0#1); 476475#L156-1 assume !(0 != main_~p4~0#1); 476477#L161-1 assume !(0 != main_~p5~0#1); 476335#L166-1 assume !(0 != main_~p6~0#1); 476336#L171-1 assume !(0 != main_~p7~0#1); 476428#L176-1 assume !(0 != main_~p8~0#1); 476650#L181-1 assume !(0 != main_~p9~0#1); 476647#L186-1 assume !(0 != main_~p10~0#1); 476646#L191-1 assume !(0 != main_~p11~0#1); 476643#L196-1 assume !(0 != main_~p12~0#1); 476639#L201-1 assume !(0 != main_~p13~0#1); 476635#L206-1 assume !(0 != main_~p14~0#1); 475156#L211-1 [2021-12-15 17:07:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-12-15 17:07:12,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:12,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020914888] [2021-12-15 17:07:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:12,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,162 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:12,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2021-12-15 17:07:12,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:12,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089871078] [2021-12-15 17:07:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:12,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,171 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2021-12-15 17:07:12,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361308263] [2021-12-15 17:07:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:12,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:12,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:12,395 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:07:12,399 INFO L158 Benchmark]: Toolchain (without parser) took 13487.91ms. Allocated memory was 83.9MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 47.8MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-15 17:07:12,399 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:12,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.26ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 47.6MB in the beginning and 76.9MB in the end (delta: -29.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-12-15 17:07:12,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.00ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 74.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:12,400 INFO L158 Benchmark]: Boogie Preprocessor took 43.51ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:12,400 INFO L158 Benchmark]: RCFGBuilder took 336.39ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 61.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:07:12,400 INFO L158 Benchmark]: BuchiAutomizer took 12871.68ms. Allocated memory was 100.7MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 61.0MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-15 17:07:12,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.26ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 47.6MB in the beginning and 76.9MB in the end (delta: -29.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.00ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 74.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.51ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.39ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 61.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 12871.68ms. Allocated memory was 100.7MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 61.0MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:07:12,430 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable