./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- 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-b5237d8 [2022-11-22 02:42:26,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:42:26,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:42:26,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:42:26,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:42:26,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:42:26,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:42:26,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:42:26,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:42:26,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:42:26,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:42:26,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:42:26,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:42:26,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:42:26,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:42:26,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:42:26,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:42:26,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:42:26,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:42:26,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:42:26,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:42:26,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:42:26,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:42:26,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:42:26,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:42:26,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:42:26,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:42:26,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:42:26,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:42:26,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:42:26,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:42:26,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:42:26,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:42:26,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:42:26,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:42:26,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:42:26,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:42:26,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:42:26,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:42:26,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:42:26,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:42:26,261 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 02:42:26,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:42:26,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:42:26,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:42:26,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:42:26,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:42:26,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:42:26,311 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:42:26,311 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:42:26,311 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:42:26,311 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:42:26,312 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:42:26,313 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:42:26,313 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:42:26,313 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:42:26,313 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:42:26,314 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:42:26,314 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:42:26,314 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:42:26,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:42:26,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:42:26,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:42:26,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:42:26,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:42:26,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:42:26,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:42:26,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:42:26,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:42:26,317 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:42:26,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:42:26,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:42:26,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:42:26,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:42:26,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:42:26,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:42:26,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:42:26,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:42:26,320 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:42:26,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:42:26,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:42:26,320 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:42:26,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:42:26,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:42:26,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:42:26,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/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_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba 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 -> Taipan 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2022-11-22 02:42:26,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:42:26,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:42:26,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:42:26,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:42:26,659 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:42:26,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-11-22 02:42:29,826 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:42:30,004 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:42:30,004 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-11-22 02:42:30,011 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/data/9ae1c33cd/e208de4bf6214f879dae15402001ef0e/FLAG5a3ad58f3 [2022-11-22 02:42:30,026 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/data/9ae1c33cd/e208de4bf6214f879dae15402001ef0e [2022-11-22 02:42:30,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:42:30,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:42:30,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:42:30,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:42:30,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:42:30,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5297f444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30, skipping insertion in model container [2022-11-22 02:42:30,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:42:30,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:42:30,204 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_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-11-22 02:42:30,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:42:30,235 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:42:30,249 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_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-11-22 02:42:30,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:42:30,273 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:42:30,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30 WrapperNode [2022-11-22 02:42:30,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:42:30,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:42:30,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:42:30,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:42:30,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,307 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-11-22 02:42:30,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:42:30,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:42:30,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:42:30,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:42:30,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,332 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:42:30,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:42:30,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:42:30,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:42:30,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (1/1) ... [2022-11-22 02:42:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:42:30,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:30,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:42:30,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:42:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:42:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-22 02:42:30,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-22 02:42:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:42:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-11-22 02:42:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-11-22 02:42:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:42:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:42:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:42:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:42:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-22 02:42:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-22 02:42:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:42:30,559 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:42:30,561 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:42:30,792 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:42:30,856 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:42:30,856 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:42:30,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:42:30 BoogieIcfgContainer [2022-11-22 02:42:30,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:42:30,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:42:30,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:42:30,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:42:30,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:42:30" (1/3) ... [2022-11-22 02:42:30,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786427a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:42:30, skipping insertion in model container [2022-11-22 02:42:30,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:42:30" (2/3) ... [2022-11-22 02:42:30,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786427a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:42:30, skipping insertion in model container [2022-11-22 02:42:30,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:42:30" (3/3) ... [2022-11-22 02:42:30,870 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-11-22 02:42:30,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:42:30,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-22 02:42:30,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:42:30,982 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=FINITE_AUTOMATA, 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;@3d814ca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:42:30,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-22 02:42:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:42:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:42:31,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:31,009 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:31,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1844217336, now seen corresponding path program 1 times [2022-11-22 02:42:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:31,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548208318] [2022-11-22 02:42:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:31,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:42:31,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:31,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548208318] [2022-11-22 02:42:31,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548208318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:42:31,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:42:31,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:42:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388631860] [2022-11-22 02:42:31,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:42:31,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:42:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:42:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:42:31,398 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:42:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:31,482 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-11-22 02:42:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:42:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 10 [2022-11-22 02:42:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:31,497 INFO L225 Difference]: With dead ends: 38 [2022-11-22 02:42:31,497 INFO L226 Difference]: Without dead ends: 28 [2022-11-22 02:42:31,502 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-22 02:42:31,508 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:31,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:42:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-22 02:42:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-22 02:42:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.4) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:42:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-22 02:42:31,551 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2022-11-22 02:42:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:31,553 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-22 02:42:31,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:42:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-22 02:42:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:42:31,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:31,555 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:31,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:42:31,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1336162610, now seen corresponding path program 1 times [2022-11-22 02:42:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:31,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763232949] [2022-11-22 02:42:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:42:31,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:31,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763232949] [2022-11-22 02:42:31,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763232949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:31,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957804666] [2022-11-22 02:42:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:31,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:31,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:31,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:31,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:42:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:31,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:42:31,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:42:31,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:42:31,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957804666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:31,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1651768567] [2022-11-22 02:42:31,986 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-22 02:42:31,986 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:31,990 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:42:31,996 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:42:31,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:42:32,416 INFO L321 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-22 02:42:32,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-22 02:42:32,492 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-22 02:42:32,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-11-22 02:42:32,610 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:42:32,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:42:32,755 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 77 for LOIs [2022-11-22 02:42:32,805 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:42:33,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1651768567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:42:33,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:33,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 11 [2022-11-22 02:42:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84735872] [2022-11-22 02:42:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:42:33,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:42:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:42:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:42:33,726 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 9 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:42:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:33,873 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-11-22 02:42:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:42:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 11 [2022-11-22 02:42:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:33,875 INFO L225 Difference]: With dead ends: 30 [2022-11-22 02:42:33,875 INFO L226 Difference]: Without dead ends: 29 [2022-11-22 02:42:33,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:42:33,877 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:33,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 124 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:42:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-22 02:42:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-22 02:42:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:42:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-11-22 02:42:33,888 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 11 [2022-11-22 02:42:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:33,889 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-11-22 02:42:33,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:42:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-11-22 02:42:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:42:33,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:33,890 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:33,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:34,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:34,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2129419375, now seen corresponding path program 1 times [2022-11-22 02:42:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:34,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656898652] [2022-11-22 02:42:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:42:34,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:34,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656898652] [2022-11-22 02:42:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656898652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:42:34,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:42:34,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:42:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656370640] [2022-11-22 02:42:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:42:34,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:42:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:42:34,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:42:34,297 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:42:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:34,394 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-11-22 02:42:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:42:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2022-11-22 02:42:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:34,399 INFO L225 Difference]: With dead ends: 45 [2022-11-22 02:42:34,399 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 02:42:34,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:42:34,407 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:34,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 82 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:42:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 02:42:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-11-22 02:42:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:42:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-22 02:42:34,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 23 [2022-11-22 02:42:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:34,429 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-22 02:42:34,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:42:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-22 02:42:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:42:34,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:34,431 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:34,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:42:34,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2129419567, now seen corresponding path program 1 times [2022-11-22 02:42:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:34,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974641177] [2022-11-22 02:42:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:42:34,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:34,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974641177] [2022-11-22 02:42:34,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974641177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:42:34,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:42:34,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:42:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460313536] [2022-11-22 02:42:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:42:34,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:42:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:42:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:42:34,684 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:42:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:34,789 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-11-22 02:42:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:42:34,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2022-11-22 02:42:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:34,791 INFO L225 Difference]: With dead ends: 68 [2022-11-22 02:42:34,791 INFO L226 Difference]: Without dead ends: 38 [2022-11-22 02:42:34,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:42:34,792 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:34,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:42:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-22 02:42:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-11-22 02:42:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:42:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-22 02:42:34,803 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2022-11-22 02:42:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:34,803 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-22 02:42:34,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:42:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-22 02:42:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:42:34,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:34,805 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:42:34,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -640094866, now seen corresponding path program 1 times [2022-11-22 02:42:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813971935] [2022-11-22 02:42:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:35,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:35,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813971935] [2022-11-22 02:42:35,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813971935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:35,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847844433] [2022-11-22 02:42:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:35,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:35,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:35,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:42:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:35,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:42:35,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:35,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847844433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [854354957] [2022-11-22 02:42:35,329 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:42:35,329 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:35,330 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:42:35,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:35,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-22 02:42:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724980680] [2022-11-22 02:42:35,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:35,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 02:42:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:35,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 02:42:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:42:35,334 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:42:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:35,719 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-11-22 02:42:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:42:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 36 [2022-11-22 02:42:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:35,724 INFO L225 Difference]: With dead ends: 84 [2022-11-22 02:42:35,724 INFO L226 Difference]: Without dead ends: 83 [2022-11-22 02:42:35,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:42:35,726 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 127 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:35,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 177 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:42:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-22 02:42:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-11-22 02:42:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 17 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 02:42:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2022-11-22 02:42:35,739 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 36 [2022-11-22 02:42:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:35,739 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2022-11-22 02:42:35,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:42:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-11-22 02:42:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:42:35,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:35,741 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:35,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:35,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -640094674, now seen corresponding path program 1 times [2022-11-22 02:42:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:35,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509774355] [2022-11-22 02:42:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-22 02:42:36,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:36,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509774355] [2022-11-22 02:42:36,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509774355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:42:36,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:42:36,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:42:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224021390] [2022-11-22 02:42:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:42:36,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:42:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:42:36,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:42:36,066 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:42:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:36,149 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-11-22 02:42:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:42:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-11-22 02:42:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:36,151 INFO L225 Difference]: With dead ends: 69 [2022-11-22 02:42:36,151 INFO L226 Difference]: Without dead ends: 68 [2022-11-22 02:42:36,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:42:36,153 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:36,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:42:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-22 02:42:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-22 02:42:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 17 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 02:42:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2022-11-22 02:42:36,166 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 36 [2022-11-22 02:42:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:36,167 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2022-11-22 02:42:36,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:42:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2022-11-22 02:42:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 02:42:36,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:36,169 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:36,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:42:36,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1631895706, now seen corresponding path program 1 times [2022-11-22 02:42:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:36,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661081449] [2022-11-22 02:42:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:36,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:36,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661081449] [2022-11-22 02:42:36,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661081449] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:36,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465925530] [2022-11-22 02:42:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:36,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:36,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:36,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:36,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:42:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:36,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:42:36,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:36,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:42:36,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465925530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:42:36,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:42:36,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-11-22 02:42:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105756720] [2022-11-22 02:42:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:42:36,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:42:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:42:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:42:36,543 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:42:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:36,669 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2022-11-22 02:42:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:42:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-22 02:42:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:36,671 INFO L225 Difference]: With dead ends: 69 [2022-11-22 02:42:36,671 INFO L226 Difference]: Without dead ends: 68 [2022-11-22 02:42:36,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:42:36,673 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:36,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 59 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:42:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-22 02:42:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-11-22 02:42:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 17 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 02:42:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-11-22 02:42:36,698 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 37 [2022-11-22 02:42:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:36,699 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-11-22 02:42:36,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:42:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-11-22 02:42:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 02:42:36,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:36,700 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-22 02:42:36,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:36,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-22 02:42:36,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1631901664, now seen corresponding path program 1 times [2022-11-22 02:42:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546456348] [2022-11-22 02:42:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:37,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:37,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546456348] [2022-11-22 02:42:37,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546456348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:37,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402705925] [2022-11-22 02:42:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:37,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:37,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:37,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:42:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:37,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 02:42:37,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:37,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:42:37,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402705925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:37,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277151305] [2022-11-22 02:42:37,441 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:42:37,441 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:37,441 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:42:37,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:37,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-11-22 02:42:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296434120] [2022-11-22 02:42:37,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 02:42:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 02:42:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-11-22 02:42:37,446 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-22 02:42:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:37,720 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-11-22 02:42:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:42:37,721 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 37 [2022-11-22 02:42:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:37,725 INFO L225 Difference]: With dead ends: 71 [2022-11-22 02:42:37,725 INFO L226 Difference]: Without dead ends: 70 [2022-11-22 02:42:37,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:42:37,727 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 73 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:37,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 138 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:42:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-22 02:42:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-11-22 02:42:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 17 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 02:42:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-11-22 02:42:37,762 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2022-11-22 02:42:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:37,763 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-11-22 02:42:37,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-22 02:42:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-11-22 02:42:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-22 02:42:37,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:37,769 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:37,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:37,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 02:42:37,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1790890287, now seen corresponding path program 2 times [2022-11-22 02:42:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:37,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676245669] [2022-11-22 02:42:37,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-22 02:42:38,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:38,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676245669] [2022-11-22 02:42:38,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676245669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:38,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192722503] [2022-11-22 02:42:38,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:42:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:38,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:38,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:42:38,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-22 02:42:38,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:42:38,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:42:38,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-22 02:42:38,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-22 02:42:39,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192722503] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2123956877] [2022-11-22 02:42:39,049 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:42:39,049 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:39,049 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:42:39,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:39,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-11-22 02:42:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696041018] [2022-11-22 02:42:39,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:39,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:42:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:39,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:42:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2022-11-22 02:42:39,052 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:42:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:39,847 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2022-11-22 02:42:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-22 02:42:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 75 [2022-11-22 02:42:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:39,849 INFO L225 Difference]: With dead ends: 144 [2022-11-22 02:42:39,849 INFO L226 Difference]: Without dead ends: 143 [2022-11-22 02:42:39,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=986, Invalid=3046, Unknown=0, NotChecked=0, Total=4032 [2022-11-22 02:42:39,852 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 326 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:39,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 262 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:42:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-22 02:42:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2022-11-22 02:42:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.118279569892473) internal successors, (104), 93 states have internal predecessors, (104), 35 states have call successors, (35), 14 states have call predecessors, (35), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-22 02:42:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2022-11-22 02:42:39,870 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 75 [2022-11-22 02:42:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:39,871 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2022-11-22 02:42:39,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:42:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2022-11-22 02:42:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-22 02:42:39,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:39,874 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:39,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:40,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:40,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 653876303, now seen corresponding path program 3 times [2022-11-22 02:42:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:40,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106561150] [2022-11-22 02:42:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-11-22 02:42:41,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:41,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106561150] [2022-11-22 02:42:41,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106561150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317851815] [2022-11-22 02:42:41,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:42:41,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:41,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:41,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:41,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:42:42,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:42:42,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:42:42,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-22 02:42:42,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2022-11-22 02:42:42,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2022-11-22 02:42:42,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317851815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:42,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935952660] [2022-11-22 02:42:42,808 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:42:42,808 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:42,808 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:42:42,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:42,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2022-11-22 02:42:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586515257] [2022-11-22 02:42:42,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:42,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-22 02:42:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-22 02:42:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2022-11-22 02:42:42,814 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 32 states have internal predecessors, (102), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-22 02:42:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:46,133 INFO L93 Difference]: Finished difference Result 288 states and 357 transitions. [2022-11-22 02:42:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-22 02:42:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 32 states have internal predecessors, (102), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 153 [2022-11-22 02:42:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:46,138 INFO L225 Difference]: With dead ends: 288 [2022-11-22 02:42:46,138 INFO L226 Difference]: Without dead ends: 287 [2022-11-22 02:42:46,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5099 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3887, Invalid=13935, Unknown=0, NotChecked=0, Total=17822 [2022-11-22 02:42:46,148 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 777 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:46,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 691 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:42:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-22 02:42:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 240. [2022-11-22 02:42:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 165 states have (on average 1.1393939393939394) internal successors, (188), 165 states have internal predecessors, (188), 71 states have call successors, (71), 26 states have call predecessors, (71), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-22 02:42:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2022-11-22 02:42:46,194 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 153 [2022-11-22 02:42:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:46,195 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2022-11-22 02:42:46,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 32 states have internal predecessors, (102), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-22 02:42:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2022-11-22 02:42:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-22 02:42:46,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:46,201 INFO L195 NwaCegarLoop]: trace histogram [15, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:46,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:46,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:46,409 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 02:42:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1328121611, now seen corresponding path program 1 times [2022-11-22 02:42:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212448406] [2022-11-22 02:42:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:46,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2022-11-22 02:42:47,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:47,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212448406] [2022-11-22 02:42:47,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212448406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:47,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623799433] [2022-11-22 02:42:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:47,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:47,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:47,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:42:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:47,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 02:42:47,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2022-11-22 02:42:48,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2022-11-22 02:42:50,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623799433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:50,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [562082608] [2022-11-22 02:42:50,093 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:42:50,093 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:50,093 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:42:50,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:50,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 37, 37] total 79 [2022-11-22 02:42:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516737384] [2022-11-22 02:42:50,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:50,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-22 02:42:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:50,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-22 02:42:50,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=5178, Unknown=0, NotChecked=0, Total=6162 [2022-11-22 02:42:50,100 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand has 79 states, 79 states have (on average 2.2151898734177213) internal successors, (175), 54 states have internal predecessors, (175), 29 states have call successors, (83), 27 states have call predecessors, (83), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) [2022-11-22 02:42:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:55,862 INFO L93 Difference]: Finished difference Result 364 states and 468 transitions. [2022-11-22 02:42:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-22 02:42:55,864 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.2151898734177213) internal successors, (175), 54 states have internal predecessors, (175), 29 states have call successors, (83), 27 states have call predecessors, (83), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) Word has length 179 [2022-11-22 02:42:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:55,865 INFO L225 Difference]: With dead ends: 364 [2022-11-22 02:42:55,865 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:42:55,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13663 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9055, Invalid=31547, Unknown=0, NotChecked=0, Total=40602 [2022-11-22 02:42:55,883 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 827 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:55,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 450 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 02:42:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:42:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:42:55,884 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-22 02:42:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:42:55,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 179 [2022-11-22 02:42:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:55,885 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:42:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.2151898734177213) internal successors, (175), 54 states have internal predecessors, (175), 29 states have call successors, (83), 27 states have call predecessors, (83), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) [2022-11-22 02:42:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:42:55,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:42:55,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-22 02:42:55,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-22 02:42:55,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-22 02:42:55,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-22 02:42:55,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-22 02:42:55,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-22 02:42:55,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:56,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:56,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:43:00,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-22 02:43:00,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:43:00,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-22 02:43:00,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:43:00,105 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 2147483647) [2022-11-22 02:43:00,105 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 2147483647) [2022-11-22 02:43:00,105 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-11-22 02:43:00,105 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-11-22 02:43:00,105 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= (select |#length| 3) 12) (not (= (ite (<= 0 |ULTIMATE.start_main_~n~0#1|) 1 0) 0)) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (= 31 (select |#length| 2)) (= 2 (select |#length| 1)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 02:43:00,105 INFO L895 garLoopResultBuilder]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (= |ULTIMATE.start_#Ultimate.meminit_#product#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (not (= (ite (and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~n~0#1| 1073741824)) 1 0) 0)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (= 31 (select |#length| 2)) (= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (not (= |ULTIMATE.start_main_#t~malloc14#1.base| 3)) (= |ULTIMATE.start_main_#t~malloc14#1.base| |ULTIMATE.start_main_~a~0#1.base|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_#t~malloc14#1.offset|) (= (select |#valid| 1) 1) (< |ULTIMATE.start_main_#t~malloc14#1.base| |#StackHeapBarrier|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4) (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0) (= (select .cse0 1) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base|)) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 02:43:00,105 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-11-22 02:43:00,105 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2022-11-22 02:43:00,106 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= (select |#length| 3) 12) (= 31 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))) [2022-11-22 02:43:00,106 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-11-22 02:43:00,106 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-11-22 02:43:00,106 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-11-22 02:43:00,106 INFO L899 garLoopResultBuilder]: For program point checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-11-22 02:43:00,107 INFO L902 garLoopResultBuilder]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2022-11-22 02:43:00,107 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-11-22 02:43:00,107 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-22 02:43:00,107 INFO L899 garLoopResultBuilder]: For program point checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-22 02:43:00,107 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-22 02:43:00,107 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-11-22 02:43:00,107 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-11-22 02:43:00,108 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 16 38) no Hoare annotation was computed. [2022-11-22 02:43:00,108 INFO L899 garLoopResultBuilder]: For program point checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-22 02:43:00,108 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2022-11-22 02:43:00,108 INFO L899 garLoopResultBuilder]: For program point checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-11-22 02:43:00,108 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-11-22 02:43:00,108 INFO L899 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2022-11-22 02:43:00,109 INFO L895 garLoopResultBuilder]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 1 |check_#in~x|))) (.cse3 (not (<= 1 |check_#in~y|))) (.cse0 (not (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (.cse1 (not (<= |check_#in~y| 2147483646))) (.cse4 (<= 1 check_~y)) (.cse5 (= .cse8 (select |#memory_int| check_~a.base))) (.cse6 (<= 1 check_~x)) (.cse7 (<= check_~y 2147483646))) (and (or .cse0 .cse1 .cse2 .cse3 (< check_~x 2147483638) (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483646) (not (< |check_#in~x| 2147483645)) .cse2 .cse3) (or .cse0 .cse1 .cse2 (and .cse4 (< check_~x 2147483647) .cse5 .cse6 .cse7) .cse3) (or .cse0 .cse1 (not (<= |check_#in~x| 10)) .cse2 (<= check_~x 11) .cse3) (or .cse0 .cse1 (< check_~x 2147483639) .cse2 .cse3 (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 .cse2 .cse3 (not (< |check_#in~x| 2147483640)) (< check_~x 2147483641)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 5)) .cse3 (<= check_~x 6)) (or .cse0 .cse1 (< check_~x 2147483636) .cse2 .cse3 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483642)) .cse2 .cse3 (< check_~x 2147483643)) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483641)) .cse3 (< check_~x 2147483642)) (or .cse0 .cse1 .cse2 (<= check_~x 3) .cse3 (not (<= |check_#in~x| 2))) (or .cse0 .cse1 .cse2 (<= check_~x 8) .cse3 (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (<= |check_#in~x| 9)) .cse2 (<= check_~x 10) .cse3) (or .cse0 .cse1 .cse2 (<= check_~x 2) (not (<= |check_#in~x| 1)) .cse3) (or .cse0 .cse1 .cse2 (<= check_~x 5) .cse3 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 .cse2 (< check_~x 2147483644) .cse3 (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |check_#in~x| 6)) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (< check_~x 2147483640) .cse3 (not (< |check_#in~x| 2147483639))) (or .cse0 .cse1 (<= check_~x 9) .cse2 .cse3 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (< check_~x 2147483637) .cse2 .cse3 (not (< |check_#in~x| 2147483636))) (or .cse0 .cse1 .cse2 .cse3 (not (< |check_#in~x| 2147483644)) (< check_~x 2147483645)) (or .cse0 .cse1 .cse2 (<= check_~x 4) .cse3 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (not (= |check_#in~x| 0)) (and .cse4 (<= check_~x 1) .cse5 .cse6 .cse7))))) [2022-11-22 02:43:00,110 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse4 (= .cse6 (select |#memory_int| check_~a.base))) (.cse5 (<= check_~y 2147483646)) (.cse0 (not (= .cse6 (select |#memory_int| |check_#in~a.base|)))) (.cse1 (not (<= |check_#in~y| 2147483646))) (.cse2 (not (<= 1 |check_#in~x|))) (.cse3 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (< check_~x 2147483637) .cse2 .cse3 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 .cse2 .cse3 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 .cse2 .cse3 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483645)) .cse2 .cse3 (< check_~x 2147483645)) (or .cse0 .cse1 (< check_~x 2147483639) .cse2 .cse3 (not (< |check_#in~x| 2147483639))) (or .cse0 .cse1 .cse2 (< check_~x 2147483640) .cse3 (not (< |check_#in~x| 2147483640))) (or .cse0 .cse1 .cse2 (<= check_~x 3) .cse3 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 .cse2 (<= check_~x 2) .cse3 (not (<= |check_#in~x| 2))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483641)) .cse3 (< check_~x 2147483641)) (or .cse0 .cse1 .cse2 (< check_~x 2147483644) .cse3 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (< check_~x 2147483636) .cse2 .cse3 (not (< |check_#in~x| 2147483636))) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 1)) .cse3 (<= check_~x 1)) (or .cse0 .cse1 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse3 (and (<= check_~x 2147483645) (<= 2 check_~y) .cse4 (<= 1 check_~x) .cse5)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse3) (or .cse0 .cse1 (not (<= |check_#in~x| 10)) .cse2 (<= check_~x 10) .cse3) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse4 .cse5) .cse1 (not (= |check_#in~x| 0))) (or .cse0 .cse1 .cse2 .cse3 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 .cse2 (<= check_~x 11) .cse3 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 .cse2 (<= check_~x 4) .cse3 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 .cse2 (<= check_~x 8) .cse3 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483642)) .cse2 .cse3 (< check_~x 2147483642))))) [2022-11-22 02:43:00,110 INFO L895 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse4 (= .cse6 (select |#memory_int| check_~a.base))) (.cse5 (<= check_~y 2147483646)) (.cse0 (not (= .cse6 (select |#memory_int| |check_#in~a.base|)))) (.cse1 (not (<= |check_#in~y| 2147483646))) (.cse2 (not (<= 1 |check_#in~x|))) (.cse3 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (< check_~x 2147483637) .cse2 .cse3 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 .cse2 .cse3 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 .cse2 .cse3 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483645)) .cse2 .cse3 (< check_~x 2147483645)) (or .cse0 .cse1 (< check_~x 2147483639) .cse2 .cse3 (not (< |check_#in~x| 2147483639))) (or .cse0 .cse1 .cse2 (< check_~x 2147483640) .cse3 (not (< |check_#in~x| 2147483640))) (or .cse0 .cse1 .cse2 (<= check_~x 3) .cse3 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 .cse2 (<= check_~x 2) .cse3 (not (<= |check_#in~x| 2))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483641)) .cse3 (< check_~x 2147483641)) (or .cse0 .cse1 .cse2 (< check_~x 2147483644) .cse3 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (< check_~x 2147483636) .cse2 .cse3 (not (< |check_#in~x| 2147483636))) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 1)) .cse3 (<= check_~x 1)) (or .cse0 .cse1 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse3 (and (<= check_~x 2147483645) (<= 2 check_~y) .cse4 (<= 1 check_~x) .cse5)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse3) (or .cse0 .cse1 (not (<= |check_#in~x| 10)) .cse2 (<= check_~x 10) .cse3) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse4 .cse5) .cse1 (not (= |check_#in~x| 0))) (or .cse0 .cse1 .cse2 .cse3 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 .cse2 (<= check_~x 11) .cse3 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 .cse2 (<= check_~x 4) .cse3 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 .cse2 (<= check_~x 8) .cse3 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483642)) .cse2 .cse3 (< check_~x 2147483642))))) [2022-11-22 02:43:00,110 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 16 38) no Hoare annotation was computed. [2022-11-22 02:43:00,111 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-11-22 02:43:00,111 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-11-22 02:43:00,111 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-11-22 02:43:00,111 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2022-11-22 02:43:00,114 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:00,116 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:43:00,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:43:00 BoogieIcfgContainer [2022-11-22 02:43:00,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:43:00,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:43:00,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:43:00,132 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:43:00,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:42:30" (3/4) ... [2022-11-22 02:43:00,135 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:43:00,141 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-22 02:43:00,141 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2022-11-22 02:43:00,141 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-22 02:43:00,146 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-22 02:43:00,146 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-22 02:43:00,147 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 02:43:00,147 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:43:00,186 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:43:00,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:43:00,187 INFO L158 Benchmark]: Toolchain (without parser) took 30156.51ms. Allocated memory was 132.1MB in the beginning and 308.3MB in the end (delta: 176.2MB). Free memory was 87.5MB in the beginning and 168.1MB in the end (delta: -80.5MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2022-11-22 02:43:00,187 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:43:00,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.15ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 76.6MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-22 02:43:00,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.28ms. Allocated memory is still 132.1MB. Free memory was 76.6MB in the beginning and 75.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:43:00,188 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 132.1MB. Free memory was 75.2MB in the beginning and 73.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:43:00,189 INFO L158 Benchmark]: RCFGBuilder took 522.27ms. Allocated memory is still 132.1MB. Free memory was 73.7MB in the beginning and 59.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 02:43:00,189 INFO L158 Benchmark]: TraceAbstraction took 29269.02ms. Allocated memory was 132.1MB in the beginning and 308.3MB in the end (delta: 176.2MB). Free memory was 58.6MB in the beginning and 171.2MB in the end (delta: -112.6MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2022-11-22 02:43:00,190 INFO L158 Benchmark]: Witness Printer took 55.16ms. Allocated memory is still 308.3MB. Free memory was 171.2MB in the beginning and 168.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:43:00,191 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.32ms. Allocated memory is still 132.1MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.15ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 76.6MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.28ms. Allocated memory is still 132.1MB. Free memory was 76.6MB in the beginning and 75.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 132.1MB. Free memory was 75.2MB in the beginning and 73.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.27ms. Allocated memory is still 132.1MB. Free memory was 73.7MB in the beginning and 59.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29269.02ms. Allocated memory was 132.1MB in the beginning and 308.3MB in the end (delta: 176.2MB). Free memory was 58.6MB in the beginning and 171.2MB in the end (delta: -112.6MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. * Witness Printer took 55.16ms. Allocated memory is still 308.3MB. Free memory was 171.2MB in the beginning and 168.1MB in the end (delta: 3.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: 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: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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 4 procedures, 38 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2229 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2225 mSDsluCounter, 2182 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1839 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2403 IncrementalHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 343 mSDtfsCounter, 2403 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 936 SyntacticMatches, 1 SemanticMatches, 494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20250 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=10, InterpolantAutomatonStates: 345, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 280 PreInvPairs, 306 NumberOfFragments, 2208 HoareAnnotationTreeSize, 280 FomulaSimplifications, 216 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7731 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1148 NumberOfCodeBlocks, 1148 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1615 ConstructedInterpolants, 0 QuantifiedInterpolants, 4109 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2553 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 3707/5925 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: OVERALL_TIME: 0.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 10, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 7, TOOLS_POST_TIME: 0.5s, TOOLS_POST_CALL_APPLICATIONS: 6, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 17, TOOLS_QUANTIFIERELIM_TIME: 0.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 27, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 10, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 76, DAG_COMPRESSION_RETAINED_NODES: 30, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: n <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-11-22 02:43:00,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c9e91d7-ae0d-49b3-8174-ebfc46a93768/bin/utaipan-g80aRyZoba/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