./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_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 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:14,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:14,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:14,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:14,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:14,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:14,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:14,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:14,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:14,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:14,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:14,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:14,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:14,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:14,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:14,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:14,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:14,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:14,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:14,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:14,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:14,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:14,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:14,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:14,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:14,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:14,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:14,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:14,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:14,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:14,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:14,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:14,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:14,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:14,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:14,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:14,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:14,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:14,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:14,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:14,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:14,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:30:14,388 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:14,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:14,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:14,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:14,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:14,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:14,391 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:14,391 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:14,392 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:14,392 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:14,392 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:14,393 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:14,393 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:14,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:14,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:14,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:14,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:14,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:14,394 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:14,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:14,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:14,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:14,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:14,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:14,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:14,396 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:14,396 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 -> 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 [2022-02-21 04:30:14,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:30:14,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:30:14,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:30:14,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:30:14,580 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:30:14,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:14,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56652a670/dadd11dd7795414bb33785fd6edb5912/FLAG4363474ba [2022-02-21 04:30:14,969 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:30:14,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:14,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56652a670/dadd11dd7795414bb33785fd6edb5912/FLAG4363474ba [2022-02-21 04:30:14,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56652a670/dadd11dd7795414bb33785fd6edb5912 [2022-02-21 04:30:14,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:30:14,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:30:14,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:14,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:30:14,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:30:14,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:14" (1/1) ... [2022-02-21 04:30:14,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7670df4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:14, skipping insertion in model container [2022-02-21 04:30:14,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:14" (1/1) ... [2022-02-21 04:30:14,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:30:15,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:30:15,196 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_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2022-02-21 04:30:15,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:15,215 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:30:15,248 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_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2022-02-21 04:30:15,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:15,258 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:30:15,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15 WrapperNode [2022-02-21 04:30:15,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:15,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:15,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:30:15,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:30:15,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,307 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 368 [2022-02-21 04:30:15,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:15,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:30:15,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:30:15,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:30:15,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:30:15,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:30:15,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:30:15,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:30:15,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (1/1) ... [2022-02-21 04:30:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:15,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:15,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:30:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:30:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:30:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:30:15,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:30:15,518 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:30:15,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:30:15,894 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:30:15,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:30:15,903 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:30:15,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:15 BoogieIcfgContainer [2022-02-21 04:30:15,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:30:15,906 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:30:15,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:30:15,909 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:30:15,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:15,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:30:14" (1/3) ... [2022-02-21 04:30:15,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63c3c798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:15, skipping insertion in model container [2022-02-21 04:30:15,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:15,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:15" (2/3) ... [2022-02-21 04:30:15,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63c3c798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:15, skipping insertion in model container [2022-02-21 04:30:15,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:15,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:15" (3/3) ... [2022-02-21 04:30:15,913 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:15,958 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:30:15,958 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:30:15,959 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:30:15,959 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:30:15,959 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:30:15,960 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:30:15,960 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:30:15,960 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:30:15,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2022-02-21 04:30:16,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:16,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:16,042 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:16,042 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:16,042 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:30:16,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2022-02-21 04:30:16,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:16,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:16,060 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:16,060 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:16,066 INFO L791 eck$LassoCheckResult]: Stem: 92#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 28#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 59#L230true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 104#L230-1true init_#res#1 := init_~tmp~0#1; 68#L391true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 33#L24true assume !(0 == assume_abort_if_not_~cond#1); 11#L23true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 25#L469-2true [2022-02-21 04:30:16,070 INFO L793 eck$LassoCheckResult]: Loop: 25#L469-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 9#L80true assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 90#L84true assume !(node1_~m1~0#1 != ~nomsg~0); 98#L84-1true ~mode1~0 := 0; 15#L80-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 89#L106true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 84#L109true assume !(node2_~m2~0#1 != ~nomsg~0); 94#L109-1true ~mode2~0 := 0; 35#L106-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 29#L131true assume !(0 != ~mode3~0 % 256); 6#L144true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 58#L144-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 74#L131-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 102#L156true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 60#L159true assume !(node4_~m4~0#1 != ~nomsg~0); 80#L159-1true ~mode4~0 := 0; 27#L156-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 73#L181true assume !(0 != ~mode5~0 % 256); 75#L194true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 101#L194-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 31#L181-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 24#L206true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 83#L209true assume !(node6_~m6~0#1 != ~nomsg~0); 108#L209-1true ~mode6~0 := 0; 55#L206-2true assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 52#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 97#L399-1true check_#res#1 := check_~tmp~1#1; 4#L419true main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 32#L501true assume !(0 == assert_~arg#1 % 256); 66#L496true assume { :end_inline_assert } true; 25#L469-2true [2022-02-21 04:30:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2022-02-21 04:30:16,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:16,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709229789] [2022-02-21 04:30:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:16,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#true} 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {113#true} is VALID [2022-02-21 04:30:16,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} 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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {113#true} is VALID [2022-02-21 04:30:16,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {115#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:30:16,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {115#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {116#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:30:16,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {116#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; {117#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:30:16,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {114#false} is VALID [2022-02-21 04:30:16,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {114#false} is VALID [2022-02-21 04:30:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:16,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:16,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709229789] [2022-02-21 04:30:16,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709229789] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:16,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:16,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:16,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650907844] [2022-02-21 04:30:16,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:16,278 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1889928533, now seen corresponding path program 1 times [2022-02-21 04:30:16,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:16,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887177603] [2022-02-21 04:30:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:16,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume !(node1_~m1~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:30:16,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} ~mode1~0 := 0; {118#true} is VALID [2022-02-21 04:30:16,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {118#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(node2_~m2~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:30:16,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#true} ~mode2~0 := 0; {118#true} is VALID [2022-02-21 04:30:16,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {118#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#true} assume !(0 != ~mode3~0 % 256); {118#true} is VALID [2022-02-21 04:30:16,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {118#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {118#true} is VALID [2022-02-21 04:30:16,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {118#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {118#true} is VALID [2022-02-21 04:30:16,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {118#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {118#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {118#true} assume !(node4_~m4~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:30:16,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {118#true} ~mode4~0 := 0; {118#true} is VALID [2022-02-21 04:30:16,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {118#true} assume !(0 != ~mode5~0 % 256); {118#true} is VALID [2022-02-21 04:30:16,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {118#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {118#true} is VALID [2022-02-21 04:30:16,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {118#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {118#true} is VALID [2022-02-21 04:30:16,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {118#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {118#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:30:16,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {118#true} assume !(node6_~m6~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:30:16,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {118#true} ~mode6~0 := 0; {118#true} is VALID [2022-02-21 04:30:16,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {118#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {118#true} is VALID [2022-02-21 04:30:16,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {118#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {120#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:16,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {120#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {121#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:16,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {121#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {122#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:16,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {122#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {119#false} is VALID [2022-02-21 04:30:16,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {119#false} assume { :end_inline_assert } true; {119#false} is VALID [2022-02-21 04:30:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:16,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:16,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887177603] [2022-02-21 04:30:16,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887177603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:16,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:16,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:16,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470584363] [2022-02-21 04:30:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:16,500 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:16,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:16,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:16,543 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:16,897 INFO L93 Difference]: Finished difference Result 108 states and 182 transitions. [2022-02-21 04:30:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:16,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:16,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 182 transitions. [2022-02-21 04:30:16,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:30:16,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 104 states and 139 transitions. [2022-02-21 04:30:16,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2022-02-21 04:30:16,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2022-02-21 04:30:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 139 transitions. [2022-02-21 04:30:16,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:16,932 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-21 04:30:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 139 transitions. [2022-02-21 04:30:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-21 04:30:16,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:16,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 139 transitions. Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,961 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 139 transitions. Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,962 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:16,971 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2022-02-21 04:30:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2022-02-21 04:30:16,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:16,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:16,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 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 104 states and 139 transitions. [2022-02-21 04:30:16,973 INFO L87 Difference]: Start difference. First operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 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 104 states and 139 transitions. [2022-02-21 04:30:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:16,982 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2022-02-21 04:30:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2022-02-21 04:30:16,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:16,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:16,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:16,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2022-02-21 04:30:16,992 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-21 04:30:16,992 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-21 04:30:16,992 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:30:16,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 139 transitions. [2022-02-21 04:30:16,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:30:16,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:16,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:16,998 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, 1] [2022-02-21 04:30:16,998 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:17,000 INFO L791 eck$LassoCheckResult]: Stem: 337#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 277#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 278#L230 assume 0 == ~r1~0 % 256; 319#L231 assume ~id1~0 >= 0; 323#L232 assume 0 == ~st1~0; 308#L233 assume ~send1~0 == ~id1~0; 309#L234 assume 0 == ~mode1~0 % 256; 318#L235 assume ~id2~0 >= 0; 301#L236 assume 0 == ~st2~0; 302#L237 assume ~send2~0 == ~id2~0; 263#L238 assume 0 == ~mode2~0 % 256; 264#L239 assume ~id3~0 >= 0; 261#L240 assume 0 == ~st3~0; 262#L241 assume ~send3~0 == ~id3~0; 266#L242 assume 0 == ~mode3~0 % 256; 322#L243 assume ~id4~0 >= 0; 241#L244 assume 0 == ~st4~0; 242#L245 assume ~send4~0 == ~id4~0; 265#L246 assume 0 == ~mode4~0 % 256; 307#L247 assume ~id5~0 >= 0; 333#L248 assume 0 == ~st5~0; 237#L249 assume ~send5~0 == ~id5~0; 238#L250 assume 0 == ~mode5~0 % 256; 324#L251 assume ~id6~0 >= 0; 288#L252 assume 0 == ~st6~0; 289#L253 assume ~send6~0 == ~id6~0; 296#L254 assume 0 == ~mode6~0 % 256; 255#L255 assume ~id1~0 != ~id2~0; 256#L256 assume ~id1~0 != ~id3~0; 290#L257 assume ~id1~0 != ~id4~0; 267#L258 assume ~id1~0 != ~id5~0; 268#L259 assume ~id1~0 != ~id6~0; 310#L260 assume ~id2~0 != ~id3~0; 311#L261 assume ~id2~0 != ~id4~0; 297#L262 assume ~id2~0 != ~id5~0; 298#L263 assume ~id2~0 != ~id6~0; 303#L264 assume ~id3~0 != ~id4~0; 304#L265 assume ~id3~0 != ~id5~0; 249#L266 assume ~id3~0 != ~id6~0; 250#L267 assume ~id4~0 != ~id5~0; 259#L268 assume ~id4~0 != ~id6~0; 260#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 305#L230-1 init_#res#1 := init_~tmp~0#1; 327#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 285#L24 assume !(0 == assume_abort_if_not_~cond#1); 251#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 252#L469-2 [2022-02-21 04:30:17,001 INFO L793 eck$LassoCheckResult]: Loop: 252#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 246#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 247#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 274#L84-1 ~mode1~0 := 0; 257#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 258#L106 assume !(0 != ~mode2~0 % 256); 336#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 281#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 282#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 279#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 280#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 286#L134-1 ~mode3~0 := 0; 287#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 329#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 320#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 292#L159-1 ~mode4~0 := 0; 275#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 276#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 325#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 254#L184-1 ~mode5~0 := 0; 283#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 269#L206 assume !(0 != ~mode6~0 % 256); 270#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 338#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 317#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 312#L399 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 294#L399-1 check_#res#1 := check_~tmp~1#1; 235#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 236#L501 assume !(0 == assert_~arg#1 % 256); 284#L496 assume { :end_inline_assert } true; 252#L469-2 [2022-02-21 04:30:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2022-02-21 04:30:17,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609561464] [2022-02-21 04:30:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,088 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash 184711851, now seen corresponding path program 1 times [2022-02-21 04:30:17,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028275574] [2022-02-21 04:30:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:17,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {552#true} assume !(node1_~m1~0#1 != ~nomsg~0); {552#true} is VALID [2022-02-21 04:30:17,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {552#true} ~mode1~0 := 0; {552#true} is VALID [2022-02-21 04:30:17,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {552#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {552#true} assume !(0 != ~mode2~0 % 256); {552#true} is VALID [2022-02-21 04:30:17,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {552#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {552#true} is VALID [2022-02-21 04:30:17,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {552#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {552#true} is VALID [2022-02-21 04:30:17,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#true} assume !(node3_~m3~0#1 != ~nomsg~0); {552#true} is VALID [2022-02-21 04:30:17,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#true} ~mode3~0 := 0; {552#true} is VALID [2022-02-21 04:30:17,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#true} assume !(node4_~m4~0#1 != ~nomsg~0); {552#true} is VALID [2022-02-21 04:30:17,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {552#true} ~mode4~0 := 0; {552#true} is VALID [2022-02-21 04:30:17,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {552#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {552#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {552#true} assume !(node5_~m5~0#1 != ~nomsg~0); {552#true} is VALID [2022-02-21 04:30:17,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {552#true} ~mode5~0 := 0; {552#true} is VALID [2022-02-21 04:30:17,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {552#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {552#true} is VALID [2022-02-21 04:30:17,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#true} assume !(0 != ~mode6~0 % 256); {552#true} is VALID [2022-02-21 04:30:17,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {552#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {552#true} is VALID [2022-02-21 04:30:17,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {552#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {552#true} is VALID [2022-02-21 04:30:17,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {552#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {552#true} is VALID [2022-02-21 04:30:17,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {552#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {554#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:17,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {554#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {555#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:17,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {555#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {556#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:17,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {556#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {553#false} is VALID [2022-02-21 04:30:17,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {553#false} assume { :end_inline_assert } true; {553#false} is VALID [2022-02-21 04:30:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:17,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:17,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028275574] [2022-02-21 04:30:17,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028275574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:17,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:17,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:17,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551890615] [2022-02-21 04:30:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:17,199 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:17,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:17,200 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:17,456 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-02-21 04:30:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:17,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:17,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 141 transitions. [2022-02-21 04:30:17,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:30:17,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 104 states and 136 transitions. [2022-02-21 04:30:17,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2022-02-21 04:30:17,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2022-02-21 04:30:17,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 136 transitions. [2022-02-21 04:30:17,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:17,486 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-02-21 04:30:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 136 transitions. [2022-02-21 04:30:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-21 04:30:17,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:17,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 136 transitions. Second operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,489 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 136 transitions. Second operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,489 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:17,491 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2022-02-21 04:30:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2022-02-21 04:30:17,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:17,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:17,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 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 104 states and 136 transitions. [2022-02-21 04:30:17,493 INFO L87 Difference]: Start difference. First operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 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 104 states and 136 transitions. [2022-02-21 04:30:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:17,494 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2022-02-21 04:30:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2022-02-21 04:30:17,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:17,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:17,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:17,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2022-02-21 04:30:17,497 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-02-21 04:30:17,497 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-02-21 04:30:17,498 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:17,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 136 transitions. [2022-02-21 04:30:17,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:30:17,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:17,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:17,499 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, 1] [2022-02-21 04:30:17,499 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:17,499 INFO L791 eck$LassoCheckResult]: Stem: 770#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 710#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 711#L230 assume 0 == ~r1~0 % 256; 751#L231 assume ~id1~0 >= 0; 755#L232 assume 0 == ~st1~0; 740#L233 assume ~send1~0 == ~id1~0; 741#L234 assume 0 == ~mode1~0 % 256; 750#L235 assume ~id2~0 >= 0; 733#L236 assume 0 == ~st2~0; 734#L237 assume ~send2~0 == ~id2~0; 696#L238 assume 0 == ~mode2~0 % 256; 697#L239 assume ~id3~0 >= 0; 694#L240 assume 0 == ~st3~0; 695#L241 assume ~send3~0 == ~id3~0; 699#L242 assume 0 == ~mode3~0 % 256; 754#L243 assume ~id4~0 >= 0; 674#L244 assume 0 == ~st4~0; 675#L245 assume ~send4~0 == ~id4~0; 698#L246 assume 0 == ~mode4~0 % 256; 739#L247 assume ~id5~0 >= 0; 765#L248 assume 0 == ~st5~0; 670#L249 assume ~send5~0 == ~id5~0; 671#L250 assume 0 == ~mode5~0 % 256; 756#L251 assume ~id6~0 >= 0; 721#L252 assume 0 == ~st6~0; 722#L253 assume ~send6~0 == ~id6~0; 728#L254 assume 0 == ~mode6~0 % 256; 688#L255 assume ~id1~0 != ~id2~0; 689#L256 assume ~id1~0 != ~id3~0; 723#L257 assume ~id1~0 != ~id4~0; 700#L258 assume ~id1~0 != ~id5~0; 701#L259 assume ~id1~0 != ~id6~0; 742#L260 assume ~id2~0 != ~id3~0; 743#L261 assume ~id2~0 != ~id4~0; 729#L262 assume ~id2~0 != ~id5~0; 730#L263 assume ~id2~0 != ~id6~0; 735#L264 assume ~id3~0 != ~id4~0; 736#L265 assume ~id3~0 != ~id5~0; 682#L266 assume ~id3~0 != ~id6~0; 683#L267 assume ~id4~0 != ~id5~0; 692#L268 assume ~id4~0 != ~id6~0; 693#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 737#L230-1 init_#res#1 := init_~tmp~0#1; 759#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 718#L24 assume !(0 == assume_abort_if_not_~cond#1); 684#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 685#L469-2 [2022-02-21 04:30:17,500 INFO L793 eck$LassoCheckResult]: Loop: 685#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 679#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 680#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 707#L84-1 ~mode1~0 := 0; 690#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 691#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 768#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 748#L109-1 ~mode2~0 := 0; 715#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 712#L131 assume !(0 != ~mode3~0 % 256); 672#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 673#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 720#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 761#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 752#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 725#L159-1 ~mode4~0 := 0; 708#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 709#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 757#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 687#L184-1 ~mode5~0 := 0; 716#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 702#L206 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 704#L209 assume !(node6_~m6~0#1 != ~nomsg~0); 677#L209-1 ~mode6~0 := 0; 749#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 744#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 745#L400 assume ~r1~0 % 256 >= 6; 727#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 767#L399-1 check_#res#1 := check_~tmp~1#1; 668#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 669#L501 assume !(0 == assert_~arg#1 % 256); 717#L496 assume { :end_inline_assert } true; 685#L469-2 [2022-02-21 04:30:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2022-02-21 04:30:17,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924666819] [2022-02-21 04:30:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash 932335173, now seen corresponding path program 1 times [2022-02-21 04:30:17,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249478616] [2022-02-21 04:30:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:17,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {985#true} assume !(node1_~m1~0#1 != ~nomsg~0); {985#true} is VALID [2022-02-21 04:30:17,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {985#true} ~mode1~0 := 0; {985#true} is VALID [2022-02-21 04:30:17,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {985#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {985#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(node2_~m2~0#1 != ~nomsg~0); {985#true} is VALID [2022-02-21 04:30:17,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {985#true} ~mode2~0 := 0; {985#true} is VALID [2022-02-21 04:30:17,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {985#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 != ~mode3~0 % 256); {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {985#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {985#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {985#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {985#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {985#true} assume !(node4_~m4~0#1 != ~nomsg~0); {985#true} is VALID [2022-02-21 04:30:17,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {985#true} ~mode4~0 := 0; {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {985#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {985#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {985#true} assume !(node5_~m5~0#1 != ~nomsg~0); {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {985#true} ~mode5~0 := 0; {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {985#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {985#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {985#true} is VALID [2022-02-21 04:30:17,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {985#true} assume !(node6_~m6~0#1 != ~nomsg~0); {985#true} is VALID [2022-02-21 04:30:17,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {985#true} ~mode6~0 := 0; {985#true} is VALID [2022-02-21 04:30:17,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {985#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {985#true} is VALID [2022-02-21 04:30:17,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {985#true} is VALID [2022-02-21 04:30:17,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {985#true} assume ~r1~0 % 256 >= 6; {987#(not (<= ~r1~0 (+ 5 (* (div ~r1~0 256) 256))))} is VALID [2022-02-21 04:30:17,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {987#(not (<= ~r1~0 (+ 5 (* (div ~r1~0 256) 256))))} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {986#false} is VALID [2022-02-21 04:30:17,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {986#false} check_#res#1 := check_~tmp~1#1; {986#false} is VALID [2022-02-21 04:30:17,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {986#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {986#false} is VALID [2022-02-21 04:30:17,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {986#false} assume !(0 == assert_~arg#1 % 256); {986#false} is VALID [2022-02-21 04:30:17,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {986#false} assume { :end_inline_assert } true; {986#false} is VALID [2022-02-21 04:30:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:17,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:17,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249478616] [2022-02-21 04:30:17,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249478616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:17,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:17,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:17,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182357641] [2022-02-21 04:30:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:17,581 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:17,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:17,582 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:17,726 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2022-02-21 04:30:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:17,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:17,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2022-02-21 04:30:17,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2022-02-21 04:30:17,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 215 transitions. [2022-02-21 04:30:17,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-02-21 04:30:17,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-02-21 04:30:17,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 215 transitions. [2022-02-21 04:30:17,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:17,755 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-02-21 04:30:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 215 transitions. [2022-02-21 04:30:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-02-21 04:30:17,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:17,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states and 215 transitions. Second operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,760 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states and 215 transitions. Second operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,760 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:17,763 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2022-02-21 04:30:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2022-02-21 04:30:17,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:17,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:17,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 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 156 states and 215 transitions. [2022-02-21 04:30:17,764 INFO L87 Difference]: Start difference. First operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 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 156 states and 215 transitions. [2022-02-21 04:30:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:17,767 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2022-02-21 04:30:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2022-02-21 04:30:17,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:17,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:17,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:17,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2022-02-21 04:30:17,770 INFO L704 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-02-21 04:30:17,771 INFO L587 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-02-21 04:30:17,771 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:17,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. [2022-02-21 04:30:17,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2022-02-21 04:30:17,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:17,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:17,772 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, 1] [2022-02-21 04:30:17,772 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:17,772 INFO L791 eck$LassoCheckResult]: Stem: 1248#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 1187#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1188#L230 assume 0 == ~r1~0 % 256; 1231#L231 assume ~id1~0 >= 0; 1233#L232 assume 0 == ~st1~0; 1217#L233 assume ~send1~0 == ~id1~0; 1218#L234 assume 0 == ~mode1~0 % 256; 1227#L235 assume ~id2~0 >= 0; 1210#L236 assume 0 == ~st2~0; 1211#L237 assume ~send2~0 == ~id2~0; 1172#L238 assume 0 == ~mode2~0 % 256; 1173#L239 assume ~id3~0 >= 0; 1170#L240 assume 0 == ~st3~0; 1171#L241 assume ~send3~0 == ~id3~0; 1175#L242 assume 0 == ~mode3~0 % 256; 1232#L243 assume ~id4~0 >= 0; 1150#L244 assume 0 == ~st4~0; 1151#L245 assume ~send4~0 == ~id4~0; 1174#L246 assume 0 == ~mode4~0 % 256; 1216#L247 assume ~id5~0 >= 0; 1245#L248 assume 0 == ~st5~0; 1146#L249 assume ~send5~0 == ~id5~0; 1147#L250 assume 0 == ~mode5~0 % 256; 1234#L251 assume ~id6~0 >= 0; 1198#L252 assume 0 == ~st6~0; 1199#L253 assume ~send6~0 == ~id6~0; 1205#L254 assume 0 == ~mode6~0 % 256; 1164#L255 assume ~id1~0 != ~id2~0; 1165#L256 assume ~id1~0 != ~id3~0; 1200#L257 assume ~id1~0 != ~id4~0; 1176#L258 assume ~id1~0 != ~id5~0; 1177#L259 assume ~id1~0 != ~id6~0; 1219#L260 assume ~id2~0 != ~id3~0; 1220#L261 assume ~id2~0 != ~id4~0; 1206#L262 assume ~id2~0 != ~id5~0; 1207#L263 assume ~id2~0 != ~id6~0; 1212#L264 assume ~id3~0 != ~id4~0; 1213#L265 assume ~id3~0 != ~id5~0; 1158#L266 assume ~id3~0 != ~id6~0; 1159#L267 assume ~id4~0 != ~id5~0; 1168#L268 assume ~id4~0 != ~id6~0; 1169#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 1214#L230-1 init_#res#1 := init_~tmp~0#1; 1237#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 1195#L24 assume !(0 == assume_abort_if_not_~cond#1); 1160#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1161#L469-2 [2022-02-21 04:30:17,773 INFO L793 eck$LassoCheckResult]: Loop: 1161#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1295#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1156#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 1184#L84-1 ~mode1~0 := 0; 1249#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1292#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1289#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 1287#L109-1 ~mode2~0 := 0; 1285#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1284#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1282#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 1279#L134-1 ~mode3~0 := 0; 1277#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1276#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1274#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 1271#L159-1 ~mode4~0 := 0; 1269#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1268#L181 assume !(0 != ~mode5~0 % 256); 1264#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1262#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 1261#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1260#L206 assume !(0 != ~mode6~0 % 256); 1256#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 1254#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 1253#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1252#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1251#L400 assume !(~r1~0 % 256 >= 6); 1203#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 1204#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 1299#L399-1 check_#res#1 := check_~tmp~1#1; 1298#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 1297#L501 assume !(0 == assert_~arg#1 % 256); 1296#L496 assume { :end_inline_assert } true; 1161#L469-2 [2022-02-21 04:30:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2022-02-21 04:30:17,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782644955] [2022-02-21 04:30:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,808 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -225026227, now seen corresponding path program 1 times [2022-02-21 04:30:17,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586096670] [2022-02-21 04:30:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:17,828 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1816204181, now seen corresponding path program 1 times [2022-02-21 04:30:17,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:17,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582243637] [2022-02-21 04:30:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:17,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:17,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#true} 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1619#true} is VALID [2022-02-21 04:30:17,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1619#true} 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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1619#true} is VALID [2022-02-21 04:30:17,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1619#true} assume 0 == ~r1~0 % 256; {1619#true} is VALID [2022-02-21 04:30:17,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {1619#true} assume ~id1~0 >= 0; {1619#true} is VALID [2022-02-21 04:30:17,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {1619#true} assume 0 == ~st1~0; {1619#true} is VALID [2022-02-21 04:30:17,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1619#true} assume ~send1~0 == ~id1~0; {1619#true} is VALID [2022-02-21 04:30:17,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {1619#true} assume 0 == ~mode1~0 % 256; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:17,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {1621#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {1620#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {1620#false} ~mode1~0 := 0; {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {1620#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {1620#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {1620#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {1620#false} ~mode2~0 := 0; {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {1620#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {1620#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {1620#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {1620#false} ~mode3~0 := 0; {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {1620#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {1620#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {1620#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {1620#false} ~mode4~0 := 0; {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {1620#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {1620#false} assume !(0 != ~mode5~0 % 256); {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {1620#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1620#false} is VALID [2022-02-21 04:30:17,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {1620#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {1620#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {1620#false} assume !(0 != ~mode6~0 % 256); {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {1620#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {1620#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 70: Hoare triple {1620#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 71: Hoare triple {1620#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 72: Hoare triple {1620#false} assume !(~r1~0 % 256 >= 6); {1620#false} is VALID [2022-02-21 04:30:17,909 INFO L290 TraceCheckUtils]: 73: Hoare triple {1620#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {1620#false} is VALID [2022-02-21 04:30:17,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {1620#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {1620#false} is VALID [2022-02-21 04:30:17,910 INFO L290 TraceCheckUtils]: 75: Hoare triple {1620#false} check_#res#1 := check_~tmp~1#1; {1620#false} is VALID [2022-02-21 04:30:17,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {1620#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {1620#false} is VALID [2022-02-21 04:30:17,910 INFO L290 TraceCheckUtils]: 77: Hoare triple {1620#false} assume !(0 == assert_~arg#1 % 256); {1620#false} is VALID [2022-02-21 04:30:17,910 INFO L290 TraceCheckUtils]: 78: Hoare triple {1620#false} assume { :end_inline_assert } true; {1620#false} is VALID [2022-02-21 04:30:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:17,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:17,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582243637] [2022-02-21 04:30:17,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582243637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:17,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:17,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:17,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411241982] [2022-02-21 04:30:17,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:18,907 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:18,907 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:18,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:18,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:18,908 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:18,908 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,908 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:18,908 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:18,908 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:30:18,908 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:18,908 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:18,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:18,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:19,818 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-02-21 04:30:24,987 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:30:24,987 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:30:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:24,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:24,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:30:24,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:30:24,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:30:25,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:25,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:25,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:25,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:25,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:30:25,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:30:25,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:30:25,183 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:30:25,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:25,187 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:25,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:25,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:25,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:25,187 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:30:25,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:25,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:25,187 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:25,187 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:30:25,187 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:25,187 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:25,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:26,102 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-02-21 04:30:31,004 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:30:31,007 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:30:31,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:30:31,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:30:31,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:30:31,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:30:31,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:30:31,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:30:31,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:30:31,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:30:31,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 04:30:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:30:31,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,265 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:31,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,375 INFO L401 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2022-02-21 04:30:31,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:30:31,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:30:31,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,589 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:30:31,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:30:31,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,683 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:30:31,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,728 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:30:31,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,772 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:30:31,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 04:30:31,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,804 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:30:31,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,831 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:30:31,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 04:30:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,867 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:30:31,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:31,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:31,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,894 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 04:30:31,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,895 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:30:31,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,903 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:31,904 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:31,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:30:31,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,922 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:30:31,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,929 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:31,930 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:31,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,950 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:30:31,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,957 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:31,957 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:31,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:31,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:31,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:31,975 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:31,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:30:31,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:31,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:31,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:31,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:31,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:31,982 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:31,983 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:31,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:31,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:31,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:30:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,001 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:30:32,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,009 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,010 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,031 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:30:32,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,039 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,039 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:30:32,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,056 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:30:32,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,064 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,065 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:30:32,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,082 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:30:32,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,091 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:32,091 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,232 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-02-21 04:30:32,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,428 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:30:32,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,437 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,438 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,470 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:30:32,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,478 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,479 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,518 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:30:32,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,528 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,529 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,563 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,575 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:30:32,575 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,614 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,626 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,628 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:30:32,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,660 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:30:32,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,668 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,669 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,702 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:30:32,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,742 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,742 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,778 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:30:32,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,787 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,787 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,821 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:30:32,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,831 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,832 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,885 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:30:32,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,895 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:32,896 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:32,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,926 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-02-21 04:30:32,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,928 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:30:32,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,937 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:32,938 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:32,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:32,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:32,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:32,963 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:32,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:30:32,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:32,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:32,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:32,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:32,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:32,972 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:32,974 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:32,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:32,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,001 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 04:30:33,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,009 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,009 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 04:30:33,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,026 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 04:30:33,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,035 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,036 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 04:30:33,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,054 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 04:30:33,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,061 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,064 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,097 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 04:30:33,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,106 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,106 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,138 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,158 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,159 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 04:30:33,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,185 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 04:30:33,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,197 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:33,197 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,375 INFO L401 nArgumentSynthesizer]: We have 64 Motzkin's Theorem applications. [2022-02-21 04:30:33,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 04:30:33,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,612 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 04:30:33,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,620 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,621 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 04:30:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,639 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:30:33,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,648 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,648 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 04:30:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,679 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:30:33,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,693 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,694 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 04:30:33,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,712 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 04:30:33,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,720 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,720 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 04:30:33,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,751 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 04:30:33,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,760 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,761 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 04:30:33,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,779 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 04:30:33,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,787 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,787 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,815 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 04:30:33,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,823 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,824 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 04:30:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,851 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 04:30:33,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,860 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,861 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,879 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:30:33,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,887 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,888 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:33,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,907 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:30:33,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,918 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:33,919 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:33,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 04:30:33,948 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-02-21 04:30:33,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,949 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 04:30:33,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,957 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:33,959 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:33,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:33,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:33,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 04:30:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:33,985 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:33,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 04:30:33,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:33,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:33,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:33,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:33,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:33,996 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:33,998 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:33,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,016 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 04:30:34,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,025 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,025 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 04:30:34,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,042 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:30:34,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,050 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,051 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,070 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:30:34,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,078 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,080 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,099 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:30:34,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,107 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,108 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,131 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 04:30:34,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,141 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,142 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 04:30:34,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,160 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:30:34,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,172 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:34,172 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,351 INFO L401 nArgumentSynthesizer]: We have 80 Motzkin's Theorem applications. [2022-02-21 04:30:34,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-02-21 04:30:34,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,653 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:30:34,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,662 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,663 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 04:30:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,682 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:30:34,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,690 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,690 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,707 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 04:30:34,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,715 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,715 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,733 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 04:30:34,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,741 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,741 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,758 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 04:30:34,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,765 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,766 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,785 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 04:30:34,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,792 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,792 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 04:30:34,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,811 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 04:30:34,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,819 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,819 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,836 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 04:30:34,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,844 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,845 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 04:30:34,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,863 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 04:30:34,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,871 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,872 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-02-21 04:30:34,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,891 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 04:30:34,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:34,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,899 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:34,900 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:34,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-02-21 04:30:34,916 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-02-21 04:30:34,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,917 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 04:30:34,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,924 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:34,924 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:34,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,924 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:34,925 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:34,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-02-21 04:30:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,944 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 04:30:34,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,951 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:34,951 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:34,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,951 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:34,952 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:34,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,970 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 04:30:34,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:34,978 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:34,978 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:34,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:34,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:34,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:34,978 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:34,978 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:34,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:34,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:34,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:34,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:34,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:34,995 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:34,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 04:30:34,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,002 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,002 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,003 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,004 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 04:30:35,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,022 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 04:30:35,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,029 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,029 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,029 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,030 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:35,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,050 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 04:30:35,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,057 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,057 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,057 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,057 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 04:30:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,074 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 04:30:35,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,081 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,081 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,081 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,082 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-02-21 04:30:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,100 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-02-21 04:30:35,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,109 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,109 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,110 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:35,110 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,243 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-02-21 04:30:35,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:35,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,618 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-02-21 04:30:35,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,625 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,626 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,626 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,627 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-02-21 04:30:35,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,645 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-02-21 04:30:35,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,652 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,652 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,653 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,653 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:35,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,670 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-02-21 04:30:35,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,677 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,677 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,677 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,678 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-02-21 04:30:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,703 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-02-21 04:30:35,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,710 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,710 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,710 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,711 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,753 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-02-21 04:30:35,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,760 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,760 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,760 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,761 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-02-21 04:30:35,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,810 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-02-21 04:30:35,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,817 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,818 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,818 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,818 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-02-21 04:30:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,835 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-02-21 04:30:35,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,842 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,842 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,843 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,843 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-02-21 04:30:35,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,860 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-02-21 04:30:35,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,867 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,868 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,868 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,879 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-02-21 04:30:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,898 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-02-21 04:30:35,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,906 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,906 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,906 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,907 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-02-21 04:30:35,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,926 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-02-21 04:30:35,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,934 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,934 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:35,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,934 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:30:35,935 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:30:35,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-02-21 04:30:35,952 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-02-21 04:30:35,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,953 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-02-21 04:30:35,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:35,961 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:35,961 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:35,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:35,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:35,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:35,961 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:35,968 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:35,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:35,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:35,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-02-21 04:30:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:35,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:35,996 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:35,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-02-21 04:30:35,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,004 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,004 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,004 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,005 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-02-21 04:30:36,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,025 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-02-21 04:30:36,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,032 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,032 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,033 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,033 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:36,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,051 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-02-21 04:30:36,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,058 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,058 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,059 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,060 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-02-21 04:30:36,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,080 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-02-21 04:30:36,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,087 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,087 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,087 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,089 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,110 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-02-21 04:30:36,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,117 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,117 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,117 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,117 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-02-21 04:30:36,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,135 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-02-21 04:30:36,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,142 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,142 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,142 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,144 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-02-21 04:30:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,163 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-02-21 04:30:36,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,172 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,172 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,173 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:36,173 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,359 INFO L401 nArgumentSynthesizer]: We have 64 Motzkin's Theorem applications. [2022-02-21 04:30:36,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:36,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,954 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-02-21 04:30:36,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,969 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,969 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,970 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,971 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:36,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:36,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-02-21 04:30:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,990 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:36,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-02-21 04:30:36,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:36,998 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:36,998 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:36,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:36,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:36,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:36,999 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:36,999 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:36,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-02-21 04:30:37,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,017 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-02-21 04:30:37,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,025 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,025 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,025 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,026 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-02-21 04:30:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,043 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-02-21 04:30:37,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,051 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,052 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,052 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,052 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-02-21 04:30:37,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,070 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-02-21 04:30:37,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,078 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,078 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,079 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,080 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-02-21 04:30:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,101 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-02-21 04:30:37,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,108 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,109 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,109 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,109 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,127 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-02-21 04:30:37,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,134 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,135 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,135 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,135 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-02-21 04:30:37,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,153 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-02-21 04:30:37,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,161 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,161 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,161 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,162 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,183 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-02-21 04:30:37,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,190 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,190 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,190 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,192 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,212 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-02-21 04:30:37,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,220 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,220 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:30:37,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,220 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:37,221 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:37,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,239 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-02-21 04:30:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,240 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-02-21 04:30:37,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,247 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,247 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,248 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,249 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-02-21 04:30:37,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,282 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-02-21 04:30:37,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,289 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,289 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,289 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,291 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-02-21 04:30:37,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,312 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-02-21 04:30:37,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,319 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,319 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,319 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,320 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-02-21 04:30:37,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,338 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-02-21 04:30:37,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,345 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,345 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,345 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,347 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,368 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-02-21 04:30:37,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,375 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,376 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,376 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,378 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,401 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-02-21 04:30:37,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,409 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,409 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,409 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,410 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:37,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,428 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-02-21 04:30:37,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,435 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,436 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:37,436 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,438 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:37,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:37,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:37,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-02-21 04:30:37,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:37,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:37,475 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:37,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-02-21 04:30:37,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:37,485 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:37,485 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:37,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:37,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:37,485 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:37,486 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:37,742 INFO L401 nArgumentSynthesizer]: We have 80 Motzkin's Theorem applications. [2022-02-21 04:30:37,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-02-21 04:30:38,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,728 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-02-21 04:30:38,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,735 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,735 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,736 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,737 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-02-21 04:30:38,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,758 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-02-21 04:30:38,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,765 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,765 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,765 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,766 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:38,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,795 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-02-21 04:30:38,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,803 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,803 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,804 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,805 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-02-21 04:30:38,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,823 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-02-21 04:30:38,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,831 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,831 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,832 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,832 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-02-21 04:30:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,851 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-02-21 04:30:38,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,858 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,859 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,859 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,860 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,882 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-02-21 04:30:38,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,890 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,890 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,890 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,891 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-02-21 04:30:38,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,911 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-02-21 04:30:38,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,918 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,918 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,919 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,919 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,938 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-02-21 04:30:38,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,945 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,945 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,945 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,947 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:38,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:38,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:38,968 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:38,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-02-21 04:30:38,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:38,976 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:38,976 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:38,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:38,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:38,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:38,977 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:38,978 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:38,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:38,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-02-21 04:30:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,002 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-02-21 04:30:39,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,011 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,011 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:39,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,011 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:30:39,012 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:30:39,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-02-21 04:30:39,033 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-02-21 04:30:39,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,034 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-02-21 04:30:39,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,041 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,041 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,042 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,043 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,061 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-02-21 04:30:39,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,069 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,069 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,069 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,080 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-02-21 04:30:39,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,099 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-02-21 04:30:39,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,107 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,107 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,107 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,107 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-02-21 04:30:39,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,124 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-02-21 04:30:39,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,132 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,132 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,132 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,134 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,152 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-02-21 04:30:39,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,159 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,159 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,159 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,161 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,180 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-02-21 04:30:39,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,188 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,188 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,188 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,189 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-02-21 04:30:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,206 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-02-21 04:30:39,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,213 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,213 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,213 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,214 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,232 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-02-21 04:30:39,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,241 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,241 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,241 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:39,241 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,420 INFO L401 nArgumentSynthesizer]: We have 64 Motzkin's Theorem applications. [2022-02-21 04:30:39,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,830 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-02-21 04:30:39,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,837 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,837 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,837 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,842 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-02-21 04:30:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,860 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-02-21 04:30:39,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,867 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,867 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,868 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,868 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-02-21 04:30:39,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,884 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-02-21 04:30:39,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,891 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,891 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,891 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,892 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,922 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-02-21 04:30:39,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,929 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,929 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,930 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,930 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:39,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,946 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-02-21 04:30:39,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,953 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,953 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,953 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,954 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-02-21 04:30:39,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,973 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-02-21 04:30:39,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:39,979 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:39,979 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:39,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:39,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:39,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:39,979 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:39,980 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:39,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:39,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:39,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-02-21 04:30:39,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:39,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:39,997 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:39,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-02-21 04:30:39,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,003 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,004 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:40,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,004 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:40,004 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:40,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-02-21 04:30:40,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,029 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-02-21 04:30:40,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,036 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,036 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:40,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,036 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:40,037 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:40,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-02-21 04:30:40,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,055 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-02-21 04:30:40,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,063 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,063 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:40,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,063 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:40,064 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:40,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,083 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-02-21 04:30:40,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,091 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,091 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:30:40,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,091 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:30:40,092 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:40,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,108 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-02-21 04:30:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,109 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-02-21 04:30:40,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,116 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,116 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,117 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,150 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,169 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,169 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,169 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-02-21 04:30:40,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,199 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-02-21 04:30:40,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,207 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,207 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,208 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,240 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-02-21 04:30:40,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,248 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,248 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,248 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,282 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,293 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,293 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,293 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-02-21 04:30:40,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,325 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-02-21 04:30:40,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,333 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,333 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,333 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,366 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-02-21 04:30:40,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,373 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,374 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:40,374 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:40,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:40,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:40,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:40,397 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-02-21 04:30:40,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:40,406 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:40,406 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:40,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:40,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:40,407 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 04:30:40,407 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:40,686 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2022-02-21 04:30:40,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,544 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-02-21 04:30:41,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,594 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,594 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,594 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2022-02-21 04:30:41,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,616 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-02-21 04:30:41,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,624 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,624 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,624 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2022-02-21 04:30:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,643 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-02-21 04:30:41,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,650 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,651 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,651 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,670 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-02-21 04:30:41,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,677 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,677 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,677 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,696 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-02-21 04:30:41,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,704 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,704 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,704 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-02-21 04:30:41,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,726 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-02-21 04:30:41,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,734 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,734 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,734 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-02-21 04:30:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,753 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-02-21 04:30:41,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,761 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,761 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,762 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:41,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,781 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-02-21 04:30:41,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,788 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,788 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,788 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-02-21 04:30:41,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,811 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-02-21 04:30:41,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,818 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,819 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,819 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-02-21 04:30:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:41,841 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:41,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-02-21 04:30:41,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:41,850 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:30:41,850 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:30:41,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:41,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:41,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:41,850 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:30:41,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:30:41,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:41,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:41,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2022-02-21 04:30:41,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:41,869 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,031 INFO L93 Difference]: Finished difference Result 215 states and 301 transitions. [2022-02-21 04:30:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:42,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:42,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 301 transitions. [2022-02-21 04:30:42,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 169 [2022-02-21 04:30:42,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 215 states and 301 transitions. [2022-02-21 04:30:42,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2022-02-21 04:30:42,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2022-02-21 04:30:42,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 301 transitions. [2022-02-21 04:30:42,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:42,093 INFO L681 BuchiCegarLoop]: Abstraction has 215 states and 301 transitions. [2022-02-21 04:30:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 301 transitions. [2022-02-21 04:30:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-02-21 04:30:42,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:42,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states and 301 transitions. Second operand has 215 states, 215 states have (on average 1.4) internal successors, (301), 214 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,105 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states and 301 transitions. Second operand has 215 states, 215 states have (on average 1.4) internal successors, (301), 214 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,105 INFO L87 Difference]: Start difference. First operand 215 states and 301 transitions. Second operand has 215 states, 215 states have (on average 1.4) internal successors, (301), 214 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,109 INFO L93 Difference]: Finished difference Result 215 states and 301 transitions. [2022-02-21 04:30:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 301 transitions. [2022-02-21 04:30:42,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:42,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:42,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 215 states have (on average 1.4) internal successors, (301), 214 states have internal predecessors, (301), 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 215 states and 301 transitions. [2022-02-21 04:30:42,110 INFO L87 Difference]: Start difference. First operand has 215 states, 215 states have (on average 1.4) internal successors, (301), 214 states have internal predecessors, (301), 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 215 states and 301 transitions. [2022-02-21 04:30:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,114 INFO L93 Difference]: Finished difference Result 215 states and 301 transitions. [2022-02-21 04:30:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 301 transitions. [2022-02-21 04:30:42,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:42,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:42,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:42,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.4) internal successors, (301), 214 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 301 transitions. [2022-02-21 04:30:42,118 INFO L704 BuchiCegarLoop]: Abstraction has 215 states and 301 transitions. [2022-02-21 04:30:42,118 INFO L587 BuchiCegarLoop]: Abstraction has 215 states and 301 transitions. [2022-02-21 04:30:42,118 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:30:42,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 301 transitions. [2022-02-21 04:30:42,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 169 [2022-02-21 04:30:42,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:42,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:42,131 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, 1] [2022-02-21 04:30:42,132 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-02-21 04:30:42,133 INFO L791 eck$LassoCheckResult]: Stem: 1946#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 1880#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1881#L230 assume 0 == ~r1~0 % 256; 1922#L231 assume ~id1~0 >= 0; 1928#L232 assume 0 == ~st1~0; 1911#L233 assume ~send1~0 == ~id1~0; 1912#L234 assume 0 == ~mode1~0 % 256; 1921#L235 assume ~id2~0 >= 0; 1904#L236 assume 0 == ~st2~0; 1905#L237 assume ~send2~0 == ~id2~0; 1864#L238 assume 0 == ~mode2~0 % 256; 1865#L239 assume ~id3~0 >= 0; 1862#L240 assume 0 == ~st3~0; 1863#L241 assume ~send3~0 == ~id3~0; 1867#L242 assume 0 == ~mode3~0 % 256; 1927#L243 assume ~id4~0 >= 0; 1843#L244 assume 0 == ~st4~0; 1844#L245 assume ~send4~0 == ~id4~0; 1866#L246 assume 0 == ~mode4~0 % 256; 1910#L247 assume ~id5~0 >= 0; 1939#L248 assume 0 == ~st5~0; 1839#L249 assume ~send5~0 == ~id5~0; 1840#L250 assume 0 == ~mode5~0 % 256; 1929#L251 assume ~id6~0 >= 0; 1892#L252 assume 0 == ~st6~0; 1893#L253 assume ~send6~0 == ~id6~0; 1899#L254 assume 0 == ~mode6~0 % 256; 1856#L255 assume ~id1~0 != ~id2~0; 1857#L256 assume ~id1~0 != ~id3~0; 1894#L257 assume ~id1~0 != ~id4~0; 1868#L258 assume ~id1~0 != ~id5~0; 1869#L259 assume ~id1~0 != ~id6~0; 1913#L260 assume ~id2~0 != ~id3~0; 1914#L261 assume ~id2~0 != ~id4~0; 1900#L262 assume ~id2~0 != ~id5~0; 1901#L263 assume ~id2~0 != ~id6~0; 1906#L264 assume ~id3~0 != ~id4~0; 1907#L265 assume ~id3~0 != ~id5~0; 1850#L266 assume ~id3~0 != ~id6~0; 1851#L267 assume ~id4~0 != ~id5~0; 1860#L268 assume ~id4~0 != ~id6~0; 1861#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 1908#L230-1 init_#res#1 := init_~tmp~0#1; 1932#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 1889#L24 assume !(0 == assume_abort_if_not_~cond#1); 1852#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1853#L469-2 [2022-02-21 04:30:42,133 INFO L793 eck$LassoCheckResult]: Loop: 1853#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1997#L80 assume !(0 != ~mode1~0 % 256); 1996#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 1938#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 1858#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1859#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1942#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 1919#L109-1 ~mode2~0 := 0; 1885#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1882#L131 assume !(0 != ~mode3~0 % 256); 1841#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 1842#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 1891#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1935#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1923#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 1896#L159-1 ~mode4~0 := 0; 1878#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1879#L181 assume !(0 != ~mode5~0 % 256); 1933#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1936#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 1886#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1887#L206 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 2017#L209 assume !(node6_~m6~0#1 != ~nomsg~0); 1952#L209-1 ~mode6~0 := 0; 1920#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1915#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1916#L400 assume ~r1~0 % 256 >= 6; 1926#L404 assume !(~r1~0 % 256 < 6); 1940#L408 assume 1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0;check_~tmp~1#1 := 1; 1941#L399-1 check_#res#1 := check_~tmp~1#1; 2026#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 2024#L501 assume !(0 == assert_~arg#1 % 256); 2022#L496 assume { :end_inline_assert } true; 2020#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1953#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1945#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 1877#L84-1 ~mode1~0 := 0; 1949#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 2048#L106 assume !(0 != ~mode2~0 % 256); 2049#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 2043#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 2042#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 2040#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 2039#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 2036#L134-1 ~mode3~0 := 0; 2034#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 2032#L156 assume !(0 != ~mode4~0 % 256); 2033#L169 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 2027#L169-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 2025#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 2023#L181 assume !(0 != ~mode5~0 % 256); 2021#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 2019#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 2018#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1870#L206 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1872#L209 assume !(node6_~m6~0#1 != ~nomsg~0); 1846#L209-1 ~mode6~0 := 0; 2013#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2012#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 2011#L400 assume !(~r1~0 % 256 >= 6); 2010#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 2008#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 2006#L399-1 check_#res#1 := check_~tmp~1#1; 2004#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 2002#L501 assume !(0 == assert_~arg#1 % 256); 2000#L496 assume { :end_inline_assert } true; 1853#L469-2 [2022-02-21 04:30:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 4 times [2022-02-21 04:30:42,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:42,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961085865] [2022-02-21 04:30:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:42,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:42,160 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -513817246, now seen corresponding path program 1 times [2022-02-21 04:30:42,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:42,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966755615] [2022-02-21 04:30:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:42,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {2487#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {2487#true} assume !(0 != ~mode1~0 % 256); {2487#true} is VALID [2022-02-21 04:30:42,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {2487#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {2487#true} is VALID [2022-02-21 04:30:42,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {2487#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2487#true} is VALID [2022-02-21 04:30:42,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {2487#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {2487#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {2487#true} assume !(node2_~m2~0#1 != ~nomsg~0); {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {2487#true} ~mode2~0 := 0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {2487#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {2487#true} assume !(0 != ~mode3~0 % 256); {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {2487#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {2487#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {2487#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {2487#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {2487#true} assume !(node4_~m4~0#1 != ~nomsg~0); {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {2487#true} ~mode4~0 := 0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {2487#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {2487#true} assume !(0 != ~mode5~0 % 256); {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {2487#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {2487#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {2487#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {2487#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2487#true} is VALID [2022-02-21 04:30:42,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {2487#true} assume !(node6_~m6~0#1 != ~nomsg~0); {2487#true} is VALID [2022-02-21 04:30:42,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {2487#true} ~mode6~0 := 0; {2487#true} is VALID [2022-02-21 04:30:42,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2487#true} is VALID [2022-02-21 04:30:42,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {2487#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {2487#true} is VALID [2022-02-21 04:30:42,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#true} assume ~r1~0 % 256 >= 6; {2487#true} is VALID [2022-02-21 04:30:42,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {2487#true} assume !(~r1~0 % 256 < 6); {2487#true} is VALID [2022-02-21 04:30:42,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {2487#true} assume 1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0;check_~tmp~1#1 := 1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} check_#res#1 := check_~tmp~1#1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(0 == assert_~arg#1 % 256); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_assert } true; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(node1_~m1~0#1 != ~nomsg~0); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} ~mode1~0 := 0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(0 != ~mode2~0 % 256); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(node3_~m3~0#1 != ~nomsg~0); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} ~mode3~0 := 0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(0 != ~mode4~0 % 256); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(0 != ~mode5~0 % 256); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,217 INFO L290 TraceCheckUtils]: 53: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,218 INFO L290 TraceCheckUtils]: 55: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(node6_~m6~0#1 != ~nomsg~0); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} ~mode6~0 := 0; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume !(~r1~0 % 256 >= 6); {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} is VALID [2022-02-21 04:30:42,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {2489#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {2488#false} is VALID [2022-02-21 04:30:42,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {2488#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {2488#false} is VALID [2022-02-21 04:30:42,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {2488#false} check_#res#1 := check_~tmp~1#1; {2488#false} is VALID [2022-02-21 04:30:42,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {2488#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {2488#false} is VALID [2022-02-21 04:30:42,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {2488#false} assume !(0 == assert_~arg#1 % 256); {2488#false} is VALID [2022-02-21 04:30:42,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {2488#false} assume { :end_inline_assert } true; {2488#false} is VALID [2022-02-21 04:30:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:42,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:42,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966755615] [2022-02-21 04:30:42,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966755615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:42,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:42,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:42,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134582201] [2022-02-21 04:30:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:42,226 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:42,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:42,227 INFO L87 Difference]: Start difference. First operand 215 states and 301 transitions. cyclomatic complexity: 87 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,375 INFO L93 Difference]: Finished difference Result 303 states and 437 transitions. [2022-02-21 04:30:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:42,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:42,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 437 transitions. [2022-02-21 04:30:42,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2022-02-21 04:30:42,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 302 states and 436 transitions. [2022-02-21 04:30:42,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2022-02-21 04:30:42,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2022-02-21 04:30:42,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 436 transitions. [2022-02-21 04:30:42,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:42,435 INFO L681 BuchiCegarLoop]: Abstraction has 302 states and 436 transitions. [2022-02-21 04:30:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 436 transitions. [2022-02-21 04:30:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 262. [2022-02-21 04:30:42,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:42,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states and 436 transitions. Second operand has 262 states, 262 states have (on average 1.4351145038167938) internal successors, (376), 261 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,440 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states and 436 transitions. Second operand has 262 states, 262 states have (on average 1.4351145038167938) internal successors, (376), 261 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,440 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 262 states, 262 states have (on average 1.4351145038167938) internal successors, (376), 261 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,446 INFO L93 Difference]: Finished difference Result 302 states and 436 transitions. [2022-02-21 04:30:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2022-02-21 04:30:42,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:42,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:42,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 262 states have (on average 1.4351145038167938) internal successors, (376), 261 states have internal predecessors, (376), 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 302 states and 436 transitions. [2022-02-21 04:30:42,447 INFO L87 Difference]: Start difference. First operand has 262 states, 262 states have (on average 1.4351145038167938) internal successors, (376), 261 states have internal predecessors, (376), 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 302 states and 436 transitions. [2022-02-21 04:30:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,453 INFO L93 Difference]: Finished difference Result 302 states and 436 transitions. [2022-02-21 04:30:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2022-02-21 04:30:42,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:42,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:42,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:42,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 262 states have (on average 1.4351145038167938) internal successors, (376), 261 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 376 transitions. [2022-02-21 04:30:42,458 INFO L704 BuchiCegarLoop]: Abstraction has 262 states and 376 transitions. [2022-02-21 04:30:42,458 INFO L587 BuchiCegarLoop]: Abstraction has 262 states and 376 transitions. [2022-02-21 04:30:42,458 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:30:42,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 376 transitions. [2022-02-21 04:30:42,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 216 [2022-02-21 04:30:42,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:42,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:42,460 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, 1] [2022-02-21 04:30:42,460 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:42,460 INFO L791 eck$LassoCheckResult]: Stem: 2898#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 2835#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 2836#L230 assume 0 == ~r1~0 % 256; 2879#L231 assume ~id1~0 >= 0; 2881#L232 assume 0 == ~st1~0; 2865#L233 assume ~send1~0 == ~id1~0; 2866#L234 assume 0 == ~mode1~0 % 256; 2875#L235 assume ~id2~0 >= 0; 2858#L236 assume 0 == ~st2~0; 2859#L237 assume ~send2~0 == ~id2~0; 2820#L238 assume 0 == ~mode2~0 % 256; 2821#L239 assume ~id3~0 >= 0; 2818#L240 assume 0 == ~st3~0; 2819#L241 assume ~send3~0 == ~id3~0; 2823#L242 assume 0 == ~mode3~0 % 256; 2880#L243 assume ~id4~0 >= 0; 2799#L244 assume 0 == ~st4~0; 2800#L245 assume ~send4~0 == ~id4~0; 2822#L246 assume 0 == ~mode4~0 % 256; 2864#L247 assume ~id5~0 >= 0; 2893#L248 assume 0 == ~st5~0; 2795#L249 assume ~send5~0 == ~id5~0; 2796#L250 assume 0 == ~mode5~0 % 256; 2882#L251 assume ~id6~0 >= 0; 2846#L252 assume 0 == ~st6~0; 2847#L253 assume ~send6~0 == ~id6~0; 2853#L254 assume 0 == ~mode6~0 % 256; 2812#L255 assume ~id1~0 != ~id2~0; 2813#L256 assume ~id1~0 != ~id3~0; 2848#L257 assume ~id1~0 != ~id4~0; 2824#L258 assume ~id1~0 != ~id5~0; 2825#L259 assume ~id1~0 != ~id6~0; 2867#L260 assume ~id2~0 != ~id3~0; 2868#L261 assume ~id2~0 != ~id4~0; 2854#L262 assume ~id2~0 != ~id5~0; 2855#L263 assume ~id2~0 != ~id6~0; 2860#L264 assume ~id3~0 != ~id4~0; 2861#L265 assume ~id3~0 != ~id5~0; 2806#L266 assume ~id3~0 != ~id6~0; 2807#L267 assume ~id4~0 != ~id5~0; 2816#L268 assume ~id4~0 != ~id6~0; 2817#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 2862#L230-1 init_#res#1 := init_~tmp~0#1; 2885#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 2843#L24 assume !(0 == assume_abort_if_not_~cond#1); 2808#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 2809#L469-2 [2022-02-21 04:30:42,460 INFO L793 eck$LassoCheckResult]: Loop: 2809#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 2974#L80 assume !(0 != ~mode1~0 % 256); 2972#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 2971#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 2970#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 2969#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 2966#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 2964#L109-1 ~mode2~0 := 0; 2962#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 2961#L131 assume !(0 != ~mode3~0 % 256); 2960#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 2955#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 2954#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 2953#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 2951#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 2948#L159-1 ~mode4~0 := 0; 2946#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 2945#L181 assume !(0 != ~mode5~0 % 256); 2944#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 2939#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 2938#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 2937#L206 assume !(0 != ~mode6~0 % 256); 2916#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 2917#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 2909#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2910#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 2902#L400 assume !(~r1~0 % 256 >= 6); 2903#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 2932#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 2933#L399-1 check_#res#1 := check_~tmp~1#1; 2924#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 2925#L501 assume !(0 == assert_~arg#1 % 256); 2977#L496 assume { :end_inline_assert } true; 2975#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 2973#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 2897#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 2832#L84-1 ~mode1~0 := 0; 3046#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 3042#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 3034#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 3029#L109-1 ~mode2~0 := 0; 3026#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 3024#L131 assume !(0 != ~mode3~0 % 256); 3018#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 3013#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 3011#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 3010#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 3009#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 2996#L159-1 ~mode4~0 := 0; 2992#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 2990#L181 assume !(0 != ~mode5~0 % 256); 2983#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 2981#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 2931#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 2926#L206 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 2928#L209 assume !(node6_~m6~0#1 != ~nomsg~0); 2914#L209-1 ~mode6~0 := 0; 2913#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2906#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 2907#L400 assume !(~r1~0 % 256 >= 6); 2851#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 2852#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 2980#L399-1 check_#res#1 := check_~tmp~1#1; 2979#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 2978#L501 assume !(0 == assert_~arg#1 % 256); 2976#L496 assume { :end_inline_assert } true; 2809#L469-2 [2022-02-21 04:30:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 5 times [2022-02-21 04:30:42,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:42,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265887654] [2022-02-21 04:30:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:42,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:42,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:42,481 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -908371157, now seen corresponding path program 1 times [2022-02-21 04:30:42,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:42,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427687171] [2022-02-21 04:30:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:42,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {3664#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3664#true} is VALID [2022-02-21 04:30:42,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {3664#true} assume !(0 != ~mode1~0 % 256); {3664#true} is VALID [2022-02-21 04:30:42,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {3664#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {3664#true} is VALID [2022-02-21 04:30:42,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {3664#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3664#true} is VALID [2022-02-21 04:30:42,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {3664#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3664#true} is VALID [2022-02-21 04:30:42,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {3664#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3664#true} is VALID [2022-02-21 04:30:42,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {3664#true} assume !(node2_~m2~0#1 != ~nomsg~0); {3664#true} is VALID [2022-02-21 04:30:42,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {3664#true} ~mode2~0 := 0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(0 != ~mode3~0 % 256); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(node4_~m4~0#1 != ~nomsg~0); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} ~mode4~0 := 0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(0 != ~mode5~0 % 256); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(0 != ~mode6~0 % 256); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(~r1~0 % 256 >= 6); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} check_#res#1 := check_~tmp~1#1; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(0 == assert_~arg#1 % 256); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_assert } true; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume !(node1_~m1~0#1 != ~nomsg~0); {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} ~mode1~0 := 0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {3666#(and (<= ~mode2~0 (* 256 (div ~mode2~0 256))) (not (<= (+ (div ~mode2~0 256) 1) 0)))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {3665#false} assume !(node2_~m2~0#1 != ~nomsg~0); {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {3665#false} ~mode2~0 := 0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {3665#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {3665#false} assume !(0 != ~mode3~0 % 256); {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {3665#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {3665#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {3665#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {3665#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {3665#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {3665#false} ~mode4~0 := 0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {3665#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {3665#false} assume !(0 != ~mode5~0 % 256); {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {3665#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {3665#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {3665#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {3665#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3665#false} is VALID [2022-02-21 04:30:42,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {3665#false} assume !(node6_~m6~0#1 != ~nomsg~0); {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {3665#false} ~mode6~0 := 0; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {3665#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {3665#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {3665#false} assume !(~r1~0 % 256 >= 6); {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {3665#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {3665#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {3665#false} check_#res#1 := check_~tmp~1#1; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {3665#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {3665#false} assume !(0 == assert_~arg#1 % 256); {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {3665#false} assume { :end_inline_assert } true; {3665#false} is VALID [2022-02-21 04:30:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:42,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:42,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427687171] [2022-02-21 04:30:42,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427687171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:42,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:42,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:42,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532924278] [2022-02-21 04:30:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:42,559 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:42,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:42,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:42,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:42,559 INFO L87 Difference]: Start difference. First operand 262 states and 376 transitions. cyclomatic complexity: 115 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,696 INFO L93 Difference]: Finished difference Result 462 states and 674 transitions. [2022-02-21 04:30:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:42,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:42,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 462 states and 674 transitions. [2022-02-21 04:30:42,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 416 [2022-02-21 04:30:42,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 462 states to 462 states and 674 transitions. [2022-02-21 04:30:42,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 462 [2022-02-21 04:30:42,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 462 [2022-02-21 04:30:42,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 462 states and 674 transitions. [2022-02-21 04:30:42,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:42,807 INFO L681 BuchiCegarLoop]: Abstraction has 462 states and 674 transitions. [2022-02-21 04:30:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 674 transitions. [2022-02-21 04:30:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 454. [2022-02-21 04:30:42,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:42,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states and 674 transitions. Second operand has 454 states, 454 states have (on average 1.4581497797356828) internal successors, (662), 453 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,814 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states and 674 transitions. Second operand has 454 states, 454 states have (on average 1.4581497797356828) internal successors, (662), 453 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,815 INFO L87 Difference]: Start difference. First operand 462 states and 674 transitions. Second operand has 454 states, 454 states have (on average 1.4581497797356828) internal successors, (662), 453 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,822 INFO L93 Difference]: Finished difference Result 462 states and 674 transitions. [2022-02-21 04:30:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 674 transitions. [2022-02-21 04:30:42,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:42,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:42,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 454 states, 454 states have (on average 1.4581497797356828) internal successors, (662), 453 states have internal predecessors, (662), 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 462 states and 674 transitions. [2022-02-21 04:30:42,824 INFO L87 Difference]: Start difference. First operand has 454 states, 454 states have (on average 1.4581497797356828) internal successors, (662), 453 states have internal predecessors, (662), 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 462 states and 674 transitions. [2022-02-21 04:30:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:42,831 INFO L93 Difference]: Finished difference Result 462 states and 674 transitions. [2022-02-21 04:30:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 674 transitions. [2022-02-21 04:30:42,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:42,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:42,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:42,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 454 states have (on average 1.4581497797356828) internal successors, (662), 453 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 662 transitions. [2022-02-21 04:30:42,839 INFO L704 BuchiCegarLoop]: Abstraction has 454 states and 662 transitions. [2022-02-21 04:30:42,839 INFO L587 BuchiCegarLoop]: Abstraction has 454 states and 662 transitions. [2022-02-21 04:30:42,839 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:30:42,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 454 states and 662 transitions. [2022-02-21 04:30:42,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 408 [2022-02-21 04:30:42,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:42,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:42,842 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, 1] [2022-02-21 04:30:42,842 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:42,842 INFO L791 eck$LassoCheckResult]: Stem: 4242#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 4172#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 4173#L230 assume 0 == ~r1~0 % 256; 4217#L231 assume ~id1~0 >= 0; 4221#L232 assume 0 == ~st1~0; 4203#L233 assume ~send1~0 == ~id1~0; 4204#L234 assume 0 == ~mode1~0 % 256; 4214#L235 assume ~id2~0 >= 0; 4196#L236 assume 0 == ~st2~0; 4197#L237 assume ~send2~0 == ~id2~0; 4156#L238 assume 0 == ~mode2~0 % 256; 4157#L239 assume ~id3~0 >= 0; 4154#L240 assume 0 == ~st3~0; 4155#L241 assume ~send3~0 == ~id3~0; 4159#L242 assume 0 == ~mode3~0 % 256; 4220#L243 assume ~id4~0 >= 0; 4135#L244 assume 0 == ~st4~0; 4136#L245 assume ~send4~0 == ~id4~0; 4158#L246 assume 0 == ~mode4~0 % 256; 4202#L247 assume ~id5~0 >= 0; 4233#L248 assume 0 == ~st5~0; 4131#L249 assume ~send5~0 == ~id5~0; 4132#L250 assume 0 == ~mode5~0 % 256; 4222#L251 assume ~id6~0 >= 0; 4183#L252 assume 0 == ~st6~0; 4184#L253 assume ~send6~0 == ~id6~0; 4191#L254 assume 0 == ~mode6~0 % 256; 4148#L255 assume ~id1~0 != ~id2~0; 4149#L256 assume ~id1~0 != ~id3~0; 4185#L257 assume ~id1~0 != ~id4~0; 4160#L258 assume ~id1~0 != ~id5~0; 4161#L259 assume ~id1~0 != ~id6~0; 4205#L260 assume ~id2~0 != ~id3~0; 4206#L261 assume ~id2~0 != ~id4~0; 4192#L262 assume ~id2~0 != ~id5~0; 4193#L263 assume ~id2~0 != ~id6~0; 4198#L264 assume ~id3~0 != ~id4~0; 4199#L265 assume ~id3~0 != ~id5~0; 4142#L266 assume ~id3~0 != ~id6~0; 4143#L267 assume ~id4~0 != ~id5~0; 4152#L268 assume ~id4~0 != ~id6~0; 4153#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 4200#L230-1 init_#res#1 := init_~tmp~0#1; 4225#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 4180#L24 assume !(0 == assume_abort_if_not_~cond#1); 4144#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 4145#L469-2 [2022-02-21 04:30:42,842 INFO L793 eck$LassoCheckResult]: Loop: 4145#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 4372#L80 assume !(0 != ~mode1~0 % 256); 4253#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 4258#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 4452#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 4450#L106 assume !(0 != ~mode2~0 % 256); 4448#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 4447#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 4446#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 4445#L131 assume !(0 != ~mode3~0 % 256); 4441#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 4439#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 4438#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 4436#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 4435#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 4432#L159-1 ~mode4~0 := 0; 4430#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 4429#L181 assume !(0 != ~mode5~0 % 256); 4425#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 4396#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 4394#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 4391#L206 assume !(0 != ~mode6~0 % 256); 4386#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 4382#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 4380#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 4378#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 4374#L400 assume !(~r1~0 % 256 >= 6); 4375#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 4377#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 4244#L399-1 check_#res#1 := check_~tmp~1#1; 4129#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 4130#L501 assume !(0 == assert_~arg#1 % 256); 4179#L496 assume { :end_inline_assert } true; 4165#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 4166#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 4252#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 4245#L84-1 ~mode1~0 := 0; 4246#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 4360#L106 assume !(0 != ~mode2~0 % 256); 4361#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 4176#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 4177#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 4559#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 4557#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 4507#L134-1 ~mode3~0 := 0; 4553#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 4552#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 4550#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 4498#L159-1 ~mode4~0 := 0; 4545#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 4544#L181 assume !(0 != ~mode5~0 % 256); 4539#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 4531#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 4529#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 4526#L206 assume !(0 != ~mode6~0 % 256); 4521#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 4518#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 4212#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 4213#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 4468#L400 assume !(~r1~0 % 256 >= 6); 4467#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 4465#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 4463#L399-1 check_#res#1 := check_~tmp~1#1; 4461#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 4459#L501 assume !(0 == assert_~arg#1 % 256); 4455#L496 assume { :end_inline_assert } true; 4145#L469-2 [2022-02-21 04:30:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 6 times [2022-02-21 04:30:42,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:42,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757293027] [2022-02-21 04:30:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:42,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:42,873 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1581480811, now seen corresponding path program 1 times [2022-02-21 04:30:42,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:42,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932879554] [2022-02-21 04:30:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:42,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {5512#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5512#true} is VALID [2022-02-21 04:30:42,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {5512#true} assume !(0 != ~mode1~0 % 256); {5512#true} is VALID [2022-02-21 04:30:42,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {5512#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {5512#true} is VALID [2022-02-21 04:30:42,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {5512#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {5512#true} is VALID [2022-02-21 04:30:42,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {5512#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5512#true} is VALID [2022-02-21 04:30:42,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {5512#true} assume !(0 != ~mode2~0 % 256); {5512#true} is VALID [2022-02-21 04:30:42,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {5512#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {5512#true} is VALID [2022-02-21 04:30:42,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {5512#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(0 != ~mode3~0 % 256); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(node4_~m4~0#1 != ~nomsg~0); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} ~mode4~0 := 0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(0 != ~mode5~0 % 256); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(0 != ~mode6~0 % 256); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(~r1~0 % 256 >= 6); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} check_#res#1 := check_~tmp~1#1; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(0 == assert_~arg#1 % 256); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_assert } true; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(node1_~m1~0#1 != ~nomsg~0); {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} ~mode1~0 := 0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} is VALID [2022-02-21 04:30:42,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {5514#(and (<= 1 ~mode2~0) (<= (div ~mode2~0 256) 0))} assume !(0 != ~mode2~0 % 256); {5513#false} is VALID [2022-02-21 04:30:42,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {5513#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {5513#false} is VALID [2022-02-21 04:30:42,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {5513#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {5513#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {5513#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {5513#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {5513#false} ~mode3~0 := 0; {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {5513#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {5513#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {5513#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5513#false} is VALID [2022-02-21 04:30:42,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {5513#false} ~mode4~0 := 0; {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {5513#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {5513#false} assume !(0 != ~mode5~0 % 256); {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {5513#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {5513#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {5513#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {5513#false} assume !(0 != ~mode6~0 % 256); {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 55: Hoare triple {5513#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {5513#false} is VALID [2022-02-21 04:30:42,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {5513#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {5513#false} is VALID [2022-02-21 04:30:42,962 INFO L290 TraceCheckUtils]: 57: Hoare triple {5513#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5513#false} is VALID [2022-02-21 04:30:42,962 INFO L290 TraceCheckUtils]: 58: Hoare triple {5513#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {5513#false} is VALID [2022-02-21 04:30:42,962 INFO L290 TraceCheckUtils]: 59: Hoare triple {5513#false} assume !(~r1~0 % 256 >= 6); {5513#false} is VALID [2022-02-21 04:30:42,962 INFO L290 TraceCheckUtils]: 60: Hoare triple {5513#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {5513#false} is VALID [2022-02-21 04:30:42,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {5513#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {5513#false} is VALID [2022-02-21 04:30:42,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {5513#false} check_#res#1 := check_~tmp~1#1; {5513#false} is VALID [2022-02-21 04:30:42,963 INFO L290 TraceCheckUtils]: 63: Hoare triple {5513#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {5513#false} is VALID [2022-02-21 04:30:42,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {5513#false} assume !(0 == assert_~arg#1 % 256); {5513#false} is VALID [2022-02-21 04:30:42,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {5513#false} assume { :end_inline_assert } true; {5513#false} is VALID [2022-02-21 04:30:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:42,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:42,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932879554] [2022-02-21 04:30:42,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932879554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:42,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:42,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:42,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217544794] [2022-02-21 04:30:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:42,971 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:42,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:42,973 INFO L87 Difference]: Start difference. First operand 454 states and 662 transitions. cyclomatic complexity: 209 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,132 INFO L93 Difference]: Finished difference Result 464 states and 673 transitions. [2022-02-21 04:30:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:43,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:43,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 464 states and 673 transitions. [2022-02-21 04:30:43,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 408 [2022-02-21 04:30:43,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 464 states to 464 states and 673 transitions. [2022-02-21 04:30:43,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 464 [2022-02-21 04:30:43,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 464 [2022-02-21 04:30:43,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 464 states and 673 transitions. [2022-02-21 04:30:43,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:43,194 INFO L681 BuchiCegarLoop]: Abstraction has 464 states and 673 transitions. [2022-02-21 04:30:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 673 transitions. [2022-02-21 04:30:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2022-02-21 04:30:43,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:43,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states and 673 transitions. Second operand has 460 states, 460 states have (on average 1.4478260869565218) internal successors, (666), 459 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,200 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states and 673 transitions. Second operand has 460 states, 460 states have (on average 1.4478260869565218) internal successors, (666), 459 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,201 INFO L87 Difference]: Start difference. First operand 464 states and 673 transitions. Second operand has 460 states, 460 states have (on average 1.4478260869565218) internal successors, (666), 459 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,209 INFO L93 Difference]: Finished difference Result 464 states and 673 transitions. [2022-02-21 04:30:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 673 transitions. [2022-02-21 04:30:43,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:43,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:43,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 460 states, 460 states have (on average 1.4478260869565218) internal successors, (666), 459 states have internal predecessors, (666), 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 464 states and 673 transitions. [2022-02-21 04:30:43,211 INFO L87 Difference]: Start difference. First operand has 460 states, 460 states have (on average 1.4478260869565218) internal successors, (666), 459 states have internal predecessors, (666), 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 464 states and 673 transitions. [2022-02-21 04:30:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,219 INFO L93 Difference]: Finished difference Result 464 states and 673 transitions. [2022-02-21 04:30:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 673 transitions. [2022-02-21 04:30:43,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:43,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:43,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:43,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 460 states have (on average 1.4478260869565218) internal successors, (666), 459 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 666 transitions. [2022-02-21 04:30:43,228 INFO L704 BuchiCegarLoop]: Abstraction has 460 states and 666 transitions. [2022-02-21 04:30:43,228 INFO L587 BuchiCegarLoop]: Abstraction has 460 states and 666 transitions. [2022-02-21 04:30:43,228 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:30:43,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 460 states and 666 transitions. [2022-02-21 04:30:43,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 408 [2022-02-21 04:30:43,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:43,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:43,230 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:43,230 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:43,231 INFO L791 eck$LassoCheckResult]: Stem: 6088#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 6020#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 6021#L230 assume 0 == ~r1~0 % 256; 6062#L231 assume ~id1~0 >= 0; 6068#L232 assume 0 == ~st1~0; 6051#L233 assume ~send1~0 == ~id1~0; 6052#L234 assume 0 == ~mode1~0 % 256; 6061#L235 assume ~id2~0 >= 0; 6044#L236 assume 0 == ~st2~0; 6045#L237 assume ~send2~0 == ~id2~0; 6006#L238 assume 0 == ~mode2~0 % 256; 6007#L239 assume ~id3~0 >= 0; 6004#L240 assume 0 == ~st3~0; 6005#L241 assume ~send3~0 == ~id3~0; 6009#L242 assume 0 == ~mode3~0 % 256; 6067#L243 assume ~id4~0 >= 0; 5985#L244 assume 0 == ~st4~0; 5986#L245 assume ~send4~0 == ~id4~0; 6008#L246 assume 0 == ~mode4~0 % 256; 6050#L247 assume ~id5~0 >= 0; 6080#L248 assume 0 == ~st5~0; 5981#L249 assume ~send5~0 == ~id5~0; 5982#L250 assume 0 == ~mode5~0 % 256; 6069#L251 assume ~id6~0 >= 0; 6031#L252 assume 0 == ~st6~0; 6032#L253 assume ~send6~0 == ~id6~0; 6039#L254 assume 0 == ~mode6~0 % 256; 5998#L255 assume ~id1~0 != ~id2~0; 5999#L256 assume ~id1~0 != ~id3~0; 6033#L257 assume ~id1~0 != ~id4~0; 6010#L258 assume ~id1~0 != ~id5~0; 6011#L259 assume ~id1~0 != ~id6~0; 6053#L260 assume ~id2~0 != ~id3~0; 6054#L261 assume ~id2~0 != ~id4~0; 6040#L262 assume ~id2~0 != ~id5~0; 6041#L263 assume ~id2~0 != ~id6~0; 6046#L264 assume ~id3~0 != ~id4~0; 6047#L265 assume ~id3~0 != ~id5~0; 5992#L266 assume ~id3~0 != ~id6~0; 5993#L267 assume ~id4~0 != ~id5~0; 6002#L268 assume ~id4~0 != ~id6~0; 6003#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 6048#L230-1 init_#res#1 := init_~tmp~0#1; 6074#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 6028#L24 assume !(0 == assume_abort_if_not_~cond#1); 5994#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 5995#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 5990#L80 assume !(0 != ~mode1~0 % 256); 5991#L94 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 6086#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 6386#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 6387#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 6083#L109 [2022-02-21 04:30:43,231 INFO L793 eck$LassoCheckResult]: Loop: 6083#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 6059#L109-1 ~mode2~0 := 0; 6034#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 6022#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 6023#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 6029#L134-1 ~mode3~0 := 0; 6030#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 6076#L156 assume !(0 != ~mode4~0 % 256); 6042#L169 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 6043#L169-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 6018#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 6019#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 6072#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 5997#L184-1 ~mode5~0 := 0; 6026#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 6012#L206 assume !(0 != ~mode6~0 % 256); 6013#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 6092#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 6060#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 6055#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 6056#L400 assume !(~r1~0 % 256 >= 6); 6093#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 6385#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 6384#L399-1 check_#res#1 := check_~tmp~1#1; 6383#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 6382#L501 assume !(0 == assert_~arg#1 % 256); 6381#L496 assume { :end_inline_assert } true; 6380#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 6378#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 6376#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 6372#L84-1 ~mode1~0 := 0; 6371#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 6370#L106 assume !(0 != ~mode2~0 % 256); 6369#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 6368#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 6367#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 6366#L131 assume !(0 != ~mode3~0 % 256); 6362#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 6361#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 6360#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 6359#L156 assume !(0 != ~mode4~0 % 256); 6355#L169 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 6352#L169-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 6350#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 6326#L181 assume !(0 != ~mode5~0 % 256); 6325#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 6317#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 6316#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 6312#L206 assume !(0 != ~mode6~0 % 256); 6311#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 6305#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 6302#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 6300#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 6296#L400 assume !(~r1~0 % 256 >= 6); 6297#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 6298#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 6392#L399-1 check_#res#1 := check_~tmp~1#1; 6435#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 6434#L501 assume !(0 == assert_~arg#1 % 256); 6433#L496 assume { :end_inline_assert } true; 6432#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 6431#L80 assume !(0 != ~mode1~0 % 256); 6095#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 6079#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 6000#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 6001#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 6083#L109 [2022-02-21 04:30:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1384643135, now seen corresponding path program 1 times [2022-02-21 04:30:43,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:43,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331172080] [2022-02-21 04:30:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:43,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {7370#true} 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {7370#true} is VALID [2022-02-21 04:30:43,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {7370#true} 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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7370#true} is VALID [2022-02-21 04:30:43,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {7370#true} assume 0 == ~r1~0 % 256; {7370#true} is VALID [2022-02-21 04:30:43,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {7370#true} assume ~id1~0 >= 0; {7370#true} is VALID [2022-02-21 04:30:43,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {7370#true} assume 0 == ~st1~0; {7370#true} is VALID [2022-02-21 04:30:43,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {7370#true} assume ~send1~0 == ~id1~0; {7370#true} is VALID [2022-02-21 04:30:43,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {7370#true} assume 0 == ~mode1~0 % 256; {7370#true} is VALID [2022-02-21 04:30:43,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {7370#true} assume ~id2~0 >= 0; {7370#true} is VALID [2022-02-21 04:30:43,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {7370#true} assume 0 == ~st2~0; {7370#true} is VALID [2022-02-21 04:30:43,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {7370#true} assume ~send2~0 == ~id2~0; {7370#true} is VALID [2022-02-21 04:30:43,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {7370#true} assume 0 == ~mode2~0 % 256; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:43,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {7372#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7371#false} is VALID [2022-02-21 04:30:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:43,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:43,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331172080] [2022-02-21 04:30:43,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331172080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:43,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:43,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:30:43,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020467370] [2022-02-21 04:30:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:43,282 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1764681363, now seen corresponding path program 1 times [2022-02-21 04:30:43,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:43,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293582290] [2022-02-21 04:30:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:43,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {7373#true} assume !(node2_~m2~0#1 != ~nomsg~0); {7373#true} is VALID [2022-02-21 04:30:43,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {7373#true} ~mode2~0 := 0; {7373#true} is VALID [2022-02-21 04:30:43,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {7373#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7373#true} is VALID [2022-02-21 04:30:43,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {7373#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7373#true} is VALID [2022-02-21 04:30:43,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {7373#true} assume !(node3_~m3~0#1 != ~nomsg~0); {7373#true} is VALID [2022-02-21 04:30:43,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {7373#true} ~mode3~0 := 0; {7373#true} is VALID [2022-02-21 04:30:43,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {7373#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {7373#true} is VALID [2022-02-21 04:30:43,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {7373#true} assume !(0 != ~mode4~0 % 256); {7373#true} is VALID [2022-02-21 04:30:43,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {7373#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {7373#true} is VALID [2022-02-21 04:30:43,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {7373#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(node5_~m5~0#1 != ~nomsg~0); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~mode5~0 := 0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode6~0 % 256); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(~r1~0 % 256 >= 6); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} check_#res#1 := check_~tmp~1#1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 == assert_~arg#1 % 256); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_assert } true; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(node1_~m1~0#1 != ~nomsg~0); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~mode1~0 := 0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode2~0 % 256); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode3~0 % 256); {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:30:43,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {7375#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode4~0 % 256); {7374#false} is VALID [2022-02-21 04:30:43,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {7374#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {7374#false} is VALID [2022-02-21 04:30:43,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {7374#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {7374#false} is VALID [2022-02-21 04:30:43,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {7374#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {7374#false} is VALID [2022-02-21 04:30:43,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {7374#false} assume !(0 != ~mode5~0 % 256); {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {7374#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {7374#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {7374#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {7374#false} assume !(0 != ~mode6~0 % 256); {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {7374#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {7374#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {7374#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {7374#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {7374#false} assume !(~r1~0 % 256 >= 6); {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {7374#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {7374#false} is VALID [2022-02-21 04:30:43,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {7374#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {7374#false} check_#res#1 := check_~tmp~1#1; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {7374#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {7374#false} assume !(0 == assert_~arg#1 % 256); {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {7374#false} assume { :end_inline_assert } true; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {7374#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {7374#false} assume !(0 != ~mode1~0 % 256); {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {7374#false} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {7374#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {7374#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7374#false} is VALID [2022-02-21 04:30:43,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {7374#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7374#false} is VALID [2022-02-21 04:30:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:43,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:43,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293582290] [2022-02-21 04:30:43,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293582290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:43,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:43,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:43,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075576262] [2022-02-21 04:30:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:43,352 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:43,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:43,353 INFO L87 Difference]: Start difference. First operand 460 states and 666 transitions. cyclomatic complexity: 207 Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,488 INFO L93 Difference]: Finished difference Result 460 states and 665 transitions. [2022-02-21 04:30:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:43,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:43,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 665 transitions. [2022-02-21 04:30:43,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 408 [2022-02-21 04:30:43,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 460 states and 665 transitions. [2022-02-21 04:30:43,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2022-02-21 04:30:43,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2022-02-21 04:30:43,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 460 states and 665 transitions. [2022-02-21 04:30:43,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:43,541 INFO L681 BuchiCegarLoop]: Abstraction has 460 states and 665 transitions. [2022-02-21 04:30:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states and 665 transitions. [2022-02-21 04:30:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 454. [2022-02-21 04:30:43,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:43,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 460 states and 665 transitions. Second operand has 454 states, 454 states have (on average 1.449339207048458) internal successors, (658), 453 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,547 INFO L74 IsIncluded]: Start isIncluded. First operand 460 states and 665 transitions. Second operand has 454 states, 454 states have (on average 1.449339207048458) internal successors, (658), 453 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,547 INFO L87 Difference]: Start difference. First operand 460 states and 665 transitions. Second operand has 454 states, 454 states have (on average 1.449339207048458) internal successors, (658), 453 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,554 INFO L93 Difference]: Finished difference Result 460 states and 665 transitions. [2022-02-21 04:30:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2022-02-21 04:30:43,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:43,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:43,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 454 states, 454 states have (on average 1.449339207048458) internal successors, (658), 453 states have internal predecessors, (658), 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 460 states and 665 transitions. [2022-02-21 04:30:43,556 INFO L87 Difference]: Start difference. First operand has 454 states, 454 states have (on average 1.449339207048458) internal successors, (658), 453 states have internal predecessors, (658), 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 460 states and 665 transitions. [2022-02-21 04:30:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,563 INFO L93 Difference]: Finished difference Result 460 states and 665 transitions. [2022-02-21 04:30:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2022-02-21 04:30:43,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:43,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:43,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:43,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 454 states have (on average 1.449339207048458) internal successors, (658), 453 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 658 transitions. [2022-02-21 04:30:43,572 INFO L704 BuchiCegarLoop]: Abstraction has 454 states and 658 transitions. [2022-02-21 04:30:43,572 INFO L587 BuchiCegarLoop]: Abstraction has 454 states and 658 transitions. [2022-02-21 04:30:43,572 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:30:43,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 454 states and 658 transitions. [2022-02-21 04:30:43,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 408 [2022-02-21 04:30:43,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:43,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:43,574 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, 1] [2022-02-21 04:30:43,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-02-21 04:30:43,574 INFO L791 eck$LassoCheckResult]: Stem: 7947#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 7877#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 7878#L230 assume 0 == ~r1~0 % 256; 7919#L231 assume ~id1~0 >= 0; 7925#L232 assume 0 == ~st1~0; 7908#L233 assume ~send1~0 == ~id1~0; 7909#L234 assume 0 == ~mode1~0 % 256; 7918#L235 assume ~id2~0 >= 0; 7900#L236 assume 0 == ~st2~0; 7901#L237 assume ~send2~0 == ~id2~0; 7863#L238 assume 0 == ~mode2~0 % 256; 7864#L239 assume ~id3~0 >= 0; 7861#L240 assume 0 == ~st3~0; 7862#L241 assume ~send3~0 == ~id3~0; 7866#L242 assume 0 == ~mode3~0 % 256; 7924#L243 assume ~id4~0 >= 0; 7842#L244 assume 0 == ~st4~0; 7843#L245 assume ~send4~0 == ~id4~0; 7865#L246 assume 0 == ~mode4~0 % 256; 7907#L247 assume ~id5~0 >= 0; 7938#L248 assume 0 == ~st5~0; 7838#L249 assume ~send5~0 == ~id5~0; 7839#L250 assume 0 == ~mode5~0 % 256; 7926#L251 assume ~id6~0 >= 0; 7888#L252 assume 0 == ~st6~0; 7889#L253 assume ~send6~0 == ~id6~0; 7895#L254 assume 0 == ~mode6~0 % 256; 7855#L255 assume ~id1~0 != ~id2~0; 7856#L256 assume ~id1~0 != ~id3~0; 7890#L257 assume ~id1~0 != ~id4~0; 7867#L258 assume ~id1~0 != ~id5~0; 7868#L259 assume ~id1~0 != ~id6~0; 7910#L260 assume ~id2~0 != ~id3~0; 7911#L261 assume ~id2~0 != ~id4~0; 7896#L262 assume ~id2~0 != ~id5~0; 7897#L263 assume ~id2~0 != ~id6~0; 7902#L264 assume ~id3~0 != ~id4~0; 7903#L265 assume ~id3~0 != ~id5~0; 7849#L266 assume ~id3~0 != ~id6~0; 7850#L267 assume ~id4~0 != ~id5~0; 7859#L268 assume ~id4~0 != ~id6~0; 7860#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 7904#L230-1 init_#res#1 := init_~tmp~0#1; 7929#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 7885#L24 assume !(0 == assume_abort_if_not_~cond#1); 7851#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 7852#L469-2 [2022-02-21 04:30:43,574 INFO L793 eck$LassoCheckResult]: Loop: 7852#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 7847#L80 assume !(0 != ~mode1~0 % 256); 7848#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 7937#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 7857#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 7858#L106 assume !(0 != ~mode2~0 % 256); 8081#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 8078#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 8079#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 8274#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 8273#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 8270#L134-1 ~mode3~0 := 0; 8268#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 8267#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 8064#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 8061#L159-1 ~mode4~0 := 0; 8059#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 8058#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 8055#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 7991#L184-1 ~mode5~0 := 0; 7989#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 7985#L206 assume !(0 != ~mode6~0 % 256); 7986#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 8036#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 7914#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 7912#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 7913#L400 assume !(~r1~0 % 256 >= 6); 8008#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 8009#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 8100#L399-1 check_#res#1 := check_~tmp~1#1; 8098#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 8096#L501 assume !(0 == assert_~arg#1 % 256); 8094#L496 assume { :end_inline_assert } true; 8092#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 8089#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 8090#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 7930#L84-1 ~mode1~0 := 0; 8258#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 8257#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 8253#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 8200#L109-1 ~mode2~0 := 0; 8249#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 8246#L131 assume !(0 != ~mode3~0 % 256); 8244#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 8210#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 8206#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 8203#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 7920#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 7892#L159-1 ~mode4~0 := 0; 7875#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 7876#L181 assume !(0 != ~mode5~0 % 256); 7931#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 8052#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 8050#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 8051#L206 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 7941#L209 assume !(node6_~m6~0#1 != ~nomsg~0); 7845#L209-1 ~mode6~0 := 0; 7959#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 8024#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 8025#L400 assume !(~r1~0 % 256 >= 6); 7893#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 7894#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 7951#L399-1 check_#res#1 := check_~tmp~1#1; 7836#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 7837#L501 assume !(0 == assert_~arg#1 % 256); 7884#L496 assume { :end_inline_assert } true; 7852#L469-2 [2022-02-21 04:30:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 7 times [2022-02-21 04:30:43,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:43,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325180659] [2022-02-21 04:30:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:43,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:43,594 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash 49341109, now seen corresponding path program 1 times [2022-02-21 04:30:43,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:43,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567652766] [2022-02-21 04:30:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:43,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {9215#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {9215#true} assume !(0 != ~mode1~0 % 256); {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {9215#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {9215#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {9215#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {9215#true} assume !(0 != ~mode2~0 % 256); {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {9215#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {9215#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9215#true} is VALID [2022-02-21 04:30:43,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {9215#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {9215#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {9215#true} assume !(node3_~m3~0#1 != ~nomsg~0); {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {9215#true} ~mode3~0 := 0; {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {9215#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {9215#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {9215#true} assume !(node4_~m4~0#1 != ~nomsg~0); {9215#true} is VALID [2022-02-21 04:30:43,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {9215#true} ~mode4~0 := 0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(node5_~m5~0#1 != ~nomsg~0); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~mode5~0 := 0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 != ~mode6~0 % 256); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(~r1~0 % 256 >= 6); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} check_#res#1 := check_~tmp~1#1; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 == assert_~arg#1 % 256); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_assert } true; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(node1_~m1~0#1 != ~nomsg~0); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~mode1~0 := 0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(node2_~m2~0#1 != ~nomsg~0); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~mode2~0 := 0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 != ~mode3~0 % 256); {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:30:43,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {9217#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9216#false} is VALID [2022-02-21 04:30:43,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {9216#false} assume !(node4_~m4~0#1 != ~nomsg~0); {9216#false} is VALID [2022-02-21 04:30:43,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {9216#false} ~mode4~0 := 0; {9216#false} is VALID [2022-02-21 04:30:43,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {9216#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9216#false} is VALID [2022-02-21 04:30:43,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {9216#false} assume !(0 != ~mode5~0 % 256); {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {9216#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {9216#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {9216#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {9216#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {9216#false} assume !(node6_~m6~0#1 != ~nomsg~0); {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {9216#false} ~mode6~0 := 0; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {9216#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {9216#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {9216#false} assume !(~r1~0 % 256 >= 6); {9216#false} is VALID [2022-02-21 04:30:43,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {9216#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {9216#false} is VALID [2022-02-21 04:30:43,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {9216#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {9216#false} is VALID [2022-02-21 04:30:43,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {9216#false} check_#res#1 := check_~tmp~1#1; {9216#false} is VALID [2022-02-21 04:30:43,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {9216#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {9216#false} is VALID [2022-02-21 04:30:43,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {9216#false} assume !(0 == assert_~arg#1 % 256); {9216#false} is VALID [2022-02-21 04:30:43,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {9216#false} assume { :end_inline_assert } true; {9216#false} is VALID [2022-02-21 04:30:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:43,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:43,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567652766] [2022-02-21 04:30:43,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567652766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:43,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:43,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:43,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210732682] [2022-02-21 04:30:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:43,649 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:43,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:43,650 INFO L87 Difference]: Start difference. First operand 454 states and 658 transitions. cyclomatic complexity: 205 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,804 INFO L93 Difference]: Finished difference Result 830 states and 1206 transitions. [2022-02-21 04:30:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:43,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:43,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 830 states and 1206 transitions. [2022-02-21 04:30:43,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 784 [2022-02-21 04:30:43,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 830 states to 830 states and 1206 transitions. [2022-02-21 04:30:43,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 830 [2022-02-21 04:30:43,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2022-02-21 04:30:43,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1206 transitions. [2022-02-21 04:30:43,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:43,918 INFO L681 BuchiCegarLoop]: Abstraction has 830 states and 1206 transitions. [2022-02-21 04:30:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1206 transitions. [2022-02-21 04:30:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 814. [2022-02-21 04:30:43,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:43,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 830 states and 1206 transitions. Second operand has 814 states, 814 states have (on average 1.452088452088452) internal successors, (1182), 813 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,928 INFO L74 IsIncluded]: Start isIncluded. First operand 830 states and 1206 transitions. Second operand has 814 states, 814 states have (on average 1.452088452088452) internal successors, (1182), 813 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,929 INFO L87 Difference]: Start difference. First operand 830 states and 1206 transitions. Second operand has 814 states, 814 states have (on average 1.452088452088452) internal successors, (1182), 813 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,946 INFO L93 Difference]: Finished difference Result 830 states and 1206 transitions. [2022-02-21 04:30:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1206 transitions. [2022-02-21 04:30:43,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:43,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:43,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 814 states have (on average 1.452088452088452) internal successors, (1182), 813 states have internal predecessors, (1182), 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 830 states and 1206 transitions. [2022-02-21 04:30:43,951 INFO L87 Difference]: Start difference. First operand has 814 states, 814 states have (on average 1.452088452088452) internal successors, (1182), 813 states have internal predecessors, (1182), 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 830 states and 1206 transitions. [2022-02-21 04:30:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:43,970 INFO L93 Difference]: Finished difference Result 830 states and 1206 transitions. [2022-02-21 04:30:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1206 transitions. [2022-02-21 04:30:43,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:43,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:43,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:43,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 814 states have (on average 1.452088452088452) internal successors, (1182), 813 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1182 transitions. [2022-02-21 04:30:43,989 INFO L704 BuchiCegarLoop]: Abstraction has 814 states and 1182 transitions. [2022-02-21 04:30:43,989 INFO L587 BuchiCegarLoop]: Abstraction has 814 states and 1182 transitions. [2022-02-21 04:30:43,990 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:30:43,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1182 transitions. [2022-02-21 04:30:43,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 768 [2022-02-21 04:30:43,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:43,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:43,996 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, 1] [2022-02-21 04:30:43,996 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-02-21 04:30:43,996 INFO L791 eck$LassoCheckResult]: Stem: 10162#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 10090#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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 10091#L230 assume 0 == ~r1~0 % 256; 10134#L231 assume ~id1~0 >= 0; 10140#L232 assume 0 == ~st1~0; 10121#L233 assume ~send1~0 == ~id1~0; 10122#L234 assume 0 == ~mode1~0 % 256; 10132#L235 assume ~id2~0 >= 0; 10113#L236 assume 0 == ~st2~0; 10114#L237 assume ~send2~0 == ~id2~0; 10075#L238 assume 0 == ~mode2~0 % 256; 10076#L239 assume ~id3~0 >= 0; 10073#L240 assume 0 == ~st3~0; 10074#L241 assume ~send3~0 == ~id3~0; 10078#L242 assume 0 == ~mode3~0 % 256; 10139#L243 assume ~id4~0 >= 0; 10054#L244 assume 0 == ~st4~0; 10055#L245 assume ~send4~0 == ~id4~0; 10077#L246 assume 0 == ~mode4~0 % 256; 10120#L247 assume ~id5~0 >= 0; 10152#L248 assume 0 == ~st5~0; 10050#L249 assume ~send5~0 == ~id5~0; 10051#L250 assume 0 == ~mode5~0 % 256; 10141#L251 assume ~id6~0 >= 0; 10101#L252 assume 0 == ~st6~0; 10102#L253 assume ~send6~0 == ~id6~0; 10108#L254 assume 0 == ~mode6~0 % 256; 10067#L255 assume ~id1~0 != ~id2~0; 10068#L256 assume ~id1~0 != ~id3~0; 10103#L257 assume ~id1~0 != ~id4~0; 10079#L258 assume ~id1~0 != ~id5~0; 10080#L259 assume ~id1~0 != ~id6~0; 10123#L260 assume ~id2~0 != ~id3~0; 10124#L261 assume ~id2~0 != ~id4~0; 10109#L262 assume ~id2~0 != ~id5~0; 10110#L263 assume ~id2~0 != ~id6~0; 10115#L264 assume ~id3~0 != ~id4~0; 10116#L265 assume ~id3~0 != ~id5~0; 10061#L266 assume ~id3~0 != ~id6~0; 10062#L267 assume ~id4~0 != ~id5~0; 10071#L268 assume ~id4~0 != ~id6~0; 10072#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 10117#L230-1 init_#res#1 := init_~tmp~0#1; 10144#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; 10098#L24 assume !(0 == assume_abort_if_not_~cond#1); 10063#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 10064#L469-2 [2022-02-21 04:30:43,996 INFO L793 eck$LassoCheckResult]: Loop: 10064#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 10240#L80 assume !(0 != ~mode1~0 % 256); 10238#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 10236#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 10234#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 10232#L106 assume !(0 != ~mode2~0 % 256); 10228#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 10225#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 10226#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 10404#L131 assume !(0 != ~mode3~0 % 256); 10403#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 10215#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 10214#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 10213#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 10212#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 10209#L159-1 ~mode4~0 := 0; 10207#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 10206#L181 assume !(0 != ~mode5~0 % 256); 10202#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 10200#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 10198#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 10199#L206 assume !(0 != ~mode6~0 % 256); 10446#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 10188#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 10189#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 10440#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 10437#L400 assume !(~r1~0 % 256 >= 6); 10435#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 10432#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 10430#L399-1 check_#res#1 := check_~tmp~1#1; 10428#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 10426#L501 assume !(0 == assert_~arg#1 % 256); 10424#L496 assume { :end_inline_assert } true; 10422#L469-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 10419#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 10420#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 10717#L84-1 ~mode1~0 := 0; 10716#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 10715#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 10711#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 10706#L109-1 ~mode2~0 := 0; 10695#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 10693#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 10692#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 10685#L134-1 ~mode3~0 := 0; 10682#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 10679#L156 assume !(0 != ~mode4~0 % 256); 10443#L169 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 10374#L169-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 10367#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 10360#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 10356#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 10347#L184-1 ~mode5~0 := 0; 10343#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 10341#L206 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 10339#L209 assume !(node6_~m6~0#1 != ~nomsg~0); 10328#L209-1 ~mode6~0 := 0; 10324#L206-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 10322#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 10319#L400 assume !(~r1~0 % 256 >= 6); 10316#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 10313#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 10310#L399-1 check_#res#1 := check_~tmp~1#1; 10308#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 10306#L501 assume !(0 == assert_~arg#1 % 256); 10249#L496 assume { :end_inline_assert } true; 10064#L469-2 [2022-02-21 04:30:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 8 times [2022-02-21 04:30:43,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:43,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486311470] [2022-02-21 04:30:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:44,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:44,031 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1167706327, now seen corresponding path program 1 times [2022-02-21 04:30:44,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:44,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793857973] [2022-02-21 04:30:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:44,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:44,065 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:44,065 INFO L85 PathProgramCache]: Analyzing trace with hash 305125241, now seen corresponding path program 1 times [2022-02-21 04:30:44,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:44,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052114266] [2022-02-21 04:30:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:44,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:44,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {12529#true} 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {12529#true} is VALID [2022-02-21 04:30:44,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {12529#true} 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~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12529#true} is VALID [2022-02-21 04:30:44,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {12529#true} assume 0 == ~r1~0 % 256; {12529#true} is VALID [2022-02-21 04:30:44,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {12529#true} assume ~id1~0 >= 0; {12529#true} is VALID [2022-02-21 04:30:44,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {12529#true} assume 0 == ~st1~0; {12529#true} is VALID [2022-02-21 04:30:44,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {12529#true} assume ~send1~0 == ~id1~0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {12529#true} assume 0 == ~mode1~0 % 256; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {12529#true} assume ~id2~0 >= 0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {12529#true} assume 0 == ~st2~0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {12529#true} assume ~send2~0 == ~id2~0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {12529#true} assume 0 == ~mode2~0 % 256; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {12529#true} assume ~id3~0 >= 0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {12529#true} assume 0 == ~st3~0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {12529#true} assume ~send3~0 == ~id3~0; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {12529#true} assume 0 == ~mode3~0 % 256; {12529#true} is VALID [2022-02-21 04:30:44,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {12529#true} assume ~id4~0 >= 0; {12529#true} is VALID [2022-02-21 04:30:44,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {12529#true} assume 0 == ~st4~0; {12529#true} is VALID [2022-02-21 04:30:44,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {12529#true} assume ~send4~0 == ~id4~0; {12529#true} is VALID [2022-02-21 04:30:44,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {12529#true} assume 0 == ~mode4~0 % 256; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#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; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {12531#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {12530#false} assume !(node4_~m4~0#1 != ~nomsg~0); {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {12530#false} ~mode4~0 := 0; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {12530#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {12530#false} assume !(0 != ~mode5~0 % 256); {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {12530#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {12530#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {12530#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {12530#false} assume !(0 != ~mode6~0 % 256); {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {12530#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {12530#false} is VALID [2022-02-21 04:30:44,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {12530#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {12530#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 71: Hoare triple {12530#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {12530#false} assume !(~r1~0 % 256 >= 6); {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 73: Hoare triple {12530#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {12530#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {12530#false} check_#res#1 := check_~tmp~1#1; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {12530#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {12530#false} assume !(0 == assert_~arg#1 % 256); {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {12530#false} assume { :end_inline_assert } true; {12530#false} is VALID [2022-02-21 04:30:44,117 INFO L290 TraceCheckUtils]: 79: Hoare triple {12530#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {12530#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {12530#false} assume !(node1_~m1~0#1 != ~nomsg~0); {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {12530#false} ~mode1~0 := 0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 83: Hoare triple {12530#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {12530#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {12530#false} assume !(node2_~m2~0#1 != ~nomsg~0); {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 86: Hoare triple {12530#false} ~mode2~0 := 0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 87: Hoare triple {12530#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {12530#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {12530#false} assume !(node3_~m3~0#1 != ~nomsg~0); {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 90: Hoare triple {12530#false} ~mode3~0 := 0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 91: Hoare triple {12530#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 92: Hoare triple {12530#false} assume !(0 != ~mode4~0 % 256); {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 93: Hoare triple {12530#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 94: Hoare triple {12530#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {12530#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {12530#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {12530#false} assume !(node5_~m5~0#1 != ~nomsg~0); {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {12530#false} ~mode5~0 := 0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 99: Hoare triple {12530#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,119 INFO L290 TraceCheckUtils]: 100: Hoare triple {12530#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 101: Hoare triple {12530#false} assume !(node6_~m6~0#1 != ~nomsg~0); {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 102: Hoare triple {12530#false} ~mode6~0 := 0; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 103: Hoare triple {12530#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 104: Hoare triple {12530#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 105: Hoare triple {12530#false} assume !(~r1~0 % 256 >= 6); {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 106: Hoare triple {12530#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {12530#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {12530#false} check_#res#1 := check_~tmp~1#1; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {12530#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; {12530#false} is VALID [2022-02-21 04:30:44,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {12530#false} assume !(0 == assert_~arg#1 % 256); {12530#false} is VALID [2022-02-21 04:30:44,121 INFO L290 TraceCheckUtils]: 111: Hoare triple {12530#false} assume { :end_inline_assert } true; {12530#false} is VALID [2022-02-21 04:30:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 04:30:44,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:44,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052114266] [2022-02-21 04:30:44,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052114266] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:44,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:44,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:44,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587743455] [2022-02-21 04:30:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:46,115 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:46,115 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:46,115 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:46,115 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:46,115 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:46,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:46,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:46,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:46,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c_Iteration10_Loop [2022-02-21 04:30:46,115 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:46,115 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:46,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:46,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:47,449 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2022-02-21 04:30:47,634 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 6912 conjuctions. This might take some time... [2022-02-21 04:30:57,827 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 6912 conjuctions.