./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:23:46,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:23:46,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:23:46,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:23:46,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:23:46,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:23:47,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:23:47,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:23:47,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:23:47,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:23:47,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:23:47,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:23:47,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:23:47,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:23:47,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:23:47,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:23:47,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:23:47,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:23:47,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:23:47,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:23:47,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:23:47,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:23:47,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:23:47,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:23:47,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:23:47,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:23:47,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:23:47,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:23:47,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:23:47,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:23:47,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:23:47,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:23:47,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:23:47,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:23:47,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:23:47,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:23:47,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:23:47,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:23:47,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:23:47,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:23:47,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:23:47,043 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 18:23:47,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:23:47,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:23:47,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:23:47,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:23:47,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:23:47,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:23:47,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:23:47,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:23:47,071 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:23:47,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:23:47,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:23:47,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:23:47,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:23:47,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:23:47,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:23:47,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:23:47,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:23:47,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:23:47,074 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 18:23:47,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:23:47,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:23:47,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:23:47,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:23:47,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:23:47,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:23:47,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:23:47,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:23:47,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:23:47,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:23:47,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:23:47,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:23:47,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:23:47,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:23:47,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:23:47,079 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:23:47,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:23:47,079 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R 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(G ! overflow) ) 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2022-11-25 18:23:47,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:23:47,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:23:47,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:23:47,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:23:47,474 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:23:47,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-11-25 18:23:50,735 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:23:50,972 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:23:50,972 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-11-25 18:23:50,980 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/data/91359b7d3/5d671cd8bd7742f494293842d738745d/FLAG09cc3abab [2022-11-25 18:23:50,997 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/data/91359b7d3/5d671cd8bd7742f494293842d738745d [2022-11-25 18:23:51,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:23:51,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:23:51,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:23:51,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:23:51,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:23:51,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:23:50" (1/1) ... [2022-11-25 18:23:51,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c64f94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51, skipping insertion in model container [2022-11-25 18:23:51,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:23:50" (1/1) ... [2022-11-25 18:23:51,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:23:51,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:23:51,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-11-25 18:23:51,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:23:51,423 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:23:51,442 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-11-25 18:23:51,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:23:51,502 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:23:51,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51 WrapperNode [2022-11-25 18:23:51,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:23:51,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:23:51,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:23:51,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:23:51,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,549 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 146 [2022-11-25 18:23:51,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:23:51,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:23:51,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:23:51,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:23:51,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:23:51,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:23:51,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:23:51,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:23:51,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (1/1) ... [2022-11-25 18:23:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:23:51,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:51,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:23:51,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:23:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:23:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:23:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:23:51,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:23:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:23:51,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:23:51,797 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:23:51,800 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:23:52,264 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:23:52,273 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:23:52,273 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:23:52,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:23:52 BoogieIcfgContainer [2022-11-25 18:23:52,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:23:52,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:23:52,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:23:52,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:23:52,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:23:50" (1/3) ... [2022-11-25 18:23:52,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128f1f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:23:52, skipping insertion in model container [2022-11-25 18:23:52,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:51" (2/3) ... [2022-11-25 18:23:52,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128f1f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:23:52, skipping insertion in model container [2022-11-25 18:23:52,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:23:52" (3/3) ... [2022-11-25 18:23:52,286 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-11-25 18:23:52,309 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:23:52,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-25 18:23:52,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:23:52,394 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c943e6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:23:52,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-25 18:23:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 59 states have (on average 1.847457627118644) internal successors, (109), 92 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:23:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 18:23:52,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:52,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:52,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2087058924, now seen corresponding path program 1 times [2022-11-25 18:23:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:52,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488742216] [2022-11-25 18:23:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:52,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:52,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488742216] [2022-11-25 18:23:52,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488742216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:52,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:52,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79064808] [2022-11-25 18:23:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:52,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:52,768 INFO L87 Difference]: Start difference. First operand has 109 states, 59 states have (on average 1.847457627118644) internal successors, (109), 92 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-25 18:23:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:52,930 INFO L93 Difference]: Finished difference Result 197 states and 281 transitions. [2022-11-25 18:23:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2022-11-25 18:23:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:52,949 INFO L225 Difference]: With dead ends: 197 [2022-11-25 18:23:52,949 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 18:23:52,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:52,958 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 86 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:52,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 133 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:23:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 18:23:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-25 18:23:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 82 states have internal predecessors, (85), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:23:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-11-25 18:23:53,030 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 11 [2022-11-25 18:23:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:53,031 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-11-25 18:23:53,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-25 18:23:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-11-25 18:23:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:23:53,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:53,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:53,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:23:53,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -274318795, now seen corresponding path program 1 times [2022-11-25 18:23:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:53,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179089805] [2022-11-25 18:23:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:53,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179089805] [2022-11-25 18:23:53,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179089805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:53,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:53,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246319420] [2022-11-25 18:23:53,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:53,146 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 18:23:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:53,198 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2022-11-25 18:23:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2022-11-25 18:23:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:53,201 INFO L225 Difference]: With dead ends: 185 [2022-11-25 18:23:53,202 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 18:23:53,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:53,205 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:53,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:23:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 18:23:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-25 18:23:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 82 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:23:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-11-25 18:23:53,231 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 12 [2022-11-25 18:23:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:53,232 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-11-25 18:23:53,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 18:23:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-11-25 18:23:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:23:53,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:53,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:53,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:23:53,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -274317129, now seen corresponding path program 1 times [2022-11-25 18:23:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:53,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759690751] [2022-11-25 18:23:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759690751] [2022-11-25 18:23:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759690751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:53,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:53,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977626774] [2022-11-25 18:23:53,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:53,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:53,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:53,307 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 18:23:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:53,428 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-11-25 18:23:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:53,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2022-11-25 18:23:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:53,433 INFO L225 Difference]: With dead ends: 99 [2022-11-25 18:23:53,435 INFO L226 Difference]: Without dead ends: 94 [2022-11-25 18:23:53,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:53,440 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 65 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:53,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 113 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:23:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-25 18:23:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-25 18:23:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 77 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:23:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-11-25 18:23:53,471 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 12 [2022-11-25 18:23:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:53,472 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-11-25 18:23:53,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 18:23:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-11-25 18:23:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 18:23:53,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:53,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:53,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:23:53,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753319, now seen corresponding path program 1 times [2022-11-25 18:23:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:53,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773001757] [2022-11-25 18:23:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773001757] [2022-11-25 18:23:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773001757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:53,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:53,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89246120] [2022-11-25 18:23:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:53,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:23:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:23:53,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:23:53,562 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-25 18:23:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:53,766 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-11-25 18:23:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:23:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2022-11-25 18:23:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:53,768 INFO L225 Difference]: With dead ends: 94 [2022-11-25 18:23:53,769 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 18:23:53,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:23:53,771 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:53,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 99 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:23:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 18:23:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-25 18:23:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.290909090909091) internal successors, (71), 69 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:23:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2022-11-25 18:23:53,789 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 14 [2022-11-25 18:23:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:53,790 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2022-11-25 18:23:53,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-25 18:23:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-11-25 18:23:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:23:53,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:53,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:53,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:23:53,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1141254748, now seen corresponding path program 1 times [2022-11-25 18:23:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:53,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491178071] [2022-11-25 18:23:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491178071] [2022-11-25 18:23:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491178071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:53,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:53,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610442109] [2022-11-25 18:23:53,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:53,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:23:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:23:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:23:53,873 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-25 18:23:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:54,051 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2022-11-25 18:23:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:23:54,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2022-11-25 18:23:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:54,055 INFO L225 Difference]: With dead ends: 117 [2022-11-25 18:23:54,056 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 18:23:54,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:23:54,060 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 79 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:54,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 182 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:23:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 18:23:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-25 18:23:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 86 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-25 18:23:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2022-11-25 18:23:54,099 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 15 [2022-11-25 18:23:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:54,100 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2022-11-25 18:23:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-25 18:23:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2022-11-25 18:23:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:23:54,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:54,104 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-11-25 18:23:54,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:23:54,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash -129990721, now seen corresponding path program 1 times [2022-11-25 18:23:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:54,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009732894] [2022-11-25 18:23:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:23:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:23:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:23:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:23:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:23:54,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:54,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009732894] [2022-11-25 18:23:54,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009732894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:54,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139737149] [2022-11-25 18:23:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:54,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:54,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:23:54,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:23:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:23:54,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:23:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:23:54,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:23:55,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139737149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:23:55,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:23:55,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-11-25 18:23:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498305443] [2022-11-25 18:23:55,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:23:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:23:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:23:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:23:55,014 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-25 18:23:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:56,322 INFO L93 Difference]: Finished difference Result 458 states and 635 transitions. [2022-11-25 18:23:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:23:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 71 [2022-11-25 18:23:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:56,329 INFO L225 Difference]: With dead ends: 458 [2022-11-25 18:23:56,329 INFO L226 Difference]: Without dead ends: 452 [2022-11-25 18:23:56,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2022-11-25 18:23:56,341 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1042 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:56,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 446 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:23:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-25 18:23:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 284. [2022-11-25 18:23:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 198 states have (on average 1.2272727272727273) internal successors, (243), 213 states have internal predecessors, (243), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-11-25 18:23:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2022-11-25 18:23:56,399 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 71 [2022-11-25 18:23:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:56,399 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2022-11-25 18:23:56,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-25 18:23:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2022-11-25 18:23:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 18:23:56,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:56,413 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:23:56,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:23:56,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:23:56,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash 230966225, now seen corresponding path program 1 times [2022-11-25 18:23:56,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:56,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483313278] [2022-11-25 18:23:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:56,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:23:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:23:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:23:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:23:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 18:23:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:23:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-25 18:23:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:56,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483313278] [2022-11-25 18:23:56,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483313278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:56,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:56,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082986249] [2022-11-25 18:23:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:56,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:56,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:56,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:56,724 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 18:23:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:56,841 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2022-11-25 18:23:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2022-11-25 18:23:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:56,854 INFO L225 Difference]: With dead ends: 404 [2022-11-25 18:23:56,854 INFO L226 Difference]: Without dead ends: 284 [2022-11-25 18:23:56,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:56,861 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:56,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:23:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-25 18:23:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2022-11-25 18:23:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 198 states have (on average 1.196969696969697) internal successors, (237), 213 states have internal predecessors, (237), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-11-25 18:23:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 393 transitions. [2022-11-25 18:23:56,920 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 393 transitions. Word has length 91 [2022-11-25 18:23:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:56,923 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 393 transitions. [2022-11-25 18:23:56,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 18:23:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 393 transitions. [2022-11-25 18:23:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-25 18:23:56,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:56,926 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:23:56,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:23:56,926 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1551752532, now seen corresponding path program 1 times [2022-11-25 18:23:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:56,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309687210] [2022-11-25 18:23:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:23:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:23:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:23:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:23:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:23:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-25 18:23:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309687210] [2022-11-25 18:23:57,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309687210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:57,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:57,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048012058] [2022-11-25 18:23:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:57,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,192 INFO L87 Difference]: Start difference. First operand 284 states and 393 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 18:23:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:57,241 INFO L93 Difference]: Finished difference Result 284 states and 393 transitions. [2022-11-25 18:23:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2022-11-25 18:23:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:57,245 INFO L225 Difference]: With dead ends: 284 [2022-11-25 18:23:57,245 INFO L226 Difference]: Without dead ends: 283 [2022-11-25 18:23:57,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,247 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:57,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:23:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-25 18:23:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-25 18:23:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 198 states have (on average 1.1717171717171717) internal successors, (232), 212 states have internal predecessors, (232), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-11-25 18:23:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 388 transitions. [2022-11-25 18:23:57,308 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 388 transitions. Word has length 92 [2022-11-25 18:23:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:57,310 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 388 transitions. [2022-11-25 18:23:57,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 18:23:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 388 transitions. [2022-11-25 18:23:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 18:23:57,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:57,316 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:23:57,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:23:57,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash -859688054, now seen corresponding path program 1 times [2022-11-25 18:23:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:57,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896625221] [2022-11-25 18:23:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:23:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:23:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:23:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:23:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:23:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-25 18:23:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:57,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896625221] [2022-11-25 18:23:57,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896625221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:57,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:57,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569129371] [2022-11-25 18:23:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:57,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:57,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,444 INFO L87 Difference]: Start difference. First operand 283 states and 388 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 18:23:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:57,491 INFO L93 Difference]: Finished difference Result 283 states and 388 transitions. [2022-11-25 18:23:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:57,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2022-11-25 18:23:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:57,498 INFO L225 Difference]: With dead ends: 283 [2022-11-25 18:23:57,498 INFO L226 Difference]: Without dead ends: 282 [2022-11-25 18:23:57,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,500 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:57,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:23:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-25 18:23:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-25 18:23:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.1464646464646464) internal successors, (227), 211 states have internal predecessors, (227), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-11-25 18:23:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2022-11-25 18:23:57,537 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 383 transitions. Word has length 93 [2022-11-25 18:23:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:57,538 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 383 transitions. [2022-11-25 18:23:57,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 18:23:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 383 transitions. [2022-11-25 18:23:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 18:23:57,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:57,540 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:23:57,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:23:57,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash -219702225, now seen corresponding path program 1 times [2022-11-25 18:23:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:57,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500763440] [2022-11-25 18:23:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:23:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:23:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:23:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:23:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:23:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 18:23:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:23:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-25 18:23:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500763440] [2022-11-25 18:23:57,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500763440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:57,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:57,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796937123] [2022-11-25 18:23:57,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:57,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,625 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:23:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:57,670 INFO L93 Difference]: Finished difference Result 378 states and 525 transitions. [2022-11-25 18:23:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:57,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2022-11-25 18:23:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:57,673 INFO L225 Difference]: With dead ends: 378 [2022-11-25 18:23:57,674 INFO L226 Difference]: Without dead ends: 282 [2022-11-25 18:23:57,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,675 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:57,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:23:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-25 18:23:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-25 18:23:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.121212121212121) internal successors, (222), 211 states have internal predecessors, (222), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-11-25 18:23:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 378 transitions. [2022-11-25 18:23:57,714 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 378 transitions. Word has length 105 [2022-11-25 18:23:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:57,715 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 378 transitions. [2022-11-25 18:23:57,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:23:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 378 transitions. [2022-11-25 18:23:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-25 18:23:57,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:57,717 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:23:57,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:23:57,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1239451563, now seen corresponding path program 1 times [2022-11-25 18:23:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904551303] [2022-11-25 18:23:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:23:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:23:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:23:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:23:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:23:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:23:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:23:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:23:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-25 18:23:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:57,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904551303] [2022-11-25 18:23:57,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904551303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:57,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:57,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525396949] [2022-11-25 18:23:57,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:57,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:57,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:57,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:57,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,905 INFO L87 Difference]: Start difference. First operand 282 states and 378 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:23:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:57,956 INFO L93 Difference]: Finished difference Result 343 states and 457 transitions. [2022-11-25 18:23:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2022-11-25 18:23:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:57,959 INFO L225 Difference]: With dead ends: 343 [2022-11-25 18:23:57,959 INFO L226 Difference]: Without dead ends: 341 [2022-11-25 18:23:57,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:57,960 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:57,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:23:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-25 18:23:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2022-11-25 18:23:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 248 states have (on average 1.1088709677419355) internal successors, (275), 260 states have internal predecessors, (275), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-25 18:23:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 447 transitions. [2022-11-25 18:23:58,005 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 447 transitions. Word has length 107 [2022-11-25 18:23:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:58,005 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 447 transitions. [2022-11-25 18:23:58,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:23:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 447 transitions. [2022-11-25 18:23:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 18:23:58,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:58,011 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 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-11-25 18:23:58,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:23:58,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:23:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash 72529267, now seen corresponding path program 2 times [2022-11-25 18:23:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:58,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638586694] [2022-11-25 18:23:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:23:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:23:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:23:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:23:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:23:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:23:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:23:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:23:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:23:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 18:23:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:23:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 18:23:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:23:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:23:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:23:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 18:23:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-11-25 18:23:58,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:58,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638586694] [2022-11-25 18:23:58,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638586694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:23:58,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048348721] [2022-11-25 18:23:58,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:23:58,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:23:58,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:58,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:23:58,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:23:58,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:23:58,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:23:58,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:23:58,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:23:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-11-25 18:23:58,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:23:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-11-25 18:23:59,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048348721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:23:59,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:23:59,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-11-25 18:23:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476228293] [2022-11-25 18:23:59,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:23:59,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:23:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:23:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:23:59,092 INFO L87 Difference]: Start difference. First operand 340 states and 447 transitions. Second operand has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2022-11-25 18:24:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:01,669 INFO L93 Difference]: Finished difference Result 981 states and 1308 transitions. [2022-11-25 18:24:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:24:01,670 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 135 [2022-11-25 18:24:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:01,675 INFO L225 Difference]: With dead ends: 981 [2022-11-25 18:24:01,676 INFO L226 Difference]: Without dead ends: 978 [2022-11-25 18:24:01,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=757, Invalid=1499, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 18:24:01,679 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 2016 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:01,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 644 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 18:24:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-11-25 18:24:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 767. [2022-11-25 18:24:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 563 states have (on average 1.1101243339253997) internal successors, (625), 589 states have internal predecessors, (625), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2022-11-25 18:24:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1021 transitions. [2022-11-25 18:24:01,791 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1021 transitions. Word has length 135 [2022-11-25 18:24:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:01,795 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 1021 transitions. [2022-11-25 18:24:01,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2022-11-25 18:24:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1021 transitions. [2022-11-25 18:24:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-25 18:24:01,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:01,801 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:24:01,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:02,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:24:02,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:24:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1793027604, now seen corresponding path program 1 times [2022-11-25 18:24:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:02,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260147384] [2022-11-25 18:24:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:24:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:24:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:24:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:24:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:24:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:24:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:24:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:24:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:24:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:24:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 18:24:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:24:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:24:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 18:24:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-25 18:24:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-25 18:24:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:02,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260147384] [2022-11-25 18:24:02,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260147384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50411217] [2022-11-25 18:24:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:02,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:02,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:02,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:02,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:24:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:24:02,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-25 18:24:02,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:02,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50411217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:02,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:02,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-25 18:24:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438454700] [2022-11-25 18:24:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:02,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:02,389 INFO L87 Difference]: Start difference. First operand 767 states and 1021 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-25 18:24:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:02,486 INFO L93 Difference]: Finished difference Result 768 states and 1021 transitions. [2022-11-25 18:24:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:24:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2022-11-25 18:24:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:02,492 INFO L225 Difference]: With dead ends: 768 [2022-11-25 18:24:02,492 INFO L226 Difference]: Without dead ends: 767 [2022-11-25 18:24:02,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:02,494 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:02,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 263 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-11-25 18:24:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 766. [2022-11-25 18:24:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 563 states have (on average 1.0905861456483126) internal successors, (614), 588 states have internal predecessors, (614), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2022-11-25 18:24:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1010 transitions. [2022-11-25 18:24:02,577 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1010 transitions. Word has length 149 [2022-11-25 18:24:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:02,578 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1010 transitions. [2022-11-25 18:24:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-25 18:24:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1010 transitions. [2022-11-25 18:24:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-25 18:24:02,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:02,582 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:24:02,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:02,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:02,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:24:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 250719324, now seen corresponding path program 1 times [2022-11-25 18:24:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:02,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260909765] [2022-11-25 18:24:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:24:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:24:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:24:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:24:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:24:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:24:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:24:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:24:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:24:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:24:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 18:24:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:24:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:24:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 18:24:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-25 18:24:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-25 18:24:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:03,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260909765] [2022-11-25 18:24:03,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260909765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:03,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695167018] [2022-11-25 18:24:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:03,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:03,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:03,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:03,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:24:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:03,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:24:03,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-25 18:24:03,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-25 18:24:03,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695167018] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:03,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:03,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-25 18:24:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323210586] [2022-11-25 18:24:03,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:03,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:24:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:03,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:24:03,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:03,356 INFO L87 Difference]: Start difference. First operand 766 states and 1010 transitions. Second operand has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2022-11-25 18:24:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:03,584 INFO L93 Difference]: Finished difference Result 1275 states and 1745 transitions. [2022-11-25 18:24:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:03,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 150 [2022-11-25 18:24:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:03,593 INFO L225 Difference]: With dead ends: 1275 [2022-11-25 18:24:03,593 INFO L226 Difference]: Without dead ends: 1274 [2022-11-25 18:24:03,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:03,595 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 16 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:03,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 462 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-11-25 18:24:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1270. [2022-11-25 18:24:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 893 states have (on average 1.0873460246360582) internal successors, (971), 945 states have internal predecessors, (971), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2022-11-25 18:24:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1715 transitions. [2022-11-25 18:24:03,851 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1715 transitions. Word has length 150 [2022-11-25 18:24:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:03,852 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1715 transitions. [2022-11-25 18:24:03,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.166666666666668) internal successors, (97), 7 states have internal predecessors, (97), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2022-11-25 18:24:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1715 transitions. [2022-11-25 18:24:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-11-25 18:24:03,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:03,861 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 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-11-25 18:24:03,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:04,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:04,068 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:24:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -594134418, now seen corresponding path program 3 times [2022-11-25 18:24:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:04,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164815260] [2022-11-25 18:24:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:24:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:24:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:24:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:24:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:24:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:24:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:24:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:24:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 18:24:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:24:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 18:24:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:24:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:24:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:24:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 18:24:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 18:24:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 18:24:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 18:24:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 18:24:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-25 18:24:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-25 18:24:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-25 18:24:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 18:24:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-25 18:24:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 18:24:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-25 18:24:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-25 18:24:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-25 18:24:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 18:24:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2022-11-25 18:24:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164815260] [2022-11-25 18:24:04,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164815260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577679136] [2022-11-25 18:24:04,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:24:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:04,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:04,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:24:04,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:24:04,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:24:04,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:24:04,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2022-11-25 18:24:05,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2022-11-25 18:24:05,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577679136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:05,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:05,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2022-11-25 18:24:05,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690954919] [2022-11-25 18:24:05,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:05,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 18:24:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 18:24:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:24:05,720 INFO L87 Difference]: Start difference. First operand 1270 states and 1715 transitions. Second operand has 25 states, 24 states have (on average 6.25) internal successors, (150), 25 states have internal predecessors, (150), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2022-11-25 18:24:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:06,526 INFO L93 Difference]: Finished difference Result 1347 states and 1803 transitions. [2022-11-25 18:24:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:24:06,527 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.25) internal successors, (150), 25 states have internal predecessors, (150), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 247 [2022-11-25 18:24:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:06,537 INFO L225 Difference]: With dead ends: 1347 [2022-11-25 18:24:06,537 INFO L226 Difference]: Without dead ends: 1344 [2022-11-25 18:24:06,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2022-11-25 18:24:06,539 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 253 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:06,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 189 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:24:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-11-25 18:24:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 143. [2022-11-25 18:24:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 103 states have (on average 1.0679611650485437) internal successors, (110), 109 states have internal predecessors, (110), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 18:24:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2022-11-25 18:24:06,624 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 247 [2022-11-25 18:24:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:06,625 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2022-11-25 18:24:06,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.25) internal successors, (150), 25 states have internal predecessors, (150), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2022-11-25 18:24:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2022-11-25 18:24:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-11-25 18:24:06,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:06,630 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 18:24:06,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:06,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:06,836 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-25 18:24:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -963740295, now seen corresponding path program 2 times [2022-11-25 18:24:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:06,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147276188] [2022-11-25 18:24:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:24:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:24:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:24:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:24:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:24:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:24:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 18:24:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:24:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:24:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:24:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 18:24:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:24:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:24:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 18:24:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-25 18:24:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 18:24:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 18:24:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 18:24:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-25 18:24:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 18:24:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 18:24:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 18:24:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 18:24:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-25 18:24:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 18:24:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-25 18:24:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 18:24:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-25 18:24:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-25 18:24:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-25 18:24:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 18:24:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 18:24:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-11-25 18:24:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2022-11-25 18:24:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147276188] [2022-11-25 18:24:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147276188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143813966] [2022-11-25 18:24:07,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:24:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:07,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:07,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:24:07,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:24:07,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:24:07,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:24:07,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-11-25 18:24:07,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-11-25 18:24:07,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143813966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:07,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:07,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-11-25 18:24:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154602815] [2022-11-25 18:24:07,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:07,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 18:24:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 18:24:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:24:07,944 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 16 states, 15 states have (on average 14.533333333333333) internal successors, (218), 16 states have internal predecessors, (218), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2022-11-25 18:24:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:08,245 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2022-11-25 18:24:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:24:08,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.533333333333333) internal successors, (218), 16 states have internal predecessors, (218), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 276 [2022-11-25 18:24:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:08,251 INFO L225 Difference]: With dead ends: 173 [2022-11-25 18:24:08,251 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:24:08,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:24:08,253 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:08,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 481 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:24:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:24:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:24:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11-25 18:24:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:24:08,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2022-11-25 18:24:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:08,256 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:24:08,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.533333333333333) internal successors, (218), 16 states have internal predecessors, (218), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2022-11-25 18:24:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:24:08,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:24:08,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2022-11-25 18:24:08,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2022-11-25 18:24:08,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2022-11-25 18:24:08,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2022-11-25 18:24:08,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2022-11-25 18:24:08,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2022-11-25 18:24:08,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2022-11-25 18:24:08,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2022-11-25 18:24:08,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2022-11-25 18:24:08,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2022-11-25 18:24:08,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2022-11-25 18:24:08,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2022-11-25 18:24:08,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2022-11-25 18:24:08,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2022-11-25 18:24:08,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2022-11-25 18:24:08,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2022-11-25 18:24:08,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2022-11-25 18:24:08,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2022-11-25 18:24:08,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2022-11-25 18:24:08,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2022-11-25 18:24:08,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2022-11-25 18:24:08,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2022-11-25 18:24:08,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2022-11-25 18:24:08,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2022-11-25 18:24:08,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2022-11-25 18:24:08,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2022-11-25 18:24:08,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2022-11-25 18:24:08,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2022-11-25 18:24:08,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2022-11-25 18:24:08,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2022-11-25 18:24:08,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:08,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:24:08,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:24:15,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-11-25 18:24:15,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-11-25 18:24:15,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-11-25 18:24:15,927 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-11-25 18:24:15,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:24:15,928 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,931 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) .cse0 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse3) (and .cse0 (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999999) .cse3))) [2022-11-25 18:24:15,931 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2022-11-25 18:24:15,932 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,932 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,933 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-25 18:24:15,933 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-11-25 18:24:15,933 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-25 18:24:15,933 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-11-25 18:24:15,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-11-25 18:24:15,934 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-11-25 18:24:15,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2022-11-25 18:24:15,935 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-25 18:24:15,935 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-11-25 18:24:15,935 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-11-25 18:24:15,935 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-11-25 18:24:15,936 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2022-11-25 18:24:15,936 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2022-11-25 18:24:15,936 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2022-11-25 18:24:15,936 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-11-25 18:24:15,937 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-11-25 18:24:15,937 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-25 18:24:15,937 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,937 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-11-25 18:24:15,938 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 18:24:15,938 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-11-25 18:24:15,938 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 52) no Hoare annotation was computed. [2022-11-25 18:24:15,938 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 46 52) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,939 INFO L895 garLoopResultBuilder]: At program point L47-4(lines 47 52) the Hoare annotation is: (let ((.cse0 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse4 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) .cse0 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse4) (and .cse0 (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-11-25 18:24:15,939 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 18:24:15,939 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-11-25 18:24:15,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,940 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-25 18:24:15,940 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-11-25 18:24:15,940 INFO L895 garLoopResultBuilder]: At program point L56-2(line 56) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,940 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2022-11-25 18:24:15,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 18:24:15,941 INFO L895 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) [2022-11-25 18:24:15,941 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-25 18:24:15,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 18:24:15,942 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-11-25 18:24:15,942 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-11-25 18:24:15,942 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-11-25 18:24:15,942 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 66) no Hoare annotation was computed. [2022-11-25 18:24:15,942 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:24:15,943 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 77) no Hoare annotation was computed. [2022-11-25 18:24:15,943 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-11-25 18:24:15,943 INFO L895 garLoopResultBuilder]: At program point L65-5(lines 64 77) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse3 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse4 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (< |ULTIMATE.start_main_~c~0#1| 2147483643) .cse2 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-25 18:24:15,943 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-11-25 18:24:15,944 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2022-11-25 18:24:15,944 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,944 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2022-11-25 18:24:15,944 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-25 18:24:15,945 INFO L902 garLoopResultBuilder]: At program point L82(lines 24 83) the Hoare annotation is: true [2022-11-25 18:24:15,945 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,945 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 18:24:15,946 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-11-25 18:24:15,946 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-25 18:24:15,946 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2022-11-25 18:24:15,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:24:15,947 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-11-25 18:24:15,947 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,947 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,947 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,947 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2022-11-25 18:24:15,948 INFO L899 garLoopResultBuilder]: For program point L58-3(line 58) no Hoare annotation was computed. [2022-11-25 18:24:15,948 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-25 18:24:15,948 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-11-25 18:24:15,948 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 18:24:15,948 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-11-25 18:24:15,948 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-11-25 18:24:15,949 INFO L895 garLoopResultBuilder]: At program point L42-2(line 42) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,949 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2022-11-25 18:24:15,949 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse3 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse4 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7))) [2022-11-25 18:24:15,950 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-11-25 18:24:15,950 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse3 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse4 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse5 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-25 18:24:15,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-11-25 18:24:15,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-11-25 18:24:15,951 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-11-25 18:24:15,951 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-11-25 18:24:15,951 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-11-25 18:24:15,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-11-25 18:24:15,951 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-11-25 18:24:15,951 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-25 18:24:15,952 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-11-25 18:24:15,952 INFO L899 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2022-11-25 18:24:15,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-25 18:24:15,952 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-11-25 18:24:15,953 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-11-25 18:24:15,953 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-11-25 18:24:15,953 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-11-25 18:24:15,953 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-11-25 18:24:15,953 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-11-25 18:24:15,954 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-25 18:24:15,954 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-25 18:24:15,958 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:15,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:24:15,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:24:15 BoogieIcfgContainer [2022-11-25 18:24:15,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:24:15,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:24:15,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:24:15,983 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:24:15,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:23:52" (3/4) ... [2022-11-25 18:24:15,987 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:24:15,996 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 18:24:16,002 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-25 18:24:16,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 18:24:16,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:24:16,004 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:24:16,058 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:24:16,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:24:16,059 INFO L158 Benchmark]: Toolchain (without parser) took 25056.66ms. Allocated memory was 140.5MB in the beginning and 377.5MB in the end (delta: 237.0MB). Free memory was 104.4MB in the beginning and 322.9MB in the end (delta: -218.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-25 18:24:16,059 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 140.5MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:24:16,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.12ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 104.4MB in the end (delta: 32.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:24:16,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.79ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:24:16,060 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:24:16,061 INFO L158 Benchmark]: RCFGBuilder took 693.27ms. Allocated memory is still 140.5MB. Free memory was 101.3MB in the beginning and 84.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 18:24:16,061 INFO L158 Benchmark]: TraceAbstraction took 23703.20ms. Allocated memory was 140.5MB in the beginning and 377.5MB in the end (delta: 237.0MB). Free memory was 84.1MB in the beginning and 328.1MB in the end (delta: -244.0MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. [2022-11-25 18:24:16,062 INFO L158 Benchmark]: Witness Printer took 75.96ms. Allocated memory is still 377.5MB. Free memory was 328.1MB in the beginning and 322.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:24:16,064 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 140.5MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.12ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 104.4MB in the end (delta: 32.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.79ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 693.27ms. Allocated memory is still 140.5MB. Free memory was 101.3MB in the beginning and 84.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23703.20ms. Allocated memory was 140.5MB in the beginning and 377.5MB in the end (delta: 237.0MB). Free memory was 84.1MB in the beginning and 328.1MB in the end (delta: -244.0MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. * Witness Printer took 75.96ms. Allocated memory is still 377.5MB. Free memory was 328.1MB in the beginning and 322.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3844 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3764 mSDsluCounter, 4009 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2214 mSDsCounter, 1664 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2303 IncrementalHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1664 mSolverCounterUnsat, 1795 mSDtfsCounter, 2303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2385 GetRequests, 2240 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1270occurred in iteration=14, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 1586 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 171 PreInvPairs, 232 NumberOfFragments, 885 HoareAnnotationTreeSize, 171 FomulaSimplifications, 16728 FormulaSimplificationTreeSizeReduction, 4.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 50133 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2608 NumberOfCodeBlocks, 2399 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3460 ConstructedInterpolants, 0 QuantifiedInterpolants, 6261 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19931/21466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((urilen <= 1000000 && (scheme <= 999999 || aux-scheme == 0 || (urilen-1 < scheme)-aux)) && 0 <= urilen + 1000000) && 0 <= 1000000 + tokenlen) && 0 <= cp) && 0 <= scheme) && cp <= 999999) && tokenlen <= 1000000) && scheme <= 1000000 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= urilen + 1000000 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((urilen <= 1000000 && (scheme <= 999999 || aux-scheme == 0 || (urilen-1 < scheme)-aux)) && c < 2147483643) && 0 <= urilen + 1000000) && 1 <= c) && 0 <= 1000000 + tokenlen) && 0 <= cp) && cp <= 1000000) && 0 <= scheme) && tokenlen <= 1000000) || ((((((((c == 0 && urilen <= 1000000) && (scheme <= 999999 || aux-scheme == 0 || (urilen-1 < scheme)-aux)) && 0 <= urilen + 1000000) && 0 <= 1000000 + tokenlen) && 0 <= cp) && cp <= 1000000) && 0 <= scheme) && tokenlen <= 1000000) RESULT: Ultimate proved your program to be correct! [2022-11-25 18:24:16,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eff3f93-392f-43c2-b4e0-037c4e07482c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE