./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc 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_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:51:43,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:51:43,076 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 19:51:43,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:51:43,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:51:43,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:51:43,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:51:43,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:51:43,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:51:43,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:51:43,113 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:51:43,114 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:51:43,115 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:51:43,115 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:51:43,116 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:51:43,116 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:51:43,117 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:51:43,117 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:51:43,118 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:51:43,118 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:51:43,119 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:51:43,121 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:51:43,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:51:43,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:51:43,123 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:51:43,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:51:43,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:51:43,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:51:43,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:51:43,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:51:43,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:51:43,126 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 19:51:43,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:51:43,126 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:51:43,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:51:43,127 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:51:43,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:51:43,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:51:43,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:51:43,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:51:43,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:51:43,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:51:43,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:51:43,129 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:51:43,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:51:43,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:51:43,130 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:51:43,130 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:51:43,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:51:43,130 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/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_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2023-12-02 19:51:43,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:51:43,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:51:43,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:51:43,382 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:51:43,382 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:51:43,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-12-02 19:51:46,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:51:46,351 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:51:46,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-12-02 19:51:46,367 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/data/875e544f1/73078e9ffbaa4b5a9149adce326da248/FLAG136426ad2 [2023-12-02 19:51:46,378 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/data/875e544f1/73078e9ffbaa4b5a9149adce326da248 [2023-12-02 19:51:46,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:51:46,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:51:46,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:51:46,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:51:46,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:51:46,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae6e653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46, skipping insertion in model container [2023-12-02 19:51:46,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,435 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:51:46,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:51:46,709 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:51:46,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:51:46,784 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:51:46,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46 WrapperNode [2023-12-02 19:51:46,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:51:46,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:51:46,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:51:46,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:51:46,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,834 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 142 [2023-12-02 19:51:46,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:51:46,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:51:46,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:51:46,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:51:46,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:51:46,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:51:46,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:51:46,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:51:46,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (1/1) ... [2023-12-02 19:51:46,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:51:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:51:46,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:51:46,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:51:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:51:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:51:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:51:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:51:46,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:51:47,052 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:51:47,053 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:51:47,255 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:51:47,315 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:51:47,316 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 19:51:47,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:51:47 BoogieIcfgContainer [2023-12-02 19:51:47,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:51:47,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:51:47,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:51:47,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:51:47,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:51:46" (1/3) ... [2023-12-02 19:51:47,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ef2188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:51:47, skipping insertion in model container [2023-12-02 19:51:47,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:51:46" (2/3) ... [2023-12-02 19:51:47,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ef2188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:51:47, skipping insertion in model container [2023-12-02 19:51:47,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:51:47" (3/3) ... [2023-12-02 19:51:47,328 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2023-12-02 19:51:47,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:51:47,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-12-02 19:51:47,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:51:47,394 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@17e5ce16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:51:47,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-12-02 19:51:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.896551724137931) internal successors, (55), 47 states have internal predecessors, (55), 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) [2023-12-02 19:51:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 19:51:47,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:47,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 19:51:47,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:47,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash 189815, now seen corresponding path program 1 times [2023-12-02 19:51:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576458408] [2023-12-02 19:51:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:47,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576458408] [2023-12-02 19:51:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576458408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:51:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600551002] [2023-12-02 19:51:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:47,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:51:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:51:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:51:47,625 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.896551724137931) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-12-02 19:51:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:47,682 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2023-12-02 19:51:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:51:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-12-02 19:51:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:47,691 INFO L225 Difference]: With dead ends: 50 [2023-12-02 19:51:47,691 INFO L226 Difference]: Without dead ends: 42 [2023-12-02 19:51:47,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:51:47,697 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:47,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-02 19:51:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-02 19:51:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 41 states have internal predecessors, (46), 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) [2023-12-02 19:51:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-12-02 19:51:47,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 3 [2023-12-02 19:51:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:47,726 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-12-02 19:51:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-12-02 19:51:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-12-02 19:51:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 19:51:47,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:47,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 19:51:47,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:51:47,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:47,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 5734527, now seen corresponding path program 1 times [2023-12-02 19:51:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991879728] [2023-12-02 19:51:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:47,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991879728] [2023-12-02 19:51:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991879728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:47,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:51:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026980997] [2023-12-02 19:51:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:47,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:51:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:51:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:51:47,850 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-12-02 19:51:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:47,901 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-12-02 19:51:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:51:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 19:51:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:47,902 INFO L225 Difference]: With dead ends: 78 [2023-12-02 19:51:47,903 INFO L226 Difference]: Without dead ends: 42 [2023-12-02 19:51:47,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:51:47,905 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:47,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-02 19:51:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-02 19:51:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 41 states have internal predecessors, (46), 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) [2023-12-02 19:51:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-12-02 19:51:47,914 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 4 [2023-12-02 19:51:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:47,914 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-12-02 19:51:47,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-12-02 19:51:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-12-02 19:51:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 19:51:47,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:47,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 19:51:47,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:51:47,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:47,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 177770393, now seen corresponding path program 1 times [2023-12-02 19:51:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095186649] [2023-12-02 19:51:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:48,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095186649] [2023-12-02 19:51:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095186649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:48,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:51:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614893388] [2023-12-02 19:51:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:48,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:51:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:51:48,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:51:48,020 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-12-02 19:51:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:48,055 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-12-02 19:51:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:51:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 19:51:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:48,057 INFO L225 Difference]: With dead ends: 42 [2023-12-02 19:51:48,057 INFO L226 Difference]: Without dead ends: 41 [2023-12-02 19:51:48,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:51:48,059 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:48,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-02 19:51:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-02 19:51:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 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) [2023-12-02 19:51:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-12-02 19:51:48,066 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 5 [2023-12-02 19:51:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:48,067 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-12-02 19:51:48,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-12-02 19:51:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-12-02 19:51:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:51:48,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:48,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:48,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:51:48,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:48,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash 263296145, now seen corresponding path program 1 times [2023-12-02 19:51:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258146010] [2023-12-02 19:51:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:51:48,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258146010] [2023-12-02 19:51:48,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258146010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:48,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:48,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:51:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439322946] [2023-12-02 19:51:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:48,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:51:48,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:51:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:51:48,127 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-12-02 19:51:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:48,158 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-12-02 19:51:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:51:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 19:51:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:48,159 INFO L225 Difference]: With dead ends: 41 [2023-12-02 19:51:48,159 INFO L226 Difference]: Without dead ends: 39 [2023-12-02 19:51:48,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:51:48,161 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:48,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-02 19:51:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-02 19:51:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 38 states have internal predecessors, (43), 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) [2023-12-02 19:51:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-12-02 19:51:48,168 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 8 [2023-12-02 19:51:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:48,168 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-12-02 19:51:48,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-12-02 19:51:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-12-02 19:51:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:51:48,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:48,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:48,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 19:51:48,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:48,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash -375472749, now seen corresponding path program 1 times [2023-12-02 19:51:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131399270] [2023-12-02 19:51:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:51:48,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131399270] [2023-12-02 19:51:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131399270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:48,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:51:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002622356] [2023-12-02 19:51:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:48,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:51:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:51:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:51:48,239 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 19:51:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:48,291 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-12-02 19:51:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:51:48,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 19:51:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:48,292 INFO L225 Difference]: With dead ends: 43 [2023-12-02 19:51:48,292 INFO L226 Difference]: Without dead ends: 41 [2023-12-02 19:51:48,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:51:48,294 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:48,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-02 19:51:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-12-02 19:51:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 36 states have internal predecessors, (41), 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) [2023-12-02 19:51:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-12-02 19:51:48,301 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2023-12-02 19:51:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:48,301 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-12-02 19:51:48,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 19:51:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-12-02 19:51:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:51:48,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:48,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:48,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 19:51:48,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:48,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1245246747, now seen corresponding path program 1 times [2023-12-02 19:51:48,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:48,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561008501] [2023-12-02 19:51:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:48,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:51:48,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561008501] [2023-12-02 19:51:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561008501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:51:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635781577] [2023-12-02 19:51:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:48,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:51:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:48,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:51:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:51:48,366 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:48,427 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-12-02 19:51:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:51:48,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 19:51:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:48,428 INFO L225 Difference]: With dead ends: 64 [2023-12-02 19:51:48,429 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 19:51:48,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:51:48,430 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 86 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:48,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 19:51:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2023-12-02 19:51:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 42 states have internal predecessors, (48), 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) [2023-12-02 19:51:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-12-02 19:51:48,439 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2023-12-02 19:51:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:48,439 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-12-02 19:51:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-12-02 19:51:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:51:48,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:48,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:48,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:51:48,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:48,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1613745137, now seen corresponding path program 1 times [2023-12-02 19:51:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:48,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879159872] [2023-12-02 19:51:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:48,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879159872] [2023-12-02 19:51:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879159872] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:51:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22329507] [2023-12-02 19:51:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:48,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:51:48,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:51:48,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:51:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:48,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:51:48,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:51:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:48,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:51:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22329507] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:51:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1204331309] [2023-12-02 19:51:48,712 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 19:51:48,712 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:51:48,714 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:51:48,718 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:51:48,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:51:53,665 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:51:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1204331309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:53,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:51:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 10 [2023-12-02 19:51:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845268787] [2023-12-02 19:51:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:53,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:51:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:51:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:51:53,970 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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) [2023-12-02 19:51:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:54,150 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2023-12-02 19:51:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:51:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:51:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:54,151 INFO L225 Difference]: With dead ends: 95 [2023-12-02 19:51:54,151 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 19:51:54,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:51:54,152 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:54,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 98 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:51:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 19:51:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2023-12-02 19:51:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.411764705882353) internal successors, (48), 43 states have internal predecessors, (48), 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) [2023-12-02 19:51:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-12-02 19:51:54,160 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2023-12-02 19:51:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:54,161 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-12-02 19:51:54,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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) [2023-12-02 19:51:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-12-02 19:51:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:51:54,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:54,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:54,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:51:54,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:54,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:54,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1613748931, now seen corresponding path program 1 times [2023-12-02 19:51:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:54,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330541785] [2023-12-02 19:51:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:51:54,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330541785] [2023-12-02 19:51:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330541785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:51:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:51:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721944326] [2023-12-02 19:51:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:54,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:51:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:51:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:51:54,417 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-12-02 19:51:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:54,451 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-12-02 19:51:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:51:54,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:51:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:54,452 INFO L225 Difference]: With dead ends: 44 [2023-12-02 19:51:54,452 INFO L226 Difference]: Without dead ends: 43 [2023-12-02 19:51:54,453 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 [2023-12-02 19:51:54,453 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:54,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:51:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-02 19:51:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-02 19:51:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 42 states have internal predecessors, (47), 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) [2023-12-02 19:51:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-12-02 19:51:54,461 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2023-12-02 19:51:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:54,461 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-12-02 19:51:54,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-12-02 19:51:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-12-02 19:51:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 19:51:54,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:54,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:54,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 19:51:54,462 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:54,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1513390782, now seen corresponding path program 1 times [2023-12-02 19:51:54,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:54,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202097839] [2023-12-02 19:51:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:54,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202097839] [2023-12-02 19:51:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202097839] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:51:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638144069] [2023-12-02 19:51:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:54,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:54,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:51:54,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:51:54,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:51:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:54,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:51:54,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:51:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:54,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:51:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638144069] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:51:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1580360840] [2023-12-02 19:51:54,679 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:51:54,680 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:51:54,680 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:51:54,680 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:51:54,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:51:59,257 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:51:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1580360840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:51:59,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:51:59,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 11 [2023-12-02 19:51:59,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293812932] [2023-12-02 19:51:59,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:51:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 19:51:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:59,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 19:51:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:51:59,584 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:59,773 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-12-02 19:51:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:51:59,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-02 19:51:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:59,775 INFO L225 Difference]: With dead ends: 64 [2023-12-02 19:51:59,775 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 19:51:59,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:51:59,776 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 77 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:59,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 93 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:51:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 19:51:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2023-12-02 19:51:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 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) [2023-12-02 19:51:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-12-02 19:51:59,783 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 14 [2023-12-02 19:51:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:59,784 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-12-02 19:51:59,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-12-02 19:51:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 19:51:59,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:59,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:59,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:51:59,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:59,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:51:59,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1625365262, now seen corresponding path program 1 times [2023-12-02 19:51:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757644015] [2023-12-02 19:51:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:52:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:52:00,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:52:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757644015] [2023-12-02 19:52:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757644015] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:52:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174359086] [2023-12-02 19:52:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:52:00,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:52:00,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:52:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:00,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:52:00,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:52:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:52:00,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:52:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:52:00,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174359086] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:52:00,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [494237069] [2023-12-02 19:52:00,232 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 19:52:00,233 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:52:00,233 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:52:00,233 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:52:00,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:52:01,383 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:52:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [494237069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:52:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:52:25,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 16 [2023-12-02 19:52:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017829377] [2023-12-02 19:52:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:52:25,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:52:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:52:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:52:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=195, Unknown=5, NotChecked=0, Total=240 [2023-12-02 19:52:25,881 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2023-12-02 19:52:30,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:32,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:35,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:39,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:41,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:43,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:52:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:52:44,269 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-12-02 19:52:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 19:52:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 19:52:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:52:44,270 INFO L225 Difference]: With dead ends: 53 [2023-12-02 19:52:44,270 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 19:52:44,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=40, Invalid=195, Unknown=5, NotChecked=0, Total=240 [2023-12-02 19:52:44,271 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:52:44,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 18.4s Time] [2023-12-02 19:52:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 19:52:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2023-12-02 19:52:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 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) [2023-12-02 19:52:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-02 19:52:44,285 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2023-12-02 19:52:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:52:44,285 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-02 19:52:44,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2023-12-02 19:52:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-02 19:52:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:52:44,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:52:44,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:52:44,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 19:52:44,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:44,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:52:44,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:52:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2056195447, now seen corresponding path program 1 times [2023-12-02 19:52:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:52:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657265170] [2023-12-02 19:52:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:52:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:52:44,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:52:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657265170] [2023-12-02 19:52:44,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657265170] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:52:44,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217537923] [2023-12-02 19:52:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:44,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:52:44,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:52:44,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:52:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:44,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:52:44,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:52:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:52:44,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:52:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:52:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217537923] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:52:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2074129783] [2023-12-02 19:52:44,678 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 19:52:44,678 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:52:44,678 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:52:44,678 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:52:44,678 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:52:47,449 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:52:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2074129783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:52:58,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:52:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 14 [2023-12-02 19:52:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970149590] [2023-12-02 19:52:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:52:58,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 19:52:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:52:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 19:52:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2023-12-02 19:52:58,072 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:09,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:53:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:53:09,784 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2023-12-02 19:53:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:53:09,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 19:53:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:53:09,785 INFO L225 Difference]: With dead ends: 58 [2023-12-02 19:53:09,786 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 19:53:09,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=57, Invalid=246, Unknown=3, NotChecked=0, Total=306 [2023-12-02 19:53:09,786 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:53:09,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 78 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 3 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 19:53:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 19:53:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2023-12-02 19:53:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 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) [2023-12-02 19:53:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-12-02 19:53:09,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2023-12-02 19:53:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:53:09,802 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-12-02 19:53:09,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-12-02 19:53:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:53:09,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:53:09,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:53:09,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:53:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:53:10,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:53:10,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:53:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1036283804, now seen corresponding path program 1 times [2023-12-02 19:53:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:53:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593035116] [2023-12-02 19:53:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:53:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:53:10,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:53:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593035116] [2023-12-02 19:53:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593035116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:53:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:53:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:53:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338041809] [2023-12-02 19:53:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:53:10,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:53:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:53:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:53:10,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:53:10,049 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:53:10,079 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2023-12-02 19:53:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:53:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 19:53:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:53:10,080 INFO L225 Difference]: With dead ends: 39 [2023-12-02 19:53:10,081 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 19:53:10,081 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 [2023-12-02 19:53:10,082 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:53:10,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:53:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 19:53:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-02 19:53:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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) [2023-12-02 19:53:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-12-02 19:53:10,094 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2023-12-02 19:53:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:53:10,094 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-12-02 19:53:10,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-12-02 19:53:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:53:10,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:53:10,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:53:10,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 19:53:10,096 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:53:10,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:53:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2060026716, now seen corresponding path program 1 times [2023-12-02 19:53:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:53:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172530772] [2023-12-02 19:53:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:10,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:53:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:53:10,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:53:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172530772] [2023-12-02 19:53:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172530772] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:53:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647193473] [2023-12-02 19:53:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:10,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:53:10,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:53:10,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:53:10,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:53:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:10,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:53:10,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:53:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:53:10,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:53:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:53:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647193473] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:53:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009574201] [2023-12-02 19:53:10,313 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 19:53:10,313 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:53:10,313 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:53:10,313 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:53:10,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:53:13,002 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:53:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1009574201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:53:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:53:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 19 [2023-12-02 19:53:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299864989] [2023-12-02 19:53:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:53:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 19:53:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:53:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 19:53:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=316, Unknown=3, NotChecked=0, Total=380 [2023-12-02 19:53:26,472 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2023-12-02 19:53:34,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:53:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:53:35,026 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-12-02 19:53:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:53:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:53:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:53:35,027 INFO L225 Difference]: With dead ends: 75 [2023-12-02 19:53:35,027 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 19:53:35,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=96, Invalid=500, Unknown=4, NotChecked=0, Total=600 [2023-12-02 19:53:35,028 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:53:35,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 60 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 324 Invalid, 4 Unknown, 0 Unchecked, 5.9s Time] [2023-12-02 19:53:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 19:53:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2023-12-02 19:53:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 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) [2023-12-02 19:53:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-02 19:53:35,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 26 [2023-12-02 19:53:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:53:35,042 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-02 19:53:35,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2023-12-02 19:53:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-02 19:53:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:53:35,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:53:35,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:53:35,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:53:35,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:53:35,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:53:35,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:53:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1541530295, now seen corresponding path program 1 times [2023-12-02 19:53:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:53:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684223574] [2023-12-02 19:53:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:53:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 19:53:35,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:53:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684223574] [2023-12-02 19:53:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684223574] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:53:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748199554] [2023-12-02 19:53:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:53:35,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:53:35,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:53:35,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:53:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:35,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:53:35,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:53:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 19:53:35,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:53:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 19:53:35,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748199554] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:53:35,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [973641834] [2023-12-02 19:53:35,479 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 19:53:35,479 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:53:35,479 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:53:35,480 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:53:35,480 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:53:40,306 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:53:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [973641834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:53:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:53:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 17 [2023-12-02 19:53:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311691635] [2023-12-02 19:53:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:53:41,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:53:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:53:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:53:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-02 19:53:41,057 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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) [2023-12-02 19:53:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:53:41,713 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-12-02 19:53:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:53:41,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 19:53:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:53:41,714 INFO L225 Difference]: With dead ends: 54 [2023-12-02 19:53:41,714 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 19:53:41,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2023-12-02 19:53:41,715 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:53:41,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 37 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:53:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 19:53:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2023-12-02 19:53:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-02 19:53:41,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 35 [2023-12-02 19:53:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:53:41,732 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-02 19:53:41,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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) [2023-12-02 19:53:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-02 19:53:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:53:41,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:53:41,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:53:41,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:53:41,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 19:53:41,934 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:53:41,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:53:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1541459507, now seen corresponding path program 1 times [2023-12-02 19:53:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:53:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907765174] [2023-12-02 19:53:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:53:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 19:53:42,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:53:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907765174] [2023-12-02 19:53:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907765174] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:53:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280320890] [2023-12-02 19:53:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:53:42,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:53:42,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:53:42,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:53:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:42,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:53:42,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:53:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 19:53:42,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:53:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 19:53:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280320890] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:53:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [283139522] [2023-12-02 19:53:42,168 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 19:53:42,168 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:53:42,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:53:42,168 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:53:42,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:53:45,394 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:53:59,571 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2793#(and (<= |ULTIMATE.start_main_~expected~0#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_#t~post14#1|) (<= 0 (+ |ULTIMATE.start_main_~expected~0#1| 2147483648)) (<= (+ 2147483648 |ULTIMATE.start_main_#t~post14#1|) 0) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_29| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_29| Int)) (= |ULTIMATE.start_sll_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_29|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_29|))))' at error location [2023-12-02 19:53:59,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:53:59,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:53:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-12-02 19:53:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791362885] [2023-12-02 19:53:59,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:53:59,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:53:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:53:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:53:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=687, Unknown=1, NotChecked=0, Total=756 [2023-12-02 19:53:59,573 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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) [2023-12-02 19:53:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:53:59,749 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2023-12-02 19:53:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 19:53:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 19:53:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:53:59,750 INFO L225 Difference]: With dead ends: 100 [2023-12-02 19:53:59,750 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 19:53:59,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=83, Invalid=846, Unknown=1, NotChecked=0, Total=930 [2023-12-02 19:53:59,751 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:53:59,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 102 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:53:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 19:53:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-12-02 19:53:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 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) [2023-12-02 19:53:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-12-02 19:53:59,769 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 35 [2023-12-02 19:53:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:53:59,769 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-12-02 19:53:59,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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) [2023-12-02 19:53:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-12-02 19:53:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 19:53:59,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:53:59,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:53:59,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 19:53:59,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 19:53:59,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:53:59,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:53:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 491371346, now seen corresponding path program 1 times [2023-12-02 19:53:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:53:59,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030300119] [2023-12-02 19:53:59,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:53:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:54:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:54:00,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:54:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030300119] [2023-12-02 19:54:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030300119] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:54:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366738369] [2023-12-02 19:54:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:54:00,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:54:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:54:00,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:54:00,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 19:54:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:54:00,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:54:00,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:54:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 19:54:00,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:54:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366738369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:54:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:54:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-12-02 19:54:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464353687] [2023-12-02 19:54:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:54:00,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:54:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:54:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:54:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:54:00,299 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:54:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:54:00,384 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-12-02 19:54:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:54:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-02 19:54:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:54:00,385 INFO L225 Difference]: With dead ends: 58 [2023-12-02 19:54:00,386 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 19:54:00,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:54:00,387 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:54:00,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:54:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 19:54:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2023-12-02 19:54:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 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) [2023-12-02 19:54:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-12-02 19:54:00,415 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 40 [2023-12-02 19:54:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:54:00,415 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-12-02 19:54:00,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:54:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-12-02 19:54:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 19:54:00,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:54:00,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:54:00,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 19:54:00,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 19:54:00,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 19:54:00,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:54:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash 864300447, now seen corresponding path program 1 times [2023-12-02 19:54:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:54:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849450024] [2023-12-02 19:54:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:54:00,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:54:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:54:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 19:54:00,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:54:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849450024] [2023-12-02 19:54:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849450024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:54:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734509610] [2023-12-02 19:54:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:54:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:54:00,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:54:00,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:54:00,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:54:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:54:00,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:54:00,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:54:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 19:54:01,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:54:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 19:54:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734509610] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:54:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1172859572] [2023-12-02 19:54:01,055 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 19:54:01,055 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:54:01,055 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:54:01,055 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:54:01,055 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:54:05,970 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:54:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1172859572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:54:06,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:54:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [7, 6, 6] total 27 [2023-12-02 19:54:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384361805] [2023-12-02 19:54:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:54:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 19:54:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:54:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 19:54:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2023-12-02 19:54:06,995 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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) [2023-12-02 19:54:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:54:07,904 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-12-02 19:54:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 19:54:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-02 19:54:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:54:07,905 INFO L225 Difference]: With dead ends: 54 [2023-12-02 19:54:07,905 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 19:54:07,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 19:54:07,907 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:54:07,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:54:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 19:54:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 19:54:07,908 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) [2023-12-02 19:54:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 19:54:07,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2023-12-02 19:54:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:54:07,908 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 19:54:07,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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) [2023-12-02 19:54:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 19:54:07,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 19:54:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-12-02 19:54:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-12-02 19:54:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-12-02 19:54:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-12-02 19:54:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-12-02 19:54:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-12-02 19:54:07,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-12-02 19:54:07,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-12-02 19:54:07,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-12-02 19:54:07,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-12-02 19:54:07,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-02 19:54:08,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 19:54:08,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 19:54:40,022 WARN L293 SmtUtils]: Spent 31.23s on a formula simplification. DAG size of input: 490 DAG size of output: 221 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 19:55:00,894 WARN L293 SmtUtils]: Spent 19.11s on a formula simplification. DAG size of input: 430 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point L622-5(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 613 632) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 19:55:00,897 INFO L899 garLoopResultBuilder]: For program point L622-6(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,898 INFO L895 garLoopResultBuilder]: At program point L622-7(lines 622 627) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (or (= |ULTIMATE.start_main_~i~0#1| 1) (and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_46| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.base_46| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_46|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_46|) |ULTIMATE.start_sll_get_data_at_#res#1|)) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 19:55:00,898 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-12-02 19:55:00,898 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,898 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2023-12-02 19:55:00,898 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2023-12-02 19:55:00,898 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,898 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-12-02 19:55:00,899 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_update_at_~index#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (let ((.cse0 (= |ULTIMATE.start_main_~new_data~0#1| |ULTIMATE.start_sll_update_at_#in~data#1|)) (.cse1 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|)) (.cse4 (= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse5 (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_sll_update_at_#in~head#1.base|) .cse1 (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_sll_update_at_#in~index#1|) .cse2 .cse3 (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0) .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_#in~head#1.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_#in~head#1.base|) 4) |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse1 .cse2 (= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_sll_update_at_#in~index#1|) .cse3 .cse4 .cse5)))) [2023-12-02 19:55:00,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,899 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2023-12-02 19:55:00,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,899 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 19:55:00,899 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (<= 0 (+ 4294967295 |ULTIMATE.start_main_~expected~0#1|))) (.cse3 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (<= |ULTIMATE.start_main_~expected~0#1| 4294967294)) (.cse7 (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 2147483647)) (.cse8 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 (= |ULTIMATE.start_sll_get_data_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 1) .cse8 .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_~index#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 2147483647) .cse8 .cse9))) [2023-12-02 19:55:00,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: (<= 2 |ULTIMATE.start_main_~len~0#1|) [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L618-1(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2023-12-02 19:55:00,900 INFO L899 garLoopResultBuilder]: For program point L618-5(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,901 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse7 (= |ULTIMATE.start_sll_create_#in~data#1| 1))) (or (let ((.cse6 (select |#memory_int| 1))) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 (= 2 (select |#length| 1)) .cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse2 (= (select |#valid| 1) 1) .cse3 (= (select |#valid| 0) 0) .cse4 (= (select |#valid| 2) 1) .cse5 (= (select .cse6 0) 48) (= 27 (select |#length| 2)) .cse7 (= (select .cse6 1) 0))) (and .cse0 .cse1 (= |ULTIMATE.start_node_create_#res#1.offset| 0) .cse2 .cse3 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse4 .cse5 .cse7 (exists ((|v_ULTIMATE.start_sll_create_~len#1_42| Int)) (let ((.cse9 (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)) (.cse15 (not (= |ULTIMATE.start_node_create_#res#1.base| 0))) (.cse16 (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse17 (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse21 (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (let ((.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (and (not (= .cse8 0)) .cse9 (exists ((|v_#valid_24| (Array Int Int))) (let ((.cse10 (store |v_#valid_24| .cse8 1))) (and (= (select |v_#valid_24| 1) 1) (= (store .cse10 |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_24| .cse8) 0) (= (select .cse10 |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_24| 0) 0) (= (select |v_#valid_24| 2) 1)))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_$Pointer$.offset_77| .cse8))) (and (= (store |v_#memory_$Pointer$.offset_75| .cse8 (store (store (select |v_#memory_$Pointer$.offset_75| .cse8) 4 0) 0 (select .cse11 0))) |v_#memory_$Pointer$.offset_77|) (= (let ((.cse12 (store |v_#memory_$Pointer$.offset_77| .cse8 (store .cse11 4 0)))) (store .cse12 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse12 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0)))))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_$Pointer$.base_77| .cse8))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse8))) (= (let ((.cse13 (store |v_#memory_$Pointer$.base_77| .cse8 (store .cse14 4 0)))) (store .cse13 |ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse13 |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0)))) |v_#memory_$Pointer$.base_28|) (= |v_#memory_$Pointer$.base_77| (store |v_#memory_$Pointer$.base_75| .cse8 (store (store (select |v_#memory_$Pointer$.base_75| .cse8) 4 0) 0 (select .cse14 0))))))) .cse15 .cse16 .cse17 (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_#memory_int_87| .cse8)) (.cse19 (select |v_#memory_int_85| 1)) (.cse22 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (store |v_#memory_int_87| .cse8 (store (store .cse18 0 1) 4 (select (select |v_#memory_int_86| .cse8) 4))) |v_#memory_int_86|) (= (select .cse19 1) 0) (= |v_#memory_int_87| (store |v_#memory_int_85| .cse8 (store (select |v_#memory_int_85| .cse8) 4 (select .cse18 4)))) (= 48 (select .cse19 0)) (= |#memory_int| (let ((.cse20 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse22 0 1)))) (store .cse20 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse21)))) (= (store |v_#memory_int_86| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse22 4))) |v_#memory_int_36|)))) (= |ULTIMATE.start_sll_create_~len#1| 0) (exists ((|v_#length_22| (Array Int Int))) (and (= (select |v_#length_22| 1) 2) (= (select |v_#length_22| 2) 27) (= |#length| (store (store |v_#length_22| .cse8 8) |ULTIMATE.start_node_create_#res#1.base| 8)))) (<= (+ .cse8 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_create_~len#1_42| 1))) (and .cse9 (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.base_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_28|))) (= 2 |v_ULTIMATE.start_sll_create_~len#1_42|) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_28|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_28| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 0))))) (exists ((|v_#length_22| (Array Int Int))) (and (= |#length| (store |v_#length_22| |ULTIMATE.start_node_create_#res#1.base| 8)) (= (select |v_#length_22| 1) 2) (= (select |v_#length_22| 2) 27))) .cse15 .cse16 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse17 (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_int_36| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_int_85| 1)) (.cse24 (select |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base|))) (and (= (select .cse23 1) 0) (= (store |v_#memory_int_85| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_85| |ULTIMATE.start_node_create_#res#1.base|) 4 (select .cse24 4))) |v_#memory_int_36|) (= 48 (select .cse23 0)) (= |#memory_int| (let ((.cse25 (store |v_#memory_int_36| |ULTIMATE.start_node_create_#res#1.base| (store .cse24 0 1)))) (store .cse25 |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 .cse21))))))) (exists ((|v_#valid_24| (Array Int Int))) (and (= (select |v_#valid_24| 1) 1) (= (store |v_#valid_24| |ULTIMATE.start_node_create_#res#1.base| 1) |#valid|) (= (select |v_#valid_24| 0) 0) (= (select |v_#valid_24| |ULTIMATE.start_node_create_#res#1.base|) 0) (= (select |v_#valid_24| 2) 1)))))))))) [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point L618-6(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L895 garLoopResultBuilder]: At program point L618-7(lines 618 621) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 19:55:00,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2023-12-02 19:55:00,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2023-12-02 19:55:00,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 19:55:00,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2023-12-02 19:55:00,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 19:55:00,905 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:55:00,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:55:00,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:55:00,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_get_data_at_~head#1.offset_46 : int, v_ULTIMATE.start_sll_get_data_at_~head#1.base_46 : int :: #memory_int[v_ULTIMATE.start_sll_get_data_at_~head#1.base_46][v_ULTIMATE.start_sll_get_data_at_~head#1.offset_46] == #res) could not be translated [2023-12-02 19:55:00,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 19:55:00,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 19:55:00,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 19:55:00,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 19:55:00,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 19:55:00,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 19:55:00,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 19:55:00,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_42 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#valid_24 : [int]int :: ((((v_#valid_24[1] == 1 && v_#valid_24[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid) && v_#valid_24[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_24[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_24[0] == 0) && v_#valid_24[2] == 1)) && (exists v_#memory_$Pointer$.offset_75 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_75[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_75[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_77 && v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#memory_$Pointer$.base_75 : [int,int]int, v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28) && v_#memory_$Pointer$.base_77 == v_#memory_$Pointer$.base_75[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_75[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4]][0]]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#memory_int_85 : [int,int]int, v_#memory_int_86 : [int,int]int, v_#memory_int_87 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_87[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_87[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_86[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_86 && v_#memory_int_85[1][1] == 0) && v_#memory_int_87 == v_#memory_int_85[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_85[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_87[#memory_$Pointer$.base[~new_head~0!base][4]][4]]]) && 48 == v_#memory_int_85[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && v_#memory_int_86[#res!base := v_#memory_int_86[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36)) && ~len == 0) && (exists v_#length_22 : [int]int :: (v_#length_22[1] == 2 && v_#length_22[2] == 27) && #length == v_#length_22[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && v_ULTIMATE.start_sll_create_~len#1_42 == 1) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#memory_$Pointer$.base_75 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_75[#res!base := v_#memory_$Pointer$.base_75[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && 2 == v_ULTIMATE.start_sll_create_~len#1_42) && (exists v_#memory_$Pointer$.offset_75 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_75[#res!base := v_#memory_$Pointer$.offset_75[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#length_22 : [int]int :: (#length == v_#length_22[#res!base := 8] && v_#length_22[1] == 2) && v_#length_22[2] == 27)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_int_85 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_85[1][1] == 0 && v_#memory_int_85[#res!base := v_#memory_int_85[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && 48 == v_#memory_int_85[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#valid_24 : [int]int :: (((v_#valid_24[1] == 1 && v_#valid_24[#res!base := 1] == #valid) && v_#valid_24[0] == 0) && v_#valid_24[#res!base] == 0) && v_#valid_24[2] == 1))) could not be translated [2023-12-02 19:55:00,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:55:00,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:55:00,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 19:55:00,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:55:00,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:55:00,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,937 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:55:00,937 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,937 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:55:00,937 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,938 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,938 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 19:55:00,938 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:55:00,938 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:55:00,940 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:55:00,940 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,940 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,940 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,940 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:55:00,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:55:00,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:55:00,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,942 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,942 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,942 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:55:00,942 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,942 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:55:00,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:55:00,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][4] could not be translated [2023-12-02 19:55:00,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][4] could not be translated [2023-12-02 19:55:00,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:55:00,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:55:00,945 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,945 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:55:00,945 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:55:00,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:55:00 BoogieIcfgContainer [2023-12-02 19:55:00,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:55:00,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:55:00,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:55:00,946 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:55:00,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:51:47" (3/4) ... [2023-12-02 19:55:00,949 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 19:55:00,958 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2023-12-02 19:55:00,959 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-12-02 19:55:00,959 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 19:55:00,960 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 19:55:00,989 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || (((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) [2023-12-02 19:55:00,990 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i == 1) || ((((0 <= (i + 1)) && (\result == expected)) && (\result <= 2147483647)) && (0 <= (\result + 2147483648)))) && (data == 1)) && (len == 2)) && (i <= 1)) [2023-12-02 19:55:00,991 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((data == 1) && (0 <= index)) && (((index == \old(index)) && (data == \old(data))) || (((index + 1) == \old(index)) && (data == \old(data))))) [2023-12-02 19:55:00,991 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(index) <= 2147483647) && (0 <= \old(index))) || ((((0 <= index) && (\old(index) <= 2147483647)) && (index <= 2147483647)) && (0 <= \old(index)))) [2023-12-02 19:55:01,011 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || (((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) [2023-12-02 19:55:01,013 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i == 1) || ((((0 <= (i + 1)) && (\result == expected)) && (\result <= 2147483647)) && (0 <= (\result + 2147483648)))) && (data == 1)) && (len == 2)) && (i <= 1)) [2023-12-02 19:55:01,014 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((data == 1) && (0 <= index)) && (((index == \old(index)) && (data == \old(data))) || (((index + 1) == \old(index)) && (data == \old(data))))) [2023-12-02 19:55:01,014 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(index) <= 2147483647) && (0 <= \old(index))) || ((((0 <= index) && (\old(index) <= 2147483647)) && (index <= 2147483647)) && (0 <= \old(index)))) [2023-12-02 19:55:01,059 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 19:55:01,059 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 19:55:01,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:55:01,060 INFO L158 Benchmark]: Toolchain (without parser) took 194678.12ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 115.0MB in the beginning and 187.1MB in the end (delta: -72.1MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2023-12-02 19:55:01,060 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:55:01,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.18ms. Allocated memory is still 155.2MB. Free memory was 115.0MB in the beginning and 97.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 19:55:01,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.04ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 95.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 19:55:01,061 INFO L158 Benchmark]: Boogie Preprocessor took 34.17ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 93.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:55:01,061 INFO L158 Benchmark]: RCFGBuilder took 448.29ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 72.6MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 19:55:01,062 INFO L158 Benchmark]: TraceAbstraction took 193624.38ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 71.9MB in the beginning and 193.4MB in the end (delta: -121.5MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. [2023-12-02 19:55:01,062 INFO L158 Benchmark]: Witness Printer took 113.14ms. Allocated memory is still 325.1MB. Free memory was 193.4MB in the beginning and 187.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 19:55:01,064 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.18ms. Allocated memory is still 155.2MB. Free memory was 115.0MB in the beginning and 97.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.04ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 95.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.17ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 93.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 448.29ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 72.6MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 193624.38ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 71.9MB in the beginning and 193.4MB in the end (delta: -121.5MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. * Witness Printer took 113.14ms. Allocated memory is still 325.1MB. Free memory was 193.4MB in the beginning and 187.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_get_data_at_~head#1.offset_46 : int, v_ULTIMATE.start_sll_get_data_at_~head#1.base_46 : int :: #memory_int[v_ULTIMATE.start_sll_get_data_at_~head#1.base_46][v_ULTIMATE.start_sll_get_data_at_~head#1.offset_46] == #res) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_create_~len#1_42 : int :: ((((((((((((!(#memory_$Pointer$.base[~new_head~0!base][4] == 0) && #res!base + 1 <= #StackHeapBarrier) && (exists v_#valid_24 : [int]int :: ((((v_#valid_24[1] == 1 && v_#valid_24[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base := 1] == #valid) && v_#valid_24[#memory_$Pointer$.base[~new_head~0!base][4]] == 0) && v_#valid_24[#memory_$Pointer$.base[~new_head~0!base][4] := 1][#res!base] == 0) && v_#valid_24[0] == 0) && v_#valid_24[2] == 1)) && (exists v_#memory_$Pointer$.offset_75 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: (v_#memory_$Pointer$.offset_75[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_75[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4]][0]]] == v_#memory_$Pointer$.offset_77 && v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.offset_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#memory_$Pointer$.base_75 : [int,int]int, v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := #memory_$Pointer$.base[~new_head~0!base][4]]] && v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0]][#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28) && v_#memory_$Pointer$.base_77 == v_#memory_$Pointer$.base_75[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_$Pointer$.base_75[#memory_$Pointer$.base[~new_head~0!base][4]][4 := 0][0 := v_#memory_$Pointer$.base_77[#memory_$Pointer$.base[~new_head~0!base][4]][0]]])) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && #res!base == ~new_head~0!base) && (exists v_#memory_int_85 : [int,int]int, v_#memory_int_86 : [int,int]int, v_#memory_int_87 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((((v_#memory_int_87[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_87[#memory_$Pointer$.base[~new_head~0!base][4]][0 := 1][4 := v_#memory_int_86[#memory_$Pointer$.base[~new_head~0!base][4]][4]]] == v_#memory_int_86 && v_#memory_int_85[1][1] == 0) && v_#memory_int_87 == v_#memory_int_85[#memory_$Pointer$.base[~new_head~0!base][4] := v_#memory_int_85[#memory_$Pointer$.base[~new_head~0!base][4]][4 := v_#memory_int_87[#memory_$Pointer$.base[~new_head~0!base][4]][4]]]) && 48 == v_#memory_int_85[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]]) && v_#memory_int_86[#res!base := v_#memory_int_86[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36)) && ~len == 0) && (exists v_#length_22 : [int]int :: (v_#length_22[1] == 2 && v_#length_22[2] == 27) && #length == v_#length_22[#memory_$Pointer$.base[~new_head~0!base][4] := 8][#res!base := 8])) && #memory_$Pointer$.base[~new_head~0!base][4] + 1 <= #StackHeapBarrier) && v_ULTIMATE.start_sll_create_~len#1_42 == 1) || ((((((((((#res!base + 1 <= #StackHeapBarrier && (exists v_#memory_$Pointer$.base_75 : [int,int]int, v_#memory_$Pointer$.base_28 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_28[~new_head~0!base := v_#memory_$Pointer$.base_28[~new_head~0!base][4 := 0]] && v_#memory_$Pointer$.base_75[#res!base := v_#memory_$Pointer$.base_75[#res!base][4 := 0][0 := v_#memory_$Pointer$.base_28[#res!base][0]]] == v_#memory_$Pointer$.base_28)) && 2 == v_ULTIMATE.start_sll_create_~len#1_42) && (exists v_#memory_$Pointer$.offset_75 : [int,int]int, v_#memory_$Pointer$.offset_28 : [int,int]int :: v_#memory_$Pointer$.offset_75[#res!base := v_#memory_$Pointer$.offset_75[#res!base][4 := 0][0 := v_#memory_$Pointer$.offset_28[#res!base][0]]] == v_#memory_$Pointer$.offset_28 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_28[~new_head~0!base := v_#memory_$Pointer$.offset_28[~new_head~0!base][4 := 0]])) && (exists v_#length_22 : [int]int :: (#length == v_#length_22[#res!base := 8] && v_#length_22[1] == 2) && v_#length_22[2] == 27)) && !(#res!base == 0)) && ~head~0!base == ~new_head~0!base) && ~len == 1) && #res!base == ~new_head~0!base) && (exists v_#memory_int_85 : [int,int]int, v_#memory_int_36 : [int,int]int :: ((v_#memory_int_85[1][1] == 0 && v_#memory_int_85[#res!base := v_#memory_int_85[#res!base][4 := v_#memory_int_36[#res!base][4]]] == v_#memory_int_36) && 48 == v_#memory_int_85[1][0]) && #memory_int == v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base := v_#memory_int_36[#res!base := v_#memory_int_36[#res!base][0 := 1]][~new_head~0!base][4 := #memory_int[~new_head~0!base][4]]])) && (exists v_#valid_24 : [int]int :: (((v_#valid_24[1] == 1 && v_#valid_24[#res!base := 1] == #valid) && v_#valid_24[0] == 0) && v_#valid_24[#res!base] == 0) && v_#valid_24[2] == 1))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 * 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: 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 1 procedures, 48 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 193.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 52.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 30.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 1022 SdHoareTripleChecker+Invalid, 29.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 704 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1872 IncrementalHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 318 mSDtfsCounter, 1872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 739 GetRequests, 506 SyntacticMatches, 45 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 76.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=15, InterpolantAutomatonStates: 142, 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, 17 MinimizatonAttempts, 108 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 21 NumberOfFragments, 977 HoareAnnotationTreeSize, 6 FomulaSimplifications, 24091 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 6 FomulaSimplificationsInter, 9394 FormulaSimplificationTreeSizeReductionInter, 52.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 1454 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1973 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 198/227 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: 25.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 138, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 415, TOOLS_POST_TIME: 7.1s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 415, TOOLS_QUANTIFIERELIM_TIME: 6.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 704, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 45, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 26, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 59, DOMAIN_ISSUBSETEQ_TIME: 17.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 138, DOMAIN_ISBOTTOM_TIME: 0.8s, LOOP_SUMMARIZER_APPLICATIONS: 33, LOOP_SUMMARIZER_CACHE_MISSES: 33, LOOP_SUMMARIZER_OVERALL_TIME: 22.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 22.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 59, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, 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: 2554, DAG_COMPRESSION_RETAINED_NODES: 444, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((i == 1) || ((((0 <= (i + 1)) && (\result == expected)) && (\result <= 2147483647)) && (0 <= (\result + 2147483648)))) && (data == 1)) && (len == 2)) && (i <= 1)) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || (((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((data == 1) && (len == 2)) && (i <= 1)) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((\old(index) <= 2147483647) && (0 <= \old(index))) || ((((0 <= index) && (\old(index) <= 2147483647)) && (index <= 2147483647)) && (0 <= \old(index)))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((data == 1) && (0 <= index)) && (((index == \old(index)) && (data == \old(data))) || (((index + 1) == \old(index)) && (data == \old(data))))) RESULT: Ultimate proved your program to be correct! [2023-12-02 19:55:01,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee95e67b-9cb0-44bf-bee6-62889bbc62f8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE