./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.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 c9bc953af286e9cfd29d104859de67d32500c9606def6c78f8ad113aab301f45 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:25,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:25,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:25,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:25,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:25,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:25,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:25,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:25,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:25,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:25,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:25,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:25,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:25,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:25,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:25,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:25,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:25,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:25,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:25,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:25,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:25,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:25,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:25,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:25,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:25,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:25,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:25,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:25,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:25,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:25,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:25,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:25,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:25,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:25,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:25,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:25,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:25,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:25,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:25,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:25,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:25,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:22:25,920 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:25,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:25,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:25,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:25,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:25,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:25,923 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:25,923 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:25,923 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:25,923 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:25,924 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:25,924 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:25,924 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:25,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:25,924 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:25,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:25,926 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:25,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:25,927 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:25,927 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:25,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:25,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:25,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:25,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:25,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:25,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:25,929 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:25,929 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 -> c9bc953af286e9cfd29d104859de67d32500c9606def6c78f8ad113aab301f45 [2021-12-15 17:22:26,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:26,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:26,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:26,249 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:26,251 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:26,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:26,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850f55dd6/2a32edae57ec45bbad6cd9a3c92950d9/FLAGc89b2d529 [2021-12-15 17:22:26,832 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:26,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:26,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850f55dd6/2a32edae57ec45bbad6cd9a3c92950d9/FLAGc89b2d529 [2021-12-15 17:22:27,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850f55dd6/2a32edae57ec45bbad6cd9a3c92950d9 [2021-12-15 17:22:27,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:27,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:27,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:27,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:27,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:27,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ad5214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27, skipping insertion in model container [2021-12-15 17:22:27,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:27,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:27,510 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/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c[12924,12937] [2021-12-15 17:22:27,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:27,518 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:27,557 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/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c[12924,12937] [2021-12-15 17:22:27,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:27,568 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:27,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27 WrapperNode [2021-12-15 17:22:27,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:27,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:27,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:27,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:27,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,615 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 420 [2021-12-15 17:22:27,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:27,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:27,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:27,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:27,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:27,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:27,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:27,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:27,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (1/1) ... [2021-12-15 17:22:27,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:27,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:27,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:22:27,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:22:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:27,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:27,787 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:27,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:28,218 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:28,224 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:28,230 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:28,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:28 BoogieIcfgContainer [2021-12-15 17:22:28,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:28,234 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:28,234 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:28,237 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:28,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:28,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:27" (1/3) ... [2021-12-15 17:22:28,238 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@294963a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:28, skipping insertion in model container [2021-12-15 17:22:28,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:28,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:27" (2/3) ... [2021-12-15 17:22:28,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@294963a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:28, skipping insertion in model container [2021-12-15 17:22:28,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:28,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:28" (3/3) ... [2021-12-15 17:22:28,241 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:28,328 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:28,328 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:28,328 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:28,329 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:28,329 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:28,329 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:28,329 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:28,329 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:28,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:28,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-15 17:22:28,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:28,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:28,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,393 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,393 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:28,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:28,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-15 17:22:28,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:28,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:28,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,411 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,417 INFO L791 eck$LassoCheckResult]: Stem: 115#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(46, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 40#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 130#L232true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 34#L235-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 24#L245true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 73#L248-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 30#L258true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 74#L261-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 31#L271true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 77#L274-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 57#L284true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 125#L287-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 32#L297true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 45#L300-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 71#L310true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 75#L310-1true init_#res#1 := init_~tmp___5~0#1; 4#L419true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 42#L22true assume !(0 == assume_abort_if_not_~cond#1); 94#L21true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 108#L527-2true [2021-12-15 17:22:28,421 INFO L793 eck$LassoCheckResult]: Loop: 108#L527-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 51#L79true assume !(0 != ~mode1~0 % 256); 15#L104true assume !(~r1~0 % 256 < 2); 129#L104-1true ~mode1~0 := 1; 36#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 48#L122true assume !(0 != ~mode2~0 % 256); 111#L147true assume !(~r2~0 % 256 < 2); 58#L147-1true ~mode2~0 := 1; 101#L122-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 10#L165true assume !(0 != ~mode3~0 % 256); 56#L190true assume !(~r3~0 % 256 < 2); 95#L190-1true ~mode3~0 := 1; 18#L165-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 86#L427true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 63#L427-1true check_#res#1 := check_~tmp~1#1; 70#L475true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 117#L556true assume !(0 == assert_~arg#1 % 256); 29#L551true assume { :end_inline_assert } true; 108#L527-2true [2021-12-15 17:22:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2021-12-15 17:22:28,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504046024] [2021-12-15 17:22:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504046024] [2021-12-15 17:22:28,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504046024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:28,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487499330] [2021-12-15 17:22:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:28,639 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2021-12-15 17:22:28,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332569435] [2021-12-15 17:22:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332569435] [2021-12-15 17:22:28,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332569435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:28,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174524819] [2021-12-15 17:22:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:28,758 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:28,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:28,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:28,787 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:28,870 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2021-12-15 17:22:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:28,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 222 transitions. [2021-12-15 17:22:28,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:28,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 210 transitions. [2021-12-15 17:22:28,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:22:28,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:22:28,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2021-12-15 17:22:28,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:28,890 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-15 17:22:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2021-12-15 17:22:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:22:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2021-12-15 17:22:28,914 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-15 17:22:28,914 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-15 17:22:28,914 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:28,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2021-12-15 17:22:28,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:28,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:28,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:28,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,918 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:28,918 INFO L791 eck$LassoCheckResult]: Stem: 401#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(46, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 352#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 353#L232 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 340#L235-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 318#L245 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 289#L248-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 330#L258 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 331#L261-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 334#L271 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 335#L274-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 374#L284 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 317#L287-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 337#L297 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 339#L300-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 358#L310 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 282#L310-1 init_#res#1 := init_~tmp___5~0#1; 278#L419 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 279#L22 assume !(0 == assume_abort_if_not_~cond#1); 355#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 327#L527-2 [2021-12-15 17:22:28,918 INFO L793 eck$LassoCheckResult]: Loop: 327#L527-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 364#L79 assume !(0 != ~mode1~0 % 256); 303#L104 assume !(~r1~0 % 256 < 2); 304#L104-1 ~mode1~0 := 1; 343#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 344#L122 assume !(0 != ~mode2~0 % 256); 362#L147 assume !(~r2~0 % 256 < 2); 345#L147-1 ~mode2~0 := 1; 376#L122-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 292#L165 assume !(0 != ~mode3~0 % 256); 294#L190 assume !(~r3~0 % 256 < 2); 372#L190-1 ~mode3~0 := 1; 311#L165-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 312#L427 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 391#L428 assume ~st1~0 + ~nl1~0 <= 1; 387#L429 assume ~st2~0 + ~nl2~0 <= 1; 296#L430 assume ~st3~0 + ~nl3~0 <= 1; 297#L431 assume ~r1~0 % 256 >= 2; 299#L435 assume ~r1~0 % 256 < 2; 369#L440 assume ~r1~0 % 256 >= 2; 346#L445 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 347#L427-1 check_#res#1 := check_~tmp~1#1; 377#L475 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 381#L556 assume !(0 == assert_~arg#1 % 256); 326#L551 assume { :end_inline_assert } true; 327#L527-2 [2021-12-15 17:22:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2021-12-15 17:22:28,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008875626] [2021-12-15 17:22:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:28,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:28,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008875626] [2021-12-15 17:22:28,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008875626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:28,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:28,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:28,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841809348] [2021-12-15 17:22:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:28,972 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2021-12-15 17:22:28,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:28,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617786646] [2021-12-15 17:22:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:28,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:29,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:29,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617786646] [2021-12-15 17:22:29,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617786646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:29,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:29,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:29,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603828324] [2021-12-15 17:22:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:29,011 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:29,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:29,012 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:29,062 INFO L93 Difference]: Finished difference Result 128 states and 212 transitions. [2021-12-15 17:22:29,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:29,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 212 transitions. [2021-12-15 17:22:29,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:29,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 125 states and 183 transitions. [2021-12-15 17:22:29,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:22:29,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:22:29,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 183 transitions. [2021-12-15 17:22:29,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:29,068 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-15 17:22:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 183 transitions. [2021-12-15 17:22:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:22:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2021-12-15 17:22:29,075 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-15 17:22:29,076 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-15 17:22:29,076 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:29,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2021-12-15 17:22:29,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:29,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:29,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:29,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:29,079 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:29,079 INFO L791 eck$LassoCheckResult]: Stem: 667#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(46, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 618#L232 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 605#L235-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 583#L245 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 554#L248-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 595#L258 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 596#L261-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 598#L271 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 599#L274-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 639#L284 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 581#L287-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 601#L297 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 603#L300-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 623#L310 assume ~id1~0 != ~id2~0; 624#L311 assume ~id1~0 != ~id3~0; 625#L312 assume ~id2~0 != ~id3~0; 578#L313 assume ~id1~0 >= 0; 579#L314 assume ~id2~0 >= 0; 621#L315 assume ~id3~0 >= 0; 622#L316 assume 0 == ~r1~0 % 256; 548#L317 assume 0 == ~r2~0 % 256; 549#L318 assume 0 == ~r3~0 % 256; 668#L319 assume 0 != init_~r122~0#1 % 256; 654#L320 assume 0 != init_~r132~0#1 % 256; 643#L321 assume 0 != init_~r212~0#1 % 256; 644#L322 assume 0 != init_~r232~0#1 % 256; 544#L323 assume 0 != init_~r312~0#1 % 256; 545#L324 assume 0 != init_~r322~0#1 % 256; 562#L325 assume ~max1~0 == ~id1~0; 585#L326 assume ~max2~0 == ~id2~0; 570#L327 assume ~max3~0 == ~id3~0; 571#L328 assume 0 == ~st1~0; 606#L329 assume 0 == ~st2~0; 607#L330 assume 0 == ~st3~0; 555#L331 assume 0 == ~nl1~0; 556#L332 assume 0 == ~nl2~0; 582#L333 assume 0 == ~nl3~0; 604#L334 assume 0 == ~mode1~0 % 256; 576#L335 assume 0 == ~mode2~0 % 256; 577#L336 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 650#L310-1 init_#res#1 := init_~tmp___5~0#1; 546#L419 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 547#L22 assume !(0 == assume_abort_if_not_~cond#1); 620#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 592#L527-2 [2021-12-15 17:22:29,079 INFO L793 eck$LassoCheckResult]: Loop: 592#L527-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 631#L79 assume !(0 != ~mode1~0 % 256); 568#L104 assume !(~r1~0 % 256 < 2); 569#L104-1 ~mode1~0 := 1; 608#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 609#L122 assume !(0 != ~mode2~0 % 256); 627#L147 assume !(~r2~0 % 256 < 2); 610#L147-1 ~mode2~0 := 1; 641#L122-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 557#L165 assume !(0 != ~mode3~0 % 256); 559#L190 assume !(~r3~0 % 256 < 2); 637#L190-1 ~mode3~0 := 1; 574#L165-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 575#L427 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 657#L428 assume ~st1~0 + ~nl1~0 <= 1; 653#L429 assume ~st2~0 + ~nl2~0 <= 1; 560#L430 assume ~st3~0 + ~nl3~0 <= 1; 561#L431 assume ~r1~0 % 256 >= 2; 564#L435 assume ~r1~0 % 256 < 2; 634#L440 assume ~r1~0 % 256 >= 2; 611#L445 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 612#L427-1 check_#res#1 := check_~tmp~1#1; 642#L475 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 648#L556 assume !(0 == assert_~arg#1 % 256); 591#L551 assume { :end_inline_assert } true; 592#L527-2 [2021-12-15 17:22:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2021-12-15 17:22:29,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:29,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957513375] [2021-12-15 17:22:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:29,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:29,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:29,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2021-12-15 17:22:29,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442523249] [2021-12-15 17:22:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:29,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:29,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442523249] [2021-12-15 17:22:29,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442523249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:29,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:29,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:29,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756025647] [2021-12-15 17:22:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:29,173 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:29,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:29,174 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:29,208 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2021-12-15 17:22:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:29,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2021-12-15 17:22:29,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-15 17:22:29,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2021-12-15 17:22:29,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-12-15 17:22:29,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-12-15 17:22:29,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2021-12-15 17:22:29,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:29,215 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-12-15 17:22:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2021-12-15 17:22:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-12-15 17:22:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2021-12-15 17:22:29,221 INFO L704 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-12-15 17:22:29,221 INFO L587 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-12-15 17:22:29,221 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:29,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2021-12-15 17:22:29,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-15 17:22:29,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:29,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:29,223 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:29,223 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:29,223 INFO L791 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(46, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 924#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 925#L232 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 913#L235-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 891#L245 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 862#L248-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 903#L258 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 904#L261-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 906#L271 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 907#L274-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 948#L284 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 889#L287-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 909#L297 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 911#L300-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 931#L310 assume ~id1~0 != ~id2~0; 932#L311 assume ~id1~0 != ~id3~0; 933#L312 assume ~id2~0 != ~id3~0; 886#L313 assume ~id1~0 >= 0; 887#L314 assume ~id2~0 >= 0; 929#L315 assume ~id3~0 >= 0; 930#L316 assume 0 == ~r1~0 % 256; 856#L317 assume 0 == ~r2~0 % 256; 857#L318 assume 0 == ~r3~0 % 256; 984#L319 assume 0 != init_~r122~0#1 % 256; 963#L320 assume 0 != init_~r132~0#1 % 256; 952#L321 assume 0 != init_~r212~0#1 % 256; 953#L322 assume 0 != init_~r232~0#1 % 256; 852#L323 assume 0 != init_~r312~0#1 % 256; 853#L324 assume 0 != init_~r322~0#1 % 256; 870#L325 assume ~max1~0 == ~id1~0; 893#L326 assume ~max2~0 == ~id2~0; 878#L327 assume ~max3~0 == ~id3~0; 879#L328 assume 0 == ~st1~0; 914#L329 assume 0 == ~st2~0; 915#L330 assume 0 == ~st3~0; 863#L331 assume 0 == ~nl1~0; 864#L332 assume 0 == ~nl2~0; 890#L333 assume 0 == ~nl3~0; 912#L334 assume 0 == ~mode1~0 % 256; 884#L335 assume 0 == ~mode2~0 % 256; 885#L336 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 959#L310-1 init_#res#1 := init_~tmp___5~0#1; 854#L419 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 855#L22 assume !(0 == assume_abort_if_not_~cond#1); 928#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 972#L527-2 [2021-12-15 17:22:29,223 INFO L793 eck$LassoCheckResult]: Loop: 972#L527-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 988#L79 assume !(0 != ~mode1~0 % 256); 987#L104 assume ~r1~0 % 256 < 2; 873#L105 assume !(0 != ~ep12~0 % 256); 875#L105-2 assume !(0 != ~ep13~0 % 256); 927#L104-1 ~mode1~0 := 1; 916#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 917#L122 assume !(0 != ~mode2~0 % 256); 935#L147 assume !(~r2~0 % 256 < 2); 918#L147-1 ~mode2~0 := 1; 947#L122-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1003#L165 assume !(0 != ~mode3~0 % 256); 1001#L190 assume !(~r3~0 % 256 < 2); 999#L190-1 ~mode3~0 := 1; 997#L165-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 996#L427 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 994#L428 assume ~st1~0 + ~nl1~0 <= 1; 992#L429 assume ~st2~0 + ~nl2~0 <= 1; 990#L430 assume ~st3~0 + ~nl3~0 <= 1; 985#L431 assume !(~r1~0 % 256 >= 2); 871#L434 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 872#L435 assume ~r1~0 % 256 < 2; 986#L440 assume !(~r1~0 % 256 >= 2); 973#L444 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 974#L445 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 995#L427-1 check_#res#1 := check_~tmp~1#1; 993#L475 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 991#L556 assume !(0 == assert_~arg#1 % 256); 989#L551 assume { :end_inline_assert } true; 972#L527-2 [2021-12-15 17:22:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2021-12-15 17:22:29,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:29,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837367816] [2021-12-15 17:22:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:29,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:29,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:29,278 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -480396747, now seen corresponding path program 1 times [2021-12-15 17:22:29,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:29,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744768017] [2021-12-15 17:22:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:29,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:29,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:29,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 472050935, now seen corresponding path program 1 times [2021-12-15 17:22:29,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:29,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723290636] [2021-12-15 17:22:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:29,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:29,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:29,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723290636] [2021-12-15 17:22:29,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723290636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:29,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:29,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:29,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096308745] [2021-12-15 17:22:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:29,812 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:22:29,815 INFO L158 Benchmark]: Toolchain (without parser) took 2530.25ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 71.3MB in the beginning and 51.0MB in the end (delta: 20.3MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,815 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 100.7MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:29,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.67ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 69.9MB in the end (delta: 1.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.38ms. Allocated memory is still 100.7MB. Free memory was 69.9MB in the beginning and 66.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,816 INFO L158 Benchmark]: Boogie Preprocessor took 26.08ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,816 INFO L158 Benchmark]: RCFGBuilder took 589.59ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.8MB in the beginning and 91.8MB in the end (delta: -26.9MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,817 INFO L158 Benchmark]: BuchiAutomizer took 1580.18ms. Allocated memory is still 121.6MB. Free memory was 91.8MB in the beginning and 51.0MB in the end (delta: 40.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2021-12-15 17:22:29,822 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 100.7MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.67ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 69.9MB in the end (delta: 1.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.38ms. Allocated memory is still 100.7MB. Free memory was 69.9MB in the beginning and 66.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.08ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 589.59ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.8MB in the beginning and 91.8MB in the end (delta: -26.9MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 1580.18ms. Allocated memory is still 121.6MB. Free memory was 91.8MB in the beginning and 51.0MB in the end (delta: 40.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:22:29,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable