./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:39:05,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:39:05,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:39:05,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:39:05,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:39:05,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:39:05,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:39:05,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:39:05,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:39:05,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:39:05,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:39:05,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:39:05,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:39:05,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:39:05,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:39:05,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:39:05,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:39:05,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:39:05,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:39:05,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:39:05,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:39:05,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:39:05,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:39:05,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:39:05,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:39:05,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:39:05,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:39:05,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:39:05,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:39:05,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:39:05,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:39:05,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:39:05,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:39:05,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:39:05,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:39:05,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:39:05,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:39:05,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:39:05,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:39:05,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:39:05,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:39:05,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:39:05,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:39:05,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:39:05,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:39:05,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:39:05,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:39:05,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:39:05,881 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:39:05,881 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:39:05,881 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:39:05,881 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:39:05,882 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:39:05,882 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:39:05,882 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:39:05,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:39:05,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:39:05,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:39:05,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:39:05,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:39:05,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:39:05,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:39:05,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:39:05,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:39:05,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:39:05,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:39:05,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:39:05,886 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:39:05,886 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-02-21 03:39:06,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:39:06,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:39:06,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:39:06,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:39:06,108 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:39:06,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2022-02-21 03:39:06,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8fbf210/1426698285ff410da04cb8d01022541f/FLAGbe1b8dc23 [2022-02-21 03:39:06,535 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:39:06,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2022-02-21 03:39:06,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8fbf210/1426698285ff410da04cb8d01022541f/FLAGbe1b8dc23 [2022-02-21 03:39:06,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8fbf210/1426698285ff410da04cb8d01022541f [2022-02-21 03:39:06,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:39:06,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:39:06,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:06,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:39:06,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:39:06,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb1c05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06, skipping insertion in model container [2022-02-21 03:39:06,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:39:06,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:39:06,685 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_11.c[4246,4259] [2022-02-21 03:39:06,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:06,692 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:39:06,709 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_11.c[4246,4259] [2022-02-21 03:39:06,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:39:06,722 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:39:06,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06 WrapperNode [2022-02-21 03:39:06,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:39:06,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:06,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:39:06,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:39:06,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,769 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2022-02-21 03:39:06,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:39:06,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:39:06,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:39:06,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:39:06,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:39:06,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:39:06,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:39:06,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:39:06,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (1/1) ... [2022-02-21 03:39:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:39:06,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:39:06,844 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) [2022-02-21 03:39:06,856 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 [2022-02-21 03:39:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:39:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:39:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:39:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:39:06,925 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:39:06,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:39:07,147 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:39:07,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:39:07,152 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:39:07,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:07 BoogieIcfgContainer [2022-02-21 03:39:07,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:39:07,154 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:39:07,154 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:39:07,161 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:39:07,162 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:07,162 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:39:06" (1/3) ... [2022-02-21 03:39:07,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29043c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:07, skipping insertion in model container [2022-02-21 03:39:07,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:07,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:39:06" (2/3) ... [2022-02-21 03:39:07,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29043c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:39:07, skipping insertion in model container [2022-02-21 03:39:07,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:39:07,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:07" (3/3) ... [2022-02-21 03:39:07,173 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2022-02-21 03:39:07,218 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:39:07,219 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:39:07,219 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:39:07,219 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:39:07,219 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:39:07,219 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:39:07,219 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:39:07,219 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:39:07,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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) [2022-02-21 03:39:07,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-02-21 03:39:07,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:07,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:07,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:07,260 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] [2022-02-21 03:39:07,261 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:39:07,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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) [2022-02-21 03:39:07,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-02-21 03:39:07,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:07,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:07,266 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:07,266 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] [2022-02-21 03:39:07,271 INFO L791 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 10#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_~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_~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;havoc main_~cond~0#1; 28#L169-1true [2022-02-21 03:39:07,271 INFO L793 eck$LassoCheckResult]: Loop: 28#L169-1true assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 15#L46true 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; 41#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 42#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 29#L77-1true assume !(0 != main_~p3~0#1); 6#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 25#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 19#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 36#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26#L109-1true assume !(0 != main_~p11~0#1); 21#L113-1true assume !(0 != main_~p1~0#1); 37#L119-1true assume !(0 != main_~p2~0#1); 9#L124-1true assume !(0 != main_~p3~0#1); 12#L129-1true assume !(0 != main_~p4~0#1); 20#L134-1true assume !(0 != main_~p5~0#1); 11#L139-1true assume !(0 != main_~p6~0#1); 4#L144-1true assume !(0 != main_~p7~0#1); 35#L149-1true assume !(0 != main_~p8~0#1); 18#L154-1true assume !(0 != main_~p9~0#1); 8#L159-1true assume !(0 != main_~p10~0#1); 39#L164-1true assume !(0 != main_~p11~0#1); 28#L169-1true [2022-02-21 03:39:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:39:07,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:07,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229610398] [2022-02-21 03:39:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:07,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:07,392 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2022-02-21 03:39:07,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:07,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571976586] [2022-02-21 03:39:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:07,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {48#true} is VALID [2022-02-21 03:39:07,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} 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; {48#true} is VALID [2022-02-21 03:39:07,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 03:39:07,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {49#false} is VALID [2022-02-21 03:39:07,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {49#false} assume !(0 != main_~p2~0#1); {49#false} is VALID [2022-02-21 03:39:07,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {49#false} assume !(0 != main_~p3~0#1); {49#false} is VALID [2022-02-21 03:39:07,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {49#false} assume !(0 != main_~p4~0#1); {49#false} is VALID [2022-02-21 03:39:07,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {49#false} assume !(0 != main_~p5~0#1); {49#false} is VALID [2022-02-21 03:39:07,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {49#false} assume !(0 != main_~p6~0#1); {49#false} is VALID [2022-02-21 03:39:07,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {49#false} assume !(0 != main_~p7~0#1); {49#false} is VALID [2022-02-21 03:39:07,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !(0 != main_~p8~0#1); {49#false} is VALID [2022-02-21 03:39:07,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {49#false} assume !(0 != main_~p9~0#1); {49#false} is VALID [2022-02-21 03:39:07,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {49#false} assume !(0 != main_~p10~0#1); {49#false} is VALID [2022-02-21 03:39:07,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {49#false} assume !(0 != main_~p11~0#1); {49#false} is VALID [2022-02-21 03:39:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:07,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:07,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571976586] [2022-02-21 03:39:07,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571976586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:07,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:07,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:07,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857715513] [2022-02-21 03:39:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:07,518 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:07,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:07,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:07,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:07,545 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:07,687 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2022-02-21 03:39:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:07,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:07,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:07,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2022-02-21 03:39:07,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-02-21 03:39:07,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2022-02-21 03:39:07,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-02-21 03:39:07,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 03:39:07,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2022-02-21 03:39:07,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:07,725 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-02-21 03:39:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2022-02-21 03:39:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 03:39:07,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:07,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 113 transitions. Second operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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) [2022-02-21 03:39:07,744 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 113 transitions. Second operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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) [2022-02-21 03:39:07,745 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. Second operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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) [2022-02-21 03:39:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:07,750 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2022-02-21 03:39:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 113 transitions. [2022-02-21 03:39:07,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:07,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:07,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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 71 states and 113 transitions. [2022-02-21 03:39:07,752 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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 71 states and 113 transitions. [2022-02-21 03:39:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:07,758 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2022-02-21 03:39:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 113 transitions. [2022-02-21 03:39:07,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:07,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:07,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:07,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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) [2022-02-21 03:39:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2022-02-21 03:39:07,767 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-02-21 03:39:07,777 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-02-21 03:39:07,777 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:39:07,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2022-02-21 03:39:07,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-02-21 03:39:07,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:07,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:07,779 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:07,779 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] [2022-02-21 03:39:07,780 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 145#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_~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_~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;havoc main_~cond~0#1; 146#L169-1 [2022-02-21 03:39:07,780 INFO L793 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 179#L46 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; 178#L73 assume !(0 != main_~p1~0#1); 174#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 168#L77-1 assume !(0 != main_~p3~0#1); 135#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 136#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 159#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 149#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 150#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 169#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 170#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 177#L109-1 assume !(0 != main_~p11~0#1); 175#L113-1 assume !(0 != main_~p1~0#1); 176#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 194#L129-1 assume !(0 != main_~p4~0#1); 192#L134-1 assume !(0 != main_~p5~0#1); 190#L139-1 assume !(0 != main_~p6~0#1); 188#L144-1 assume !(0 != main_~p7~0#1); 186#L149-1 assume !(0 != main_~p8~0#1); 157#L154-1 assume !(0 != main_~p9~0#1); 139#L159-1 assume !(0 != main_~p10~0#1); 141#L164-1 assume !(0 != main_~p11~0#1); 146#L169-1 [2022-02-21 03:39:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:39:07,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:07,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208632581] [2022-02-21 03:39:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:07,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:07,805 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2022-02-21 03:39:07,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:07,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037959552] [2022-02-21 03:39:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:07,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:07,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {350#true} is VALID [2022-02-21 03:39:07,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} 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; {350#true} is VALID [2022-02-21 03:39:07,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume !(0 != main_~p1~0#1); {350#true} is VALID [2022-02-21 03:39:07,850 INFO L290 TraceCheckUtils]: 3: Hoare triple {350#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 03:39:07,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {352#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {351#false} is VALID [2022-02-21 03:39:07,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} assume !(0 != main_~p3~0#1); {351#false} is VALID [2022-02-21 03:39:07,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} assume !(0 != main_~p4~0#1); {351#false} is VALID [2022-02-21 03:39:07,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {351#false} assume !(0 != main_~p5~0#1); {351#false} is VALID [2022-02-21 03:39:07,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {351#false} assume !(0 != main_~p6~0#1); {351#false} is VALID [2022-02-21 03:39:07,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {351#false} assume !(0 != main_~p7~0#1); {351#false} is VALID [2022-02-21 03:39:07,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {351#false} assume !(0 != main_~p8~0#1); {351#false} is VALID [2022-02-21 03:39:07,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {351#false} assume !(0 != main_~p9~0#1); {351#false} is VALID [2022-02-21 03:39:07,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {351#false} assume !(0 != main_~p10~0#1); {351#false} is VALID [2022-02-21 03:39:07,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {351#false} assume !(0 != main_~p11~0#1); {351#false} is VALID [2022-02-21 03:39:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:07,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:07,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037959552] [2022-02-21 03:39:07,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037959552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:07,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:07,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:07,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075305456] [2022-02-21 03:39:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:07,863 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:07,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:07,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:07,864 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:07,959 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-02-21 03:39:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:07,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:07,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:07,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2022-02-21 03:39:07,993 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-02-21 03:39:07,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2022-02-21 03:39:07,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-02-21 03:39:07,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2022-02-21 03:39:07,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2022-02-21 03:39:07,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:07,998 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-02-21 03:39:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2022-02-21 03:39:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-02-21 03:39:08,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states and 218 transitions. Second operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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) [2022-02-21 03:39:08,010 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states and 218 transitions. Second operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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) [2022-02-21 03:39:08,014 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. Second operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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) [2022-02-21 03:39:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,019 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-02-21 03:39:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 218 transitions. [2022-02-21 03:39:08,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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 138 states and 218 transitions. [2022-02-21 03:39:08,022 INFO L87 Difference]: Start difference. First operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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 138 states and 218 transitions. [2022-02-21 03:39:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,028 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-02-21 03:39:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 218 transitions. [2022-02-21 03:39:08,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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) [2022-02-21 03:39:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2022-02-21 03:39:08,036 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-02-21 03:39:08,036 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-02-21 03:39:08,036 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:39:08,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2022-02-21 03:39:08,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-02-21 03:39:08,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,039 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,039 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] [2022-02-21 03:39:08,040 INFO L791 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 504#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_~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_~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;havoc main_~cond~0#1; 505#L169-1 [2022-02-21 03:39:08,040 INFO L793 eck$LassoCheckResult]: Loop: 505#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 594#L46 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; 593#L73 assume !(0 != main_~p1~0#1); 591#L73-2 assume !(0 != main_~p2~0#1); 592#L77-1 assume !(0 != main_~p3~0#1); 622#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 621#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 620#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 619#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 618#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 617#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 616#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 615#L109-1 assume !(0 != main_~p11~0#1); 613#L113-1 assume !(0 != main_~p1~0#1); 614#L119-1 assume !(0 != main_~p2~0#1); 609#L124-1 assume !(0 != main_~p3~0#1); 607#L129-1 assume !(0 != main_~p4~0#1); 605#L134-1 assume !(0 != main_~p5~0#1); 603#L139-1 assume !(0 != main_~p6~0#1); 491#L144-1 assume !(0 != main_~p7~0#1); 493#L149-1 assume !(0 != main_~p8~0#1); 516#L154-1 assume !(0 != main_~p9~0#1); 498#L159-1 assume !(0 != main_~p10~0#1); 500#L164-1 assume !(0 != main_~p11~0#1); 505#L169-1 [2022-02-21 03:39:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:39:08,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271678025] [2022-02-21 03:39:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,056 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2022-02-21 03:39:08,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651491845] [2022-02-21 03:39:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {910#true} is VALID [2022-02-21 03:39:08,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} 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; {910#true} is VALID [2022-02-21 03:39:08,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {910#true} assume !(0 != main_~p1~0#1); {910#true} is VALID [2022-02-21 03:39:08,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {910#true} assume !(0 != main_~p2~0#1); {910#true} is VALID [2022-02-21 03:39:08,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {910#true} assume !(0 != main_~p3~0#1); {910#true} is VALID [2022-02-21 03:39:08,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {910#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 03:39:08,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {911#false} is VALID [2022-02-21 03:39:08,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {911#false} assume !(0 != main_~p5~0#1); {911#false} is VALID [2022-02-21 03:39:08,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {911#false} assume !(0 != main_~p6~0#1); {911#false} is VALID [2022-02-21 03:39:08,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {911#false} assume !(0 != main_~p7~0#1); {911#false} is VALID [2022-02-21 03:39:08,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {911#false} assume !(0 != main_~p8~0#1); {911#false} is VALID [2022-02-21 03:39:08,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {911#false} assume !(0 != main_~p9~0#1); {911#false} is VALID [2022-02-21 03:39:08,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {911#false} assume !(0 != main_~p10~0#1); {911#false} is VALID [2022-02-21 03:39:08,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {911#false} assume !(0 != main_~p11~0#1); {911#false} is VALID [2022-02-21 03:39:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:08,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651491845] [2022-02-21 03:39:08,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651491845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660951680] [2022-02-21 03:39:08,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,092 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,093 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,181 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-02-21 03:39:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:08,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2022-02-21 03:39:08,211 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-02-21 03:39:08,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2022-02-21 03:39:08,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2022-02-21 03:39:08,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-02-21 03:39:08,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2022-02-21 03:39:08,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,219 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-02-21 03:39:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2022-02-21 03:39:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-02-21 03:39:08,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states and 422 transitions. Second operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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) [2022-02-21 03:39:08,238 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states and 422 transitions. Second operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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) [2022-02-21 03:39:08,239 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. Second operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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) [2022-02-21 03:39:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,246 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-02-21 03:39:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 422 transitions. [2022-02-21 03:39:08,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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 270 states and 422 transitions. [2022-02-21 03:39:08,251 INFO L87 Difference]: Start difference. First operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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 270 states and 422 transitions. [2022-02-21 03:39:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,258 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-02-21 03:39:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 422 transitions. [2022-02-21 03:39:08,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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) [2022-02-21 03:39:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2022-02-21 03:39:08,266 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-02-21 03:39:08,266 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-02-21 03:39:08,266 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:39:08,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2022-02-21 03:39:08,268 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-02-21 03:39:08,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,269 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,269 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] [2022-02-21 03:39:08,269 INFO L791 eck$LassoCheckResult]: Stem: 1215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1196#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_~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_~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;havoc main_~cond~0#1; 1197#L169-1 [2022-02-21 03:39:08,270 INFO L793 eck$LassoCheckResult]: Loop: 1197#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1244#L46 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; 1245#L73 assume !(0 != main_~p1~0#1); 1350#L73-2 assume !(0 != main_~p2~0#1); 1347#L77-1 assume !(0 != main_~p3~0#1); 1344#L81-1 assume !(0 != main_~p4~0#1); 1340#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1337#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1334#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1331#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1328#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1311#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1312#L109-1 assume !(0 != main_~p11~0#1); 1229#L113-1 assume !(0 != main_~p1~0#1); 1231#L119-1 assume !(0 != main_~p2~0#1); 1322#L124-1 assume !(0 != main_~p3~0#1); 1318#L129-1 assume !(0 != main_~p4~0#1); 1319#L134-1 assume !(0 != main_~p5~0#1); 1365#L139-1 assume !(0 != main_~p6~0#1); 1281#L144-1 assume !(0 != main_~p7~0#1); 1277#L149-1 assume !(0 != main_~p8~0#1); 1276#L154-1 assume !(0 != main_~p9~0#1); 1359#L159-1 assume !(0 != main_~p10~0#1); 1263#L164-1 assume !(0 != main_~p11~0#1); 1197#L169-1 [2022-02-21 03:39:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:39:08,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622341624] [2022-02-21 03:39:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,296 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2022-02-21 03:39:08,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817866277] [2022-02-21 03:39:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1998#true} is VALID [2022-02-21 03:39:08,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} 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; {1998#true} is VALID [2022-02-21 03:39:08,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume !(0 != main_~p1~0#1); {1998#true} is VALID [2022-02-21 03:39:08,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {1998#true} assume !(0 != main_~p2~0#1); {1998#true} is VALID [2022-02-21 03:39:08,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {1998#true} assume !(0 != main_~p3~0#1); {1998#true} is VALID [2022-02-21 03:39:08,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {1998#true} assume !(0 != main_~p4~0#1); {1998#true} is VALID [2022-02-21 03:39:08,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {1998#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 03:39:08,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {2000#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {1999#false} is VALID [2022-02-21 03:39:08,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {1999#false} assume !(0 != main_~p6~0#1); {1999#false} is VALID [2022-02-21 03:39:08,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {1999#false} assume !(0 != main_~p7~0#1); {1999#false} is VALID [2022-02-21 03:39:08,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1999#false} assume !(0 != main_~p8~0#1); {1999#false} is VALID [2022-02-21 03:39:08,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {1999#false} assume !(0 != main_~p9~0#1); {1999#false} is VALID [2022-02-21 03:39:08,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {1999#false} assume !(0 != main_~p10~0#1); {1999#false} is VALID [2022-02-21 03:39:08,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {1999#false} assume !(0 != main_~p11~0#1); {1999#false} is VALID [2022-02-21 03:39:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:08,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817866277] [2022-02-21 03:39:08,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817866277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545196676] [2022-02-21 03:39:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,349 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,350 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,425 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-02-21 03:39:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:08,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2022-02-21 03:39:08,457 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-02-21 03:39:08,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2022-02-21 03:39:08,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-02-21 03:39:08,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-02-21 03:39:08,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2022-02-21 03:39:08,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,481 INFO L681 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-02-21 03:39:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2022-02-21 03:39:08,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-02-21 03:39:08,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states and 818 transitions. Second operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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) [2022-02-21 03:39:08,502 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states and 818 transitions. Second operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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) [2022-02-21 03:39:08,503 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. Second operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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) [2022-02-21 03:39:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,512 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-02-21 03:39:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 818 transitions. [2022-02-21 03:39:08,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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 530 states and 818 transitions. [2022-02-21 03:39:08,515 INFO L87 Difference]: Start difference. First operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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 530 states and 818 transitions. [2022-02-21 03:39:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,524 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-02-21 03:39:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 818 transitions. [2022-02-21 03:39:08,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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) [2022-02-21 03:39:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2022-02-21 03:39:08,534 INFO L704 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-02-21 03:39:08,535 INFO L587 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-02-21 03:39:08,535 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:39:08,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2022-02-21 03:39:08,537 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-02-21 03:39:08,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,537 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,537 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] [2022-02-21 03:39:08,538 INFO L791 eck$LassoCheckResult]: Stem: 2566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2544#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_~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_~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;havoc main_~cond~0#1; 2545#L169-1 [2022-02-21 03:39:08,538 INFO L793 eck$LassoCheckResult]: Loop: 2545#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 2632#L46 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; 2630#L73 assume !(0 != main_~p1~0#1); 2626#L73-2 assume !(0 != main_~p2~0#1); 2624#L77-1 assume !(0 != main_~p3~0#1); 2620#L81-1 assume !(0 != main_~p4~0#1); 2616#L85-1 assume !(0 != main_~p5~0#1); 2614#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2612#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2610#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2608#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2606#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2604#L109-1 assume !(0 != main_~p11~0#1); 2601#L113-1 assume !(0 != main_~p1~0#1); 2602#L119-1 assume !(0 != main_~p2~0#1); 2668#L124-1 assume !(0 != main_~p3~0#1); 2663#L129-1 assume !(0 != main_~p4~0#1); 2659#L134-1 assume !(0 != main_~p5~0#1); 2656#L139-1 assume !(0 != main_~p6~0#1); 2652#L144-1 assume !(0 != main_~p7~0#1); 2648#L149-1 assume !(0 != main_~p8~0#1); 2644#L154-1 assume !(0 != main_~p9~0#1); 2640#L159-1 assume !(0 != main_~p10~0#1); 2636#L164-1 assume !(0 != main_~p11~0#1); 2545#L169-1 [2022-02-21 03:39:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-02-21 03:39:08,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865979140] [2022-02-21 03:39:08,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,558 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2022-02-21 03:39:08,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359677499] [2022-02-21 03:39:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {4126#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {4126#true} is VALID [2022-02-21 03:39:08,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {4126#true} 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; {4126#true} is VALID [2022-02-21 03:39:08,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {4126#true} assume !(0 != main_~p1~0#1); {4126#true} is VALID [2022-02-21 03:39:08,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {4126#true} assume !(0 != main_~p2~0#1); {4126#true} is VALID [2022-02-21 03:39:08,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {4126#true} assume !(0 != main_~p3~0#1); {4126#true} is VALID [2022-02-21 03:39:08,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {4126#true} assume !(0 != main_~p4~0#1); {4126#true} is VALID [2022-02-21 03:39:08,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {4126#true} assume !(0 != main_~p5~0#1); {4126#true} is VALID [2022-02-21 03:39:08,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {4126#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 03:39:08,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {4128#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {4127#false} is VALID [2022-02-21 03:39:08,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {4127#false} assume !(0 != main_~p7~0#1); {4127#false} is VALID [2022-02-21 03:39:08,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {4127#false} assume !(0 != main_~p8~0#1); {4127#false} is VALID [2022-02-21 03:39:08,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {4127#false} assume !(0 != main_~p9~0#1); {4127#false} is VALID [2022-02-21 03:39:08,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {4127#false} assume !(0 != main_~p10~0#1); {4127#false} is VALID [2022-02-21 03:39:08,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {4127#false} assume !(0 != main_~p11~0#1); {4127#false} is VALID [2022-02-21 03:39:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:08,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359677499] [2022-02-21 03:39:08,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359677499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834343318] [2022-02-21 03:39:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,617 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,618 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,700 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-02-21 03:39:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:08,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:08,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:08,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2022-02-21 03:39:08,744 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-02-21 03:39:08,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-02-21 03:39:08,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2022-02-21 03:39:08,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2022-02-21 03:39:08,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2022-02-21 03:39:08,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:08,779 INFO L681 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-02-21 03:39:08,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2022-02-21 03:39:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-02-21 03:39:08,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:08,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1042 states and 1586 transitions. Second operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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) [2022-02-21 03:39:08,792 INFO L74 IsIncluded]: Start isIncluded. First operand 1042 states and 1586 transitions. Second operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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) [2022-02-21 03:39:08,793 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. Second operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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) [2022-02-21 03:39:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,820 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-02-21 03:39:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1586 transitions. [2022-02-21 03:39:08,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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 1042 states and 1586 transitions. [2022-02-21 03:39:08,825 INFO L87 Difference]: Start difference. First operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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 1042 states and 1586 transitions. [2022-02-21 03:39:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:08,853 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-02-21 03:39:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1586 transitions. [2022-02-21 03:39:08,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:08,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:08,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:08,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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) [2022-02-21 03:39:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-02-21 03:39:08,882 INFO L704 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-02-21 03:39:08,882 INFO L587 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-02-21 03:39:08,882 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:39:08,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2022-02-21 03:39:08,886 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-02-21 03:39:08,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:08,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:08,886 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:08,886 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] [2022-02-21 03:39:08,887 INFO L791 eck$LassoCheckResult]: Stem: 5205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 5184#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_~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_~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;havoc main_~cond~0#1; 5185#L169-1 [2022-02-21 03:39:08,887 INFO L793 eck$LassoCheckResult]: Loop: 5185#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 5339#L46 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; 5335#L73 assume !(0 != main_~p1~0#1); 5331#L73-2 assume !(0 != main_~p2~0#1); 5329#L77-1 assume !(0 != main_~p3~0#1); 5327#L81-1 assume !(0 != main_~p4~0#1); 5323#L85-1 assume !(0 != main_~p5~0#1); 5319#L89-1 assume !(0 != main_~p6~0#1); 5317#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 5315#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5313#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5311#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5309#L109-1 assume !(0 != main_~p11~0#1); 5305#L113-1 assume !(0 != main_~p1~0#1); 5301#L119-1 assume !(0 != main_~p2~0#1); 5298#L124-1 assume !(0 != main_~p3~0#1); 5294#L129-1 assume !(0 != main_~p4~0#1); 5295#L134-1 assume !(0 != main_~p5~0#1); 5362#L139-1 assume !(0 != main_~p6~0#1); 5359#L144-1 assume !(0 != main_~p7~0#1); 5355#L149-1 assume !(0 != main_~p8~0#1); 5351#L154-1 assume !(0 != main_~p9~0#1); 5347#L159-1 assume !(0 != main_~p10~0#1); 5343#L164-1 assume !(0 != main_~p11~0#1); 5185#L169-1 [2022-02-21 03:39:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-02-21 03:39:08,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631571721] [2022-02-21 03:39:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:08,895 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2022-02-21 03:39:08,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:08,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170141608] [2022-02-21 03:39:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:08,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {8302#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {8302#true} is VALID [2022-02-21 03:39:08,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {8302#true} 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; {8302#true} is VALID [2022-02-21 03:39:08,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {8302#true} assume !(0 != main_~p1~0#1); {8302#true} is VALID [2022-02-21 03:39:08,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {8302#true} assume !(0 != main_~p2~0#1); {8302#true} is VALID [2022-02-21 03:39:08,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {8302#true} assume !(0 != main_~p3~0#1); {8302#true} is VALID [2022-02-21 03:39:08,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {8302#true} assume !(0 != main_~p4~0#1); {8302#true} is VALID [2022-02-21 03:39:08,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {8302#true} assume !(0 != main_~p5~0#1); {8302#true} is VALID [2022-02-21 03:39:08,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {8302#true} assume !(0 != main_~p6~0#1); {8302#true} is VALID [2022-02-21 03:39:08,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {8302#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 03:39:08,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {8304#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {8303#false} is VALID [2022-02-21 03:39:08,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {8303#false} assume !(0 != main_~p8~0#1); {8303#false} is VALID [2022-02-21 03:39:08,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {8303#false} assume !(0 != main_~p9~0#1); {8303#false} is VALID [2022-02-21 03:39:08,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {8303#false} assume !(0 != main_~p10~0#1); {8303#false} is VALID [2022-02-21 03:39:08,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {8303#false} assume !(0 != main_~p11~0#1); {8303#false} is VALID [2022-02-21 03:39:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:08,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:08,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170141608] [2022-02-21 03:39:08,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170141608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:08,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:08,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:08,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494346703] [2022-02-21 03:39:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:08,917 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:08,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:08,918 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,056 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-02-21 03:39:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:09,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:09,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:09,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2022-02-21 03:39:09,189 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-02-21 03:39:09,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-02-21 03:39:09,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2022-02-21 03:39:09,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2022-02-21 03:39:09,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2022-02-21 03:39:09,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:09,294 INFO L681 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-02-21 03:39:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2022-02-21 03:39:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-02-21 03:39:09,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:09,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2050 states and 3074 transitions. Second operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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) [2022-02-21 03:39:09,323 INFO L74 IsIncluded]: Start isIncluded. First operand 2050 states and 3074 transitions. Second operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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) [2022-02-21 03:39:09,326 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. Second operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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) [2022-02-21 03:39:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,426 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-02-21 03:39:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3074 transitions. [2022-02-21 03:39:09,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:09,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:09,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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 2050 states and 3074 transitions. [2022-02-21 03:39:09,436 INFO L87 Difference]: Start difference. First operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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 2050 states and 3074 transitions. [2022-02-21 03:39:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:09,530 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-02-21 03:39:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3074 transitions. [2022-02-21 03:39:09,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:09,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:09,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:09,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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) [2022-02-21 03:39:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-02-21 03:39:09,638 INFO L704 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-02-21 03:39:09,638 INFO L587 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-02-21 03:39:09,638 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:39:09,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2022-02-21 03:39:09,645 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-02-21 03:39:09,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:09,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:09,646 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:09,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] [2022-02-21 03:39:09,646 INFO L791 eck$LassoCheckResult]: Stem: 10387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 10367#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_~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_~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;havoc main_~cond~0#1; 10368#L169-1 [2022-02-21 03:39:09,646 INFO L793 eck$LassoCheckResult]: Loop: 10368#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 10475#L46 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; 10473#L73 assume !(0 != main_~p1~0#1); 10469#L73-2 assume !(0 != main_~p2~0#1); 10467#L77-1 assume !(0 != main_~p3~0#1); 10463#L81-1 assume !(0 != main_~p4~0#1); 10459#L85-1 assume !(0 != main_~p5~0#1); 10455#L89-1 assume !(0 != main_~p6~0#1); 10451#L93-1 assume !(0 != main_~p7~0#1); 10449#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 10447#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 10445#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 10443#L109-1 assume !(0 != main_~p11~0#1); 10440#L113-1 assume !(0 != main_~p1~0#1); 10441#L119-1 assume !(0 != main_~p2~0#1); 10511#L124-1 assume !(0 != main_~p3~0#1); 10506#L129-1 assume !(0 != main_~p4~0#1); 10502#L134-1 assume !(0 != main_~p5~0#1); 10498#L139-1 assume !(0 != main_~p6~0#1); 10494#L144-1 assume !(0 != main_~p7~0#1); 10491#L149-1 assume !(0 != main_~p8~0#1); 10487#L154-1 assume !(0 != main_~p9~0#1); 10483#L159-1 assume !(0 != main_~p10~0#1); 10479#L164-1 assume !(0 != main_~p11~0#1); 10368#L169-1 [2022-02-21 03:39:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-02-21 03:39:09,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:09,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107865683] [2022-02-21 03:39:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:09,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:09,656 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2022-02-21 03:39:09,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:09,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040296025] [2022-02-21 03:39:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:09,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {16510#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {16510#true} is VALID [2022-02-21 03:39:09,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {16510#true} 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; {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {16510#true} assume !(0 != main_~p1~0#1); {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {16510#true} assume !(0 != main_~p2~0#1); {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {16510#true} assume !(0 != main_~p3~0#1); {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {16510#true} assume !(0 != main_~p4~0#1); {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {16510#true} assume !(0 != main_~p5~0#1); {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {16510#true} assume !(0 != main_~p6~0#1); {16510#true} is VALID [2022-02-21 03:39:09,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {16510#true} assume !(0 != main_~p7~0#1); {16510#true} is VALID [2022-02-21 03:39:09,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {16510#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 03:39:09,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {16512#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {16511#false} is VALID [2022-02-21 03:39:09,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {16511#false} assume !(0 != main_~p9~0#1); {16511#false} is VALID [2022-02-21 03:39:09,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {16511#false} assume !(0 != main_~p10~0#1); {16511#false} is VALID [2022-02-21 03:39:09,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {16511#false} assume !(0 != main_~p11~0#1); {16511#false} is VALID [2022-02-21 03:39:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:09,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:09,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040296025] [2022-02-21 03:39:09,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040296025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:09,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:09,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:09,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874912383] [2022-02-21 03:39:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:09,678 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:09,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:09,679 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:10,130 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-02-21 03:39:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:10,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:10,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:10,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2022-02-21 03:39:10,518 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-02-21 03:39:10,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-02-21 03:39:10,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2022-02-21 03:39:10,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2022-02-21 03:39:10,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2022-02-21 03:39:10,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:10,903 INFO L681 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-02-21 03:39:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2022-02-21 03:39:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2022-02-21 03:39:10,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:10,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4034 states and 5954 transitions. Second operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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) [2022-02-21 03:39:10,970 INFO L74 IsIncluded]: Start isIncluded. First operand 4034 states and 5954 transitions. Second operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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) [2022-02-21 03:39:10,974 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. Second operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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) [2022-02-21 03:39:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:11,344 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-02-21 03:39:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 5954 transitions. [2022-02-21 03:39:11,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:11,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:11,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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 4034 states and 5954 transitions. [2022-02-21 03:39:11,357 INFO L87 Difference]: Start difference. First operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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 4034 states and 5954 transitions. [2022-02-21 03:39:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:11,725 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-02-21 03:39:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 5954 transitions. [2022-02-21 03:39:11,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:11,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:11,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:11,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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) [2022-02-21 03:39:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-02-21 03:39:12,113 INFO L704 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-02-21 03:39:12,113 INFO L587 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-02-21 03:39:12,113 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:39:12,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2022-02-21 03:39:12,124 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-02-21 03:39:12,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:12,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:12,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:12,125 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] [2022-02-21 03:39:12,125 INFO L791 eck$LassoCheckResult]: Stem: 20581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 20559#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_~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_~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;havoc main_~cond~0#1; 20560#L169-1 [2022-02-21 03:39:12,125 INFO L793 eck$LassoCheckResult]: Loop: 20560#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 20721#L46 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; 20715#L73 assume !(0 != main_~p1~0#1); 20709#L73-2 assume !(0 != main_~p2~0#1); 20710#L77-1 assume !(0 != main_~p3~0#1); 20892#L81-1 assume !(0 != main_~p4~0#1); 20890#L85-1 assume !(0 != main_~p5~0#1); 20888#L89-1 assume !(0 != main_~p6~0#1); 20667#L93-1 assume !(0 != main_~p7~0#1); 20669#L97-1 assume !(0 != main_~p8~0#1); 20852#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 20848#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 20844#L109-1 assume !(0 != main_~p11~0#1); 20840#L113-1 assume !(0 != main_~p1~0#1); 20841#L119-1 assume !(0 != main_~p2~0#1); 20920#L124-1 assume !(0 != main_~p3~0#1); 20917#L129-1 assume !(0 != main_~p4~0#1); 20914#L134-1 assume !(0 != main_~p5~0#1); 20910#L139-1 assume !(0 != main_~p6~0#1); 20906#L144-1 assume !(0 != main_~p7~0#1); 20905#L149-1 assume !(0 != main_~p8~0#1); 20837#L154-1 assume !(0 != main_~p9~0#1); 20747#L159-1 assume !(0 != main_~p10~0#1); 20733#L164-1 assume !(0 != main_~p11~0#1); 20560#L169-1 [2022-02-21 03:39:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-02-21 03:39:12,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:12,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267953435] [2022-02-21 03:39:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:12,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:12,135 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:12,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2022-02-21 03:39:12,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:12,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236256258] [2022-02-21 03:39:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:12,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {32654#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {32654#true} is VALID [2022-02-21 03:39:12,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {32654#true} 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; {32654#true} is VALID [2022-02-21 03:39:12,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {32654#true} assume !(0 != main_~p1~0#1); {32654#true} is VALID [2022-02-21 03:39:12,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {32654#true} assume !(0 != main_~p2~0#1); {32654#true} is VALID [2022-02-21 03:39:12,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {32654#true} assume !(0 != main_~p3~0#1); {32654#true} is VALID [2022-02-21 03:39:12,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {32654#true} assume !(0 != main_~p4~0#1); {32654#true} is VALID [2022-02-21 03:39:12,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {32654#true} assume !(0 != main_~p5~0#1); {32654#true} is VALID [2022-02-21 03:39:12,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {32654#true} assume !(0 != main_~p6~0#1); {32654#true} is VALID [2022-02-21 03:39:12,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {32654#true} assume !(0 != main_~p7~0#1); {32654#true} is VALID [2022-02-21 03:39:12,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {32654#true} assume !(0 != main_~p8~0#1); {32654#true} is VALID [2022-02-21 03:39:12,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {32654#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p11~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p1~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p2~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p3~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p4~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p5~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p6~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p7~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p8~0#1); {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} is VALID [2022-02-21 03:39:12,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {32656#(not (= |ULTIMATE.start_main_~p9~0#1| 0))} assume !(0 != main_~p9~0#1); {32655#false} is VALID [2022-02-21 03:39:12,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {32655#false} assume !(0 != main_~p10~0#1); {32655#false} is VALID [2022-02-21 03:39:12,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {32655#false} assume !(0 != main_~p11~0#1); {32655#false} is VALID [2022-02-21 03:39:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:12,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:12,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236256258] [2022-02-21 03:39:12,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236256258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:12,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:12,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:12,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887349514] [2022-02-21 03:39:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:12,166 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:12,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:12,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:12,167 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:13,534 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-02-21 03:39:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:13,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:13,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:13,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2022-02-21 03:39:14,927 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-02-21 03:39:16,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-02-21 03:39:16,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2022-02-21 03:39:16,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2022-02-21 03:39:16,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2022-02-21 03:39:16,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:16,322 INFO L681 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-02-21 03:39:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2022-02-21 03:39:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2022-02-21 03:39:16,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:16,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7938 states and 11522 transitions. Second operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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) [2022-02-21 03:39:16,419 INFO L74 IsIncluded]: Start isIncluded. First operand 7938 states and 11522 transitions. Second operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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) [2022-02-21 03:39:16,427 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. Second operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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) [2022-02-21 03:39:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:17,695 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-02-21 03:39:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7938 states and 11522 transitions. [2022-02-21 03:39:17,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:17,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:17,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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 7938 states and 11522 transitions. [2022-02-21 03:39:17,714 INFO L87 Difference]: Start difference. First operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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 7938 states and 11522 transitions. [2022-02-21 03:39:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:19,167 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-02-21 03:39:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7938 states and 11522 transitions. [2022-02-21 03:39:19,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:19,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:19,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:19,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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) [2022-02-21 03:39:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-02-21 03:39:20,558 INFO L704 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-02-21 03:39:20,558 INFO L587 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-02-21 03:39:20,558 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:39:20,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2022-02-21 03:39:20,581 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-02-21 03:39:20,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:20,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:20,582 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:20,582 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] [2022-02-21 03:39:20,582 INFO L791 eck$LassoCheckResult]: Stem: 40628#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 40607#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_~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_~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;havoc main_~cond~0#1; 40608#L169-1 [2022-02-21 03:39:20,582 INFO L793 eck$LassoCheckResult]: Loop: 40608#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 41023#L46 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; 41016#L73 assume !(0 != main_~p1~0#1); 41008#L73-2 assume !(0 != main_~p2~0#1); 41004#L77-1 assume !(0 != main_~p3~0#1); 41002#L81-1 assume !(0 != main_~p4~0#1); 41000#L85-1 assume !(0 != main_~p5~0#1); 40998#L89-1 assume !(0 != main_~p6~0#1); 40997#L93-1 assume !(0 != main_~p7~0#1); 40995#L97-1 assume !(0 != main_~p8~0#1); 40994#L101-1 assume !(0 != main_~p9~0#1); 40990#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 40987#L109-1 assume !(0 != main_~p11~0#1); 40983#L113-1 assume !(0 != main_~p1~0#1); 40969#L119-1 assume !(0 != main_~p2~0#1); 40966#L124-1 assume !(0 != main_~p3~0#1); 40957#L129-1 assume !(0 != main_~p4~0#1); 40947#L134-1 assume !(0 != main_~p5~0#1); 40937#L139-1 assume !(0 != main_~p6~0#1); 40927#L144-1 assume !(0 != main_~p7~0#1); 40918#L149-1 assume !(0 != main_~p8~0#1); 40919#L154-1 assume !(0 != main_~p9~0#1); 41120#L159-1 assume !(0 != main_~p10~0#1); 41034#L164-1 assume !(0 != main_~p11~0#1); 40608#L169-1 [2022-02-21 03:39:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-02-21 03:39:20,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:20,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245826283] [2022-02-21 03:39:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:20,587 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:20,590 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2022-02-21 03:39:20,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:20,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953078070] [2022-02-21 03:39:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:39:20,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {64414#true} assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {64414#true} is VALID [2022-02-21 03:39:20,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {64414#true} 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; {64414#true} is VALID [2022-02-21 03:39:20,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {64414#true} assume !(0 != main_~p1~0#1); {64414#true} is VALID [2022-02-21 03:39:20,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {64414#true} assume !(0 != main_~p2~0#1); {64414#true} is VALID [2022-02-21 03:39:20,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {64414#true} assume !(0 != main_~p3~0#1); {64414#true} is VALID [2022-02-21 03:39:20,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {64414#true} assume !(0 != main_~p4~0#1); {64414#true} is VALID [2022-02-21 03:39:20,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {64414#true} assume !(0 != main_~p5~0#1); {64414#true} is VALID [2022-02-21 03:39:20,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {64414#true} assume !(0 != main_~p6~0#1); {64414#true} is VALID [2022-02-21 03:39:20,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {64414#true} assume !(0 != main_~p7~0#1); {64414#true} is VALID [2022-02-21 03:39:20,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {64414#true} assume !(0 != main_~p8~0#1); {64414#true} is VALID [2022-02-21 03:39:20,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {64414#true} assume !(0 != main_~p9~0#1); {64414#true} is VALID [2022-02-21 03:39:20,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {64414#true} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p11~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p1~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p2~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p3~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p4~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p5~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p6~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p7~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p8~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p9~0#1); {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} is VALID [2022-02-21 03:39:20,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {64416#(not (= |ULTIMATE.start_main_~p10~0#1| 0))} assume !(0 != main_~p10~0#1); {64415#false} is VALID [2022-02-21 03:39:20,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {64415#false} assume !(0 != main_~p11~0#1); {64415#false} is VALID [2022-02-21 03:39:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:39:20,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:39:20,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953078070] [2022-02-21 03:39:20,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953078070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:39:20,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:39:20,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:39:20,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461399080] [2022-02-21 03:39:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:39:20,611 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:39:20,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:39:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:39:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:39:20,612 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:25,939 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-02-21 03:39:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:39:25,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:39:25,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:39:25,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2022-02-21 03:39:30,967 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-02-21 03:39:35,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-02-21 03:39:35,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2022-02-21 03:39:35,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2022-02-21 03:39:35,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2022-02-21 03:39:35,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:39:35,879 INFO L681 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-02-21 03:39:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2022-02-21 03:39:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2022-02-21 03:39:36,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:39:36,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15618 states and 22274 transitions. Second operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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) [2022-02-21 03:39:36,080 INFO L74 IsIncluded]: Start isIncluded. First operand 15618 states and 22274 transitions. Second operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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) [2022-02-21 03:39:36,096 INFO L87 Difference]: Start difference. First operand 15618 states and 22274 transitions. Second operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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) [2022-02-21 03:39:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:41,022 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-02-21 03:39:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15618 states and 22274 transitions. [2022-02-21 03:39:41,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:41,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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 15618 states and 22274 transitions. [2022-02-21 03:39:41,086 INFO L87 Difference]: Start difference. First operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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 15618 states and 22274 transitions. [2022-02-21 03:39:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:39:46,228 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-02-21 03:39:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15618 states and 22274 transitions. [2022-02-21 03:39:46,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:39:46,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:39:46,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:39:46,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:39:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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) [2022-02-21 03:39:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-02-21 03:39:51,313 INFO L704 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-02-21 03:39:51,313 INFO L587 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-02-21 03:39:51,313 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:39:51,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2022-02-21 03:39:51,361 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-02-21 03:39:51,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:39:51,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:39:51,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:39:51,362 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] [2022-02-21 03:39:51,362 INFO L791 eck$LassoCheckResult]: Stem: 80067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 80046#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_~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_~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;havoc main_~cond~0#1; 80047#L169-1 [2022-02-21 03:39:51,362 INFO L793 eck$LassoCheckResult]: Loop: 80047#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 80756#L46 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; 80752#L73 assume !(0 != main_~p1~0#1); 80748#L73-2 assume !(0 != main_~p2~0#1); 80746#L77-1 assume !(0 != main_~p3~0#1); 80742#L81-1 assume !(0 != main_~p4~0#1); 80738#L85-1 assume !(0 != main_~p5~0#1); 80734#L89-1 assume !(0 != main_~p6~0#1); 80730#L93-1 assume !(0 != main_~p7~0#1); 80726#L97-1 assume !(0 != main_~p8~0#1); 80723#L101-1 assume !(0 != main_~p9~0#1); 80689#L105-1 assume !(0 != main_~p10~0#1); 80683#L109-1 assume !(0 != main_~p11~0#1); 80684#L113-1 assume !(0 != main_~p1~0#1); 80798#L119-1 assume !(0 != main_~p2~0#1); 80792#L124-1 assume !(0 != main_~p3~0#1); 80786#L129-1 assume !(0 != main_~p4~0#1); 80782#L134-1 assume !(0 != main_~p5~0#1); 80777#L139-1 assume !(0 != main_~p6~0#1); 80772#L144-1 assume !(0 != main_~p7~0#1); 80768#L149-1 assume !(0 != main_~p8~0#1); 80765#L154-1 assume !(0 != main_~p9~0#1); 80763#L159-1 assume !(0 != main_~p10~0#1); 80760#L164-1 assume !(0 != main_~p11~0#1); 80047#L169-1 [2022-02-21 03:39:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-02-21 03:39:51,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:51,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931108997] [2022-02-21 03:39:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,372 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2022-02-21 03:39:51,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:51,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077819277] [2022-02-21 03:39:51,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,380 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:39:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2022-02-21 03:39:51,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:39:51,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011963146] [2022-02-21 03:39:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:39:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:39:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:39:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:39:51,413 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:39:51,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:39:51 BoogieIcfgContainer [2022-02-21 03:39:51,711 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:39:51,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:39:51,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:39:51,712 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:39:51,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:39:07" (3/4) ... [2022-02-21 03:39:51,714 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:39:51,779 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:39:51,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:39:51,782 INFO L158 Benchmark]: Toolchain (without parser) took 45227.66ms. Allocated memory was 86.0MB in the beginning and 232.8MB in the end (delta: 146.8MB). Free memory was 64.9MB in the beginning and 119.6MB in the end (delta: -54.7MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2022-02-21 03:39:51,783 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:39:51,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.02ms. Allocated memory is still 86.0MB. Free memory was 64.7MB in the beginning and 53.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:39:51,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 86.0MB. Free memory was 53.6MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:39:51,785 INFO L158 Benchmark]: Boogie Preprocessor took 31.90ms. Allocated memory is still 86.0MB. Free memory was 51.6MB in the beginning and 50.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:39:51,785 INFO L158 Benchmark]: RCFGBuilder took 350.63ms. Allocated memory is still 86.0MB. Free memory was 50.2MB in the beginning and 38.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:39:51,786 INFO L158 Benchmark]: BuchiAutomizer took 44557.46ms. Allocated memory was 86.0MB in the beginning and 232.8MB in the end (delta: 146.8MB). Free memory was 37.7MB in the beginning and 122.5MB in the end (delta: -84.8MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2022-02-21 03:39:51,786 INFO L158 Benchmark]: Witness Printer took 69.66ms. Allocated memory is still 232.8MB. Free memory was 122.5MB in the beginning and 119.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:39:51,787 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.02ms. Allocated memory is still 86.0MB. Free memory was 64.7MB in the beginning and 53.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 86.0MB. Free memory was 53.6MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.90ms. Allocated memory is still 86.0MB. Free memory was 51.6MB in the beginning and 50.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.63ms. Allocated memory is still 86.0MB. Free memory was 50.2MB in the beginning and 38.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 44557.46ms. Allocated memory was 86.0MB in the beginning and 232.8MB in the end (delta: 146.8MB). Free memory was 37.7MB in the beginning and 122.5MB in the end (delta: -84.8MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 69.66ms. Allocated memory is still 232.8MB. Free memory was 122.5MB in the beginning and 119.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.4s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 21.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 13.7s Buchi closure took 0.0s. Biggest automaton had 15618 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 796 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, lk5=0, p1=0, NULL=0, p9=0, lk9=0, NULL=1, cond=4, p5=0, p10=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b6e463d=0, lk11=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ad855f3=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f04b02d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21b11ffe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41e18970=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62404e1c=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1711f8ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e471bcb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7311f36e=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ef65e75=0, p2=0, lk4=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@623101ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6eb8fe2b=4} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:39:51,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)