./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/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_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:18:05,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:18:05,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:18:05,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:18:05,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:18:05,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:18:05,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:18:05,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:18:05,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:18:05,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:18:05,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:18:05,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:18:05,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:18:05,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:18:05,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:18:05,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:18:05,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:18:05,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:18:06,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:18:06,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:18:06,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:18:06,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:18:06,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:18:06,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:18:06,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:18:06,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:18:06,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:18:06,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:18:06,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:18:06,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:18:06,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:18:06,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:18:06,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:18:06,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:18:06,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:18:06,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:18:06,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:18:06,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:18:06,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:18:06,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:18:06,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:18:06,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 02:18:06,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:18:06,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:18:06,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:18:06,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:18:06,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:18:06,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:18:06,079 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:18:06,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:18:06,079 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:18:06,079 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:18:06,080 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:18:06,081 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:18:06,081 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:18:06,081 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:18:06,081 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:18:06,081 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:18:06,082 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:18:06,082 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:18:06,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:18:06,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:18:06,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:18:06,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:18:06,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:18:06,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:18:06,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:18:06,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:18:06,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:18:06,085 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:18:06,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:18:06,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:18:06,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:18:06,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:18:06,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:18:06,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:18:06,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:18:06,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:18:06,087 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:18:06,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:18:06,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:18:06,088 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:18:06,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:18:06,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:18:06,088 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:18:06,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-22 02:18:06,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:18:06,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:18:06,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:18:06,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:18:06,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:18:06,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-22 02:18:09,463 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:18:09,724 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:18:09,725 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-22 02:18:09,737 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/data/64c361d69/a0985d0bf65441d88352654875351ba8/FLAG86ec45139 [2022-11-22 02:18:09,752 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/data/64c361d69/a0985d0bf65441d88352654875351ba8 [2022-11-22 02:18:09,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:18:09,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:18:09,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:18:09,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:18:09,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:18:09,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:18:09" (1/1) ... [2022-11-22 02:18:09,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304e5f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:09, skipping insertion in model container [2022-11-22 02:18:09,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:18:09" (1/1) ... [2022-11-22 02:18:09,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:18:09,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:18:10,149 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-22 02:18:10,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:18:10,165 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:18:10,239 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-22 02:18:10,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:18:10,276 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:18:10,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10 WrapperNode [2022-11-22 02:18:10,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:18:10,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:18:10,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:18:10,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:18:10,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,355 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2022-11-22 02:18:10,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:18:10,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:18:10,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:18:10,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:18:10,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,381 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:18:10,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:18:10,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:18:10,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:18:10,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (1/1) ... [2022-11-22 02:18:10,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:18:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:10,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:18:10,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:18:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:18:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:18:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:18:10,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:18:10,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:18:10,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:18:10,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:18:10,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:18:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:18:10,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:18:10,622 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:18:10,629 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:18:10,920 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:18:11,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:18:11,026 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 02:18:11,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:11 BoogieIcfgContainer [2022-11-22 02:18:11,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:18:11,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:18:11,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:18:11,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:18:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:18:09" (1/3) ... [2022-11-22 02:18:11,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7046dd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:18:11, skipping insertion in model container [2022-11-22 02:18:11,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:10" (2/3) ... [2022-11-22 02:18:11,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7046dd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:18:11, skipping insertion in model container [2022-11-22 02:18:11,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:11" (3/3) ... [2022-11-22 02:18:11,038 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-22 02:18:11,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:18:11,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-22 02:18:11,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:18:11,114 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fd87209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:18:11,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-22 02:18:11,119 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) [2022-11-22 02:18:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 02:18:11,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:11,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 02:18:11,127 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)] === [2022-11-22 02:18:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash 181817, now seen corresponding path program 1 times [2022-11-22 02:18:11,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:11,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789949070] [2022-11-22 02:18:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:11,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:18:11,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:11,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789949070] [2022-11-22 02:18:11,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789949070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:11,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:11,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:18:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557486920] [2022-11-22 02:18:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:11,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:18:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:11,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:18:11,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:18:11,389 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, 3 states have (on average 1.0) 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) [2022-11-22 02:18:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:11,475 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-11-22 02:18:11,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:18:11,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) 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 [2022-11-22 02:18:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:11,485 INFO L225 Difference]: With dead ends: 95 [2022-11-22 02:18:11,486 INFO L226 Difference]: Without dead ends: 50 [2022-11-22 02:18:11,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:18:11,492 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:11,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-22 02:18:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-22 02:18:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.8148148148148149) 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) [2022-11-22 02:18:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-22 02:18:11,529 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 3 [2022-11-22 02:18:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:11,529 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-22 02:18:11,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) 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) [2022-11-22 02:18:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-22 02:18:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 02:18:11,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:11,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 02:18:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:18:11,531 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)] === [2022-11-22 02:18:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash 5496013, now seen corresponding path program 1 times [2022-11-22 02:18:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:11,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431777384] [2022-11-22 02:18:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:18:11,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:11,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431777384] [2022-11-22 02:18:11,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431777384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:11,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:11,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:18:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907320783] [2022-11-22 02:18:11,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:18:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:11,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:18:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:18:11,715 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2022-11-22 02:18:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:11,772 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-22 02:18:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:18:11,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 [2022-11-22 02:18:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:11,775 INFO L225 Difference]: With dead ends: 45 [2022-11-22 02:18:11,775 INFO L226 Difference]: Without dead ends: 44 [2022-11-22 02:18:11,778 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 [2022-11-22 02:18:11,780 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 72 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 [2022-11-22 02:18:11,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 72 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:18:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-22 02:18:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-22 02:18:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.7777777777777777) 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) [2022-11-22 02:18:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-22 02:18:11,787 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 4 [2022-11-22 02:18:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:11,787 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-22 02:18:11,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2022-11-22 02:18:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-22 02:18:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:18:11,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:11,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:18:11,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:18:11,789 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)] === [2022-11-22 02:18:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash 170376459, now seen corresponding path program 1 times [2022-11-22 02:18:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79627886] [2022-11-22 02:18:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:11,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:18:11,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:11,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79627886] [2022-11-22 02:18:11,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79627886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:11,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:11,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:18:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298029951] [2022-11-22 02:18:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:11,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:18:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:18:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:18:11,912 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2022-11-22 02:18:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:11,963 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-22 02:18:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:18:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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 [2022-11-22 02:18:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:11,967 INFO L225 Difference]: With dead ends: 44 [2022-11-22 02:18:11,968 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 02:18:11,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:18:11,970 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:11,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:18:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 02:18:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-22 02:18:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.7407407407407407) 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) [2022-11-22 02:18:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-22 02:18:11,990 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2022-11-22 02:18:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:11,990 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-22 02:18:11,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2022-11-22 02:18:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-22 02:18:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 02:18:11,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:11,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:18:11,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash 523025805, now seen corresponding path program 1 times [2022-11-22 02:18:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:11,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244963738] [2022-11-22 02:18:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:12,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244963738] [2022-11-22 02:18:12,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244963738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:12,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:12,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:18:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559634069] [2022-11-22 02:18:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:18:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:18:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:18:12,076 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:12,112 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-22 02:18:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:18:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 02:18:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:12,114 INFO L225 Difference]: With dead ends: 43 [2022-11-22 02:18:12,114 INFO L226 Difference]: Without dead ends: 41 [2022-11-22 02:18:12,114 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 [2022-11-22 02:18:12,116 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:12,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:18:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-22 02:18:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-22 02:18:12,121 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) [2022-11-22 02:18:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-22 02:18:12,122 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-11-22 02:18:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:12,123 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-22 02:18:12,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-22 02:18:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 02:18:12,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:12,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:12,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:18:12,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash -966069163, now seen corresponding path program 1 times [2022-11-22 02:18:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:12,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836778958] [2022-11-22 02:18:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:12,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836778958] [2022-11-22 02:18:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836778958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:12,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:12,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:18:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005625553] [2022-11-22 02:18:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:12,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:18:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:18:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:18:12,201 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) [2022-11-22 02:18:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:12,256 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-22 02:18:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:18:12,261 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 [2022-11-22 02:18:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:12,263 INFO L225 Difference]: With dead ends: 41 [2022-11-22 02:18:12,263 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 02:18:12,263 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 [2022-11-22 02:18:12,267 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 [2022-11-22 02:18:12,271 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] [2022-11-22 02:18:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 02:18:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 02:18:12,280 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) [2022-11-22 02:18:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-22 02:18:12,282 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 8 [2022-11-22 02:18:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:12,283 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-22 02:18:12,283 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) [2022-11-22 02:18:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-22 02:18:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:18:12,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:12,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:12,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:18:12,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash -679527337, now seen corresponding path program 1 times [2022-11-22 02:18:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:12,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622788031] [2022-11-22 02:18:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:12,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622788031] [2022-11-22 02:18:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622788031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:12,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:12,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:18:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711408836] [2022-11-22 02:18:12,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:12,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:18:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:12,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:18:12,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:18:12,408 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) [2022-11-22 02:18:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:12,502 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-11-22 02:18:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:18:12,503 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 [2022-11-22 02:18:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:12,507 INFO L225 Difference]: With dead ends: 66 [2022-11-22 02:18:12,507 INFO L226 Difference]: Without dead ends: 64 [2022-11-22 02:18:12,508 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 [2022-11-22 02:18:12,510 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:12,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 40 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-22 02:18:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2022-11-22 02:18:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.5483870967741935) 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) [2022-11-22 02:18:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-22 02:18:12,556 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2022-11-22 02:18:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:12,556 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-22 02:18:12,556 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) [2022-11-22 02:18:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-22 02:18:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:18:12,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:12,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:18:12,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 409489111, now seen corresponding path program 1 times [2022-11-22 02:18:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:12,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209452241] [2022-11-22 02:18:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:12,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:12,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209452241] [2022-11-22 02:18:12,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209452241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:12,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:12,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:18:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992797236] [2022-11-22 02:18:12,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:12,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:18:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:18:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:18:12,642 INFO L87 Difference]: Start difference. First operand 43 states and 48 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) [2022-11-22 02:18:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:12,691 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-11-22 02:18:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:18:12,692 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 [2022-11-22 02:18:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:12,692 INFO L225 Difference]: With dead ends: 45 [2022-11-22 02:18:12,693 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 02:18:12,693 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 [2022-11-22 02:18:12,696 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 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 [2022-11-22 02:18:12,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:18:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 02:18:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-11-22 02:18:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 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) [2022-11-22 02:18:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-11-22 02:18:12,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2022-11-22 02:18:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:12,718 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-11-22 02:18:12,718 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) [2022-11-22 02:18:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-11-22 02:18:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:18:12,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:12,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:12,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:18:12,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:12,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1617949353, now seen corresponding path program 1 times [2022-11-22 02:18:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886955507] [2022-11-22 02:18:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:12,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:12,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886955507] [2022-11-22 02:18:12,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886955507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:12,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:12,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:18:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216272715] [2022-11-22 02:18:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:18:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:18:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:18:12,841 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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) [2022-11-22 02:18:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:12,919 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-11-22 02:18:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:18:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 [2022-11-22 02:18:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:12,921 INFO L225 Difference]: With dead ends: 50 [2022-11-22 02:18:12,921 INFO L226 Difference]: Without dead ends: 49 [2022-11-22 02:18:12,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:18:12,927 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:12,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 76 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:18:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-22 02:18:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-11-22 02:18:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 42 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) [2022-11-22 02:18:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-22 02:18:12,940 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 13 [2022-11-22 02:18:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:12,940 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-22 02:18:12,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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) [2022-11-22 02:18:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-22 02:18:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:18:12,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:12,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:18:12,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1617952775, now seen corresponding path program 1 times [2022-11-22 02:18:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053103296] [2022-11-22 02:18:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:18:13,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:13,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053103296] [2022-11-22 02:18:13,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053103296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570972557] [2022-11-22 02:18:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:13,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:13,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:13,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:13,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:18:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:13,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:13,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:18:13,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:18:13,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570972557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:13,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933592059] [2022-11-22 02:18:13,284 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-22 02:18:13,284 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:13,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:13,293 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:13,294 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:13,418 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 02:18:13,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 02:18:13,486 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:13,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:13,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:13,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:13,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:13,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:13,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:13,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:13,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:13,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:13,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:13,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:13,835 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:13,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:13,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 02:18:13,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:13,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:13,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:13,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:14,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:14,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:14,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:14,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:14,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:14,592 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-22 02:18:14,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:18:14,703 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-22 02:18:14,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-22 02:18:15,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,315 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-22 02:18:15,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-22 02:18:15,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,400 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-22 02:18:15,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-22 02:18:15,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,453 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-22 02:18:15,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-22 02:18:15,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,565 INFO L321 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2022-11-22 02:18:15,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 442 treesize of output 398 [2022-11-22 02:18:15,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:15,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,628 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-22 02:18:15,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-22 02:18:15,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:15,686 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-22 02:18:15,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-22 02:18:16,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:18:16,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:18:16,235 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:18,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1933592059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:18,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:18,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 12 [2022-11-22 02:18:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396328271] [2022-11-22 02:18:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:18,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:18:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:18:18,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:18:18,367 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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) [2022-11-22 02:18:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:18,604 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-11-22 02:18:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:18:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 [2022-11-22 02:18:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:18,605 INFO L225 Difference]: With dead ends: 100 [2022-11-22 02:18:18,605 INFO L226 Difference]: Without dead ends: 67 [2022-11-22 02:18:18,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:18:18,606 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 127 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:18,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 69 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:18:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-22 02:18:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-11-22 02:18:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-22 02:18:18,629 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 13 [2022-11-22 02:18:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:18,629 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-22 02:18:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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) [2022-11-22 02:18:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-22 02:18:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:18:18,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:18,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:18,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:18,839 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)] === [2022-11-22 02:18:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1986936642, now seen corresponding path program 1 times [2022-11-22 02:18:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:18,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701981135] [2022-11-22 02:18:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:18,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:18,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701981135] [2022-11-22 02:18:18,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701981135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:18,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977691665] [2022-11-22 02:18:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:18,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:18,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:18:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:19,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:19,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:19,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:18:19,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977691665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:19,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1408603788] [2022-11-22 02:18:19,070 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 02:18:19,071 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:19,071 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:19,071 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:19,071 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:19,123 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:19,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:19,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:18:19,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:19,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:19,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:19,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:19,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:19,327 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-22 02:18:19,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-22 02:18:19,393 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:19,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:19,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:19,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:19,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:19,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:19,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:19,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:19,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:19,917 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-22 02:18:19,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-22 02:18:19,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 02:18:20,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:20,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:20,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:20,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-22 02:18:20,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:20,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:20,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:20,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:20,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:20,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:20,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:20,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:20,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:18:20,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:18:20,597 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1408603788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:22,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:22,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2022-11-22 02:18:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390807374] [2022-11-22 02:18:22,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:22,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:18:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:18:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-22 02:18:22,572 INFO L87 Difference]: Start difference. First operand 47 states and 52 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) [2022-11-22 02:18:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:23,357 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-11-22 02:18:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:18:23,358 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 [2022-11-22 02:18:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:23,358 INFO L225 Difference]: With dead ends: 67 [2022-11-22 02:18:23,358 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 02:18:23,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:18:23,359 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 82 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:23,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 85 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:18:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 02:18:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2022-11-22 02:18:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.4) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-22 02:18:23,369 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 16 [2022-11-22 02:18:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:23,370 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-22 02:18:23,370 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) [2022-11-22 02:18:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-22 02:18:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:18:23,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:23,371 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:23,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 02:18:23,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:18:23,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash -409670297, now seen corresponding path program 1 times [2022-11-22 02:18:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:23,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069224631] [2022-11-22 02:18:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:18:23,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069224631] [2022-11-22 02:18:23,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069224631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69624182] [2022-11-22 02:18:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:23,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:23,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:23,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:18:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:23,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:23,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:18:23,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:18:23,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69624182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:23,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42168017] [2022-11-22 02:18:23,844 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 02:18:23,844 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:23,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:23,845 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:23,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:23,897 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:23,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:23,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:18:23,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:23,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:23,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:23,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:23,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:23,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:23,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:23,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:23,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:23,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:24,058 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-22 02:18:24,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-22 02:18:24,127 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:24,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:24,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:24,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:24,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:24,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:24,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-22 02:18:24,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:24,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-22 02:18:24,638 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-22 02:18:24,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-22 02:18:24,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 02:18:24,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:24,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-22 02:18:24,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:24,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:24,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:24,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:24,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:25,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:25,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:25,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:25,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:25,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:25,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:25,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:25,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:25,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:25,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:18:25,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:18:25,572 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:27,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [42168017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:27,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:27,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 14 [2022-11-22 02:18:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550954370] [2022-11-22 02:18:27,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:27,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:18:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:18:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:18:27,515 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 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) [2022-11-22 02:18:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:28,564 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-11-22 02:18:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:18:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 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 19 [2022-11-22 02:18:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:28,565 INFO L225 Difference]: With dead ends: 61 [2022-11-22 02:18:28,565 INFO L226 Difference]: Without dead ends: 56 [2022-11-22 02:18:28,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-22 02:18:28,567 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:28,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 42 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:18:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-22 02:18:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2022-11-22 02:18:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) 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) [2022-11-22 02:18:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-22 02:18:28,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 19 [2022-11-22 02:18:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:28,577 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-22 02:18:28,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 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) [2022-11-22 02:18:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-22 02:18:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:18:28,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:28,578 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] [2022-11-22 02:18:28,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 02:18:28,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 02:18:28,783 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)] === [2022-11-22 02:18:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 791559902, now seen corresponding path program 1 times [2022-11-22 02:18:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164121460] [2022-11-22 02:18:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:18:28,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164121460] [2022-11-22 02:18:28,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164121460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418893812] [2022-11-22 02:18:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:28,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:28,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:28,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:28,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:18:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:28,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:28,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:18:29,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:18:29,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418893812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1837495242] [2022-11-22 02:18:29,045 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-22 02:18:29,045 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:29,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:29,046 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:29,046 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:29,086 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 02:18:29,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 02:18:29,123 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:29,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:29,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:29,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:29,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:29,271 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-22 02:18:29,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-22 02:18:29,332 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:29,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:29,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:29,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:29,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:29,730 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-22 02:18:29,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:18:29,819 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-22 02:18:29,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-22 02:18:29,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-22 02:18:29,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:29,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:29,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:29,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:30,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:30,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:30,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:30,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:30,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:30,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:30,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:30,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:30,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:30,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:18:30,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:18:30,778 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:33,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1837495242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:33,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:33,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 18 [2022-11-22 02:18:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124195955] [2022-11-22 02:18:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:33,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 02:18:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:33,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 02:18:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:18:33,374 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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) [2022-11-22 02:18:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:35,683 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-11-22 02:18:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:18:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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 [2022-11-22 02:18:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:35,684 INFO L225 Difference]: With dead ends: 76 [2022-11-22 02:18:35,684 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 02:18:35,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2022-11-22 02:18:35,685 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 133 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:35,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 48 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:18:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 02:18:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2022-11-22 02:18:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-22 02:18:35,696 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 25 [2022-11-22 02:18:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:35,696 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-22 02:18:35,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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) [2022-11-22 02:18:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-22 02:18:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:18:35,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:35,697 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-22 02:18:35,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 02:18:35,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 219437840, now seen corresponding path program 1 times [2022-11-22 02:18:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:35,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461561912] [2022-11-22 02:18:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 02:18:36,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:36,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461561912] [2022-11-22 02:18:36,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461561912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:36,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146770488] [2022-11-22 02:18:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:36,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:36,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:18:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:36,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:36,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 02:18:36,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 02:18:36,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146770488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882937465] [2022-11-22 02:18:36,194 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:18:36,194 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:36,195 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:36,195 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:36,195 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:36,249 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:36,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:36,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:18:36,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:36,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:36,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:36,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:36,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:36,423 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:36,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:36,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 02:18:36,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:36,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:36,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:36,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:36,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:36,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:36,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:36,878 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-22 02:18:36,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-22 02:18:36,934 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-22 02:18:36,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:18:37,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:37,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,364 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-22 02:18:37,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-22 02:18:37,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,432 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-22 02:18:37,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-22 02:18:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:37,467 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-22 02:18:37,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-22 02:18:37,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:37,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:37,525 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-22 02:18:37,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-22 02:18:37,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:37,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,579 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-22 02:18:37,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-22 02:18:37,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:37,629 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-22 02:18:37,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-22 02:18:38,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:38,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:38,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:38,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:38,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:38,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:38,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:38,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:38,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:38,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:18:38,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:18:38,492 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:41,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1882937465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:41,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:41,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 18 [2022-11-22 02:18:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651580656] [2022-11-22 02:18:41,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:41,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 02:18:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:41,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 02:18:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:18:41,088 INFO L87 Difference]: Start difference. First operand 46 states and 51 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) [2022-11-22 02:18:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:43,329 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-22 02:18:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:18:43,330 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 34 [2022-11-22 02:18:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:43,331 INFO L225 Difference]: With dead ends: 58 [2022-11-22 02:18:43,331 INFO L226 Difference]: Without dead ends: 56 [2022-11-22 02:18:43,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2022-11-22 02:18:43,332 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 98 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:43,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 41 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:18:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-22 02:18:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2022-11-22 02:18:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 46 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) [2022-11-22 02:18:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-22 02:18:43,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 34 [2022-11-22 02:18:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:43,345 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-22 02:18:43,345 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) [2022-11-22 02:18:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-22 02:18:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:18:43,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:43,346 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] [2022-11-22 02:18:43,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 02:18:43,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 02:18:43,553 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1787300487, now seen corresponding path program 1 times [2022-11-22 02:18:43,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:43,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644051976] [2022-11-22 02:18:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 02:18:43,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:43,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644051976] [2022-11-22 02:18:43,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644051976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:43,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175946967] [2022-11-22 02:18:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:43,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:43,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:43,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:18:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:43,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:43,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 02:18:43,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 02:18:43,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175946967] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:43,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1003404860] [2022-11-22 02:18:43,836 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:18:43,837 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:43,837 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:43,837 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:43,837 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:43,879 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 02:18:43,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 02:18:43,920 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:43,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:43,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:43,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:43,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:43,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:43,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-22 02:18:43,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:43,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-22 02:18:44,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:44,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:44,096 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:44,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:44,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 02:18:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:44,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:44,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:44,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:44,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:44,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:44,537 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-22 02:18:44,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-22 02:18:44,586 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-22 02:18:44,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:18:44,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:44,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:44,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:44,991 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-22 02:18:44,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-22 02:18:45,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,053 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-22 02:18:45,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-22 02:18:45,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:45,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,096 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-22 02:18:45,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-22 02:18:45,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:45,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:45,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,154 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-22 02:18:45,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-22 02:18:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:45,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,206 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-22 02:18:45,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-22 02:18:45,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:45,249 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-22 02:18:45,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-22 02:18:45,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:45,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:45,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:45,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:45,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:45,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:46,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:46,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:46,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:46,341 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-22 02:18:46,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-22 02:18:46,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 02:18:46,416 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:49,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1003404860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:49,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:49,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 20 [2022-11-22 02:18:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25783351] [2022-11-22 02:18:49,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:49,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 02:18:49,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:49,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 02:18:49,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-22 02:18:49,728 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:52,915 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-11-22 02:18:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 02:18:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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 [2022-11-22 02:18:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:52,916 INFO L225 Difference]: With dead ends: 74 [2022-11-22 02:18:52,916 INFO L226 Difference]: Without dead ends: 71 [2022-11-22 02:18:52,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2022-11-22 02:18:52,918 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 234 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:52,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 52 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:18:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-22 02:18:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-11-22 02:18:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 51 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) [2022-11-22 02:18:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-11-22 02:18:52,932 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 35 [2022-11-22 02:18:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:52,933 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-11-22 02:18:52,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:18:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-11-22 02:18:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:18:52,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:52,934 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, 1] [2022-11-22 02:18:52,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-22 02:18:53,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:53,140 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:18:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1042935429, now seen corresponding path program 1 times [2022-11-22 02:18:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:53,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355937527] [2022-11-22 02:18:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:53,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:18:53,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:53,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355937527] [2022-11-22 02:18:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355937527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690061495] [2022-11-22 02:18:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:53,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:53,329 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:53,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:18:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:53,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:53,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:18:53,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:18:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690061495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1772158654] [2022-11-22 02:18:53,513 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 02:18:53,513 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:18:53,514 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:18:53,514 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:18:53,514 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:18:53,569 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:18:53,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:18:53,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:18:53,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:53,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:53,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:53,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:18:53,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:53,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:18:53,725 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-22 02:18:53,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-22 02:18:53,785 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:18:53,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:18:53,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:53,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:18:53,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:53,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:53,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:53,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:54,130 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-22 02:18:54,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:18:54,234 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-22 02:18:54,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-22 02:18:54,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:54,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-22 02:18:54,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:54,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:18:54,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:18:54,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:18:54,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:54,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:54,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:54,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:54,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:54,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:55,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:55,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:55,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:18:55,937 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-22 02:18:55,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:18:56,024 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-22 02:18:56,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-22 02:18:56,300 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:18:59,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1772158654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:59,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:59,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 20 [2022-11-22 02:18:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036362230] [2022-11-22 02:18:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:59,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 02:18:59,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 02:18:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-22 02:18:59,632 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 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) [2022-11-22 02:19:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:02,993 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-22 02:19:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 02:19:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 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 41 [2022-11-22 02:19:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:02,995 INFO L225 Difference]: With dead ends: 52 [2022-11-22 02:19:02,995 INFO L226 Difference]: Without dead ends: 48 [2022-11-22 02:19:02,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 95 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:19:02,996 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:02,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:19:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-22 02:19:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-11-22 02:19:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) 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) [2022-11-22 02:19:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-22 02:19:03,011 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2022-11-22 02:19:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:03,012 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-22 02:19:03,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 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) [2022-11-22 02:19:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-22 02:19:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:19:03,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:03,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:03,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:19:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:03,219 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)] === [2022-11-22 02:19:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1531674134, now seen corresponding path program 1 times [2022-11-22 02:19:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:03,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276433929] [2022-11-22 02:19:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-22 02:19:03,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:03,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276433929] [2022-11-22 02:19:03,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276433929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:03,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219268401] [2022-11-22 02:19:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:03,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:03,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:19:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:03,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:19:03,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:19:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-22 02:19:03,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:19:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-22 02:19:03,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219268401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:19:03,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1423090934] [2022-11-22 02:19:03,528 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 02:19:03,528 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:19:03,528 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:19:03,528 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:19:03,529 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:19:03,576 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 02:19:03,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-22 02:19:03,616 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 02:19:03,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-22 02:19:03,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:03,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-22 02:19:03,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-22 02:19:03,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:03,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-22 02:19:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:03,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-22 02:19:03,765 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-22 02:19:03,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-22 02:19:03,831 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 02:19:03,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-22 02:19:03,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:03,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-22 02:19:03,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:03,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-22 02:19:03,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:03,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:03,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-22 02:19:04,175 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-22 02:19:04,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:19:04,263 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-22 02:19:04,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-22 02:19:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,635 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-22 02:19:04,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 387 treesize of output 325 [2022-11-22 02:19:04,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,699 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-22 02:19:04,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 389 treesize of output 328 [2022-11-22 02:19:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,739 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-22 02:19:04,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 398 treesize of output 379 [2022-11-22 02:19:04,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,808 INFO L321 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2022-11-22 02:19:04,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 414 treesize of output 386 [2022-11-22 02:19:04,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:04,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,864 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-22 02:19:04,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 388 [2022-11-22 02:19:04,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:19:04,916 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-22 02:19:04,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 401 treesize of output 391 [2022-11-22 02:19:05,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:19:05,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:19:05,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:19:05,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:19:05,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:19:05,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:19:06,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:19:06,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:19:06,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:19:06,607 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-22 02:19:06,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-22 02:19:06,658 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-22 02:19:06,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-22 02:19:06,952 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:19:10,354 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3599#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 3) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (< (+ 2147483647 |ULTIMATE.start_main_#t~post14#1|) 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:19:10,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:19:10,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:19:10,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-22 02:19:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249797010] [2022-11-22 02:19:10,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:19:10,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:19:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:19:10,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-11-22 02:19:10,357 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:19:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:10,429 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-11-22 02:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:19:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 43 [2022-11-22 02:19:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:10,431 INFO L225 Difference]: With dead ends: 90 [2022-11-22 02:19:10,431 INFO L226 Difference]: Without dead ends: 50 [2022-11-22 02:19:10,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-11-22 02:19:10,432 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:10,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:19:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-22 02:19:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-22 02:19:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:19:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-22 02:19:10,444 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 43 [2022-11-22 02:19:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:10,444 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-22 02:19:10,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:19:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-22 02:19:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 02:19:10,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:10,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:10,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:19:10,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 02:19:10,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-22 02:19:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1424594238, now seen corresponding path program 2 times [2022-11-22 02:19:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:10,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641544061] [2022-11-22 02:19:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-22 02:19:10,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:10,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641544061] [2022-11-22 02:19:10,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641544061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:10,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:10,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:19:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543669520] [2022-11-22 02:19:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:10,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:19:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:19:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:19:10,790 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:19:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:10,870 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-11-22 02:19:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:19:10,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 47 [2022-11-22 02:19:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:10,871 INFO L225 Difference]: With dead ends: 58 [2022-11-22 02:19:10,871 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:19:10,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:19:10,872 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:10,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:19:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:19:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:19:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:19:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:19:10,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-11-22 02:19:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:10,874 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:19:10,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:19:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:19:10,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:19:10,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-11-22 02:19:10,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-11-22 02:19:10,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-11-22 02:19:10,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-11-22 02:19:10,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-11-22 02:19:10,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-11-22 02:19:10,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-11-22 02:19:10,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-11-22 02:19:10,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-11-22 02:19:10,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-11-22 02:19:10,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-11-22 02:19:10,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-11-22 02:19:10,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-11-22 02:19:10,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-11-22 02:19:10,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-11-22 02:19:10,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-11-22 02:19:10,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-11-22 02:19:10,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-11-22 02:19:10,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 02:19:10,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:19:14,991 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,992 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-22 02:19:14,992 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-22 02:19:14,992 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,992 INFO L899 garLoopResultBuilder]: For program point L622-4(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,992 INFO L899 garLoopResultBuilder]: For program point L622-5(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-22 02:19:14,993 INFO L895 garLoopResultBuilder]: At program point L622-6(lines 622 627) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_node_create_~data#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 02:19:14,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-22 02:19:14,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:19:14,993 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-22 02:19:14,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,994 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2022-11-22 02:19:14,994 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2022-11-22 02:19:14,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-22 02:19:14,994 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_sll_update_at_~index#1| 1)) (<= 1 |ULTIMATE.start_node_create_~data#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 2 |ULTIMATE.start_sll_update_at_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_update_at_~data#1| 3) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_update_at_#in~data#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 02:19:14,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,995 INFO L895 garLoopResultBuilder]: At program point L624(lines 624 626) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_node_create_~data#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret15#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_#t~ret15#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (let ((.cse0 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse1 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (let ((.cse3 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) (.cse2 (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (and .cse0 .cse1 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse2)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| .cse3) (< 0 .cse3) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse2) |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse4 .cse5)) (and (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|)))) (<= |ULTIMATE.start_main_#t~ret15#1| 2147483647) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (< 0 |ULTIMATE.start_sll_get_data_at_~index#1|)) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 02:19:14,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,996 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and (<= 1 |ULTIMATE.start_node_create_~data#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= 2 .cse0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (let ((.cse1 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= .cse0 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse8 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (let ((.cse4 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) (.cse3 (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (and .cse1 .cse2 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse3)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| .cse4) (< 0 .cse4) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse3) |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse5 .cse6 .cse7 .cse8)) (and (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse1 .cse2 .cse5 .cse6 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse7 .cse8 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|)))) (= |#NULL.base| 0))) [2022-11-22 02:19:14,996 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,996 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-22 02:19:14,996 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (and (let ((.cse0 (<= 1 |ULTIMATE.start_node_create_~data#1|))) (or (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 1)) (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~len#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_node_create_~data#1| 1) (let ((.cse13 (select |#memory_int| 1))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= (select |#valid| 1) 1)) (.cse5 (= (select |#valid| 0) 0)) (.cse6 (= (select |#valid| 2) 1)) (.cse7 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse8 (= (select .cse13 0) 48)) (.cse9 (= 27 (select |#length| 2))) (.cse10 (= (select .cse13 1) 0)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse1 .cse2 (= |ULTIMATE.start_sll_create_~len#1| |ULTIMATE.start_sll_create_#in~len#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (and .cse1 .cse2 (= |ULTIMATE.start_sll_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0)) .cse3 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) .cse10 (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|) .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12) 0)))))) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 02:19:14,997 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-22 02:19:14,997 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-22 02:19:14,997 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-22 02:19:14,997 INFO L899 garLoopResultBuilder]: For program point L618-1(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,997 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2022-11-22 02:19:14,997 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2022-11-22 02:19:14,998 INFO L899 garLoopResultBuilder]: For program point L618-5(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,998 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse4 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse6 (let ((.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |#NULL.offset| 0)) (.cse13 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse10 .cse11 .cse12 .cse13) (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse10 .cse11 .cse12 .cse13)))) (.cse7 (<= 0 |#StackHeapBarrier|)) (.cse8 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse9 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9) (and (<= 1 |ULTIMATE.start_node_create_~data#1|) .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_node_create_#in~data#1| 1) .cse4 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) .cse5 (<= 0 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse6 (<= |ULTIMATE.start_node_create_~data#1| 1) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_create_~len#1| 2)))) [2022-11-22 02:19:14,998 INFO L899 garLoopResultBuilder]: For program point L618-6(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,998 INFO L895 garLoopResultBuilder]: At program point L618-7(lines 618 621) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_node_create_~data#1|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 02:19:14,998 INFO L899 garLoopResultBuilder]: For program point L618-8(lines 618 621) no Hoare annotation was computed. [2022-11-22 02:19:14,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-22 02:19:14,998 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-22 02:19:14,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-22 02:19:15,002 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:15,005 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:19:15,037 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,071 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:19:15 BoogieIcfgContainer [2022-11-22 02:19:15,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:19:15,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:19:15,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:19:15,077 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:19:15,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:11" (3/4) ... [2022-11-22 02:19:15,089 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:19:15,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-22 02:19:15,101 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-22 02:19:15,102 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 02:19:15,102 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:19:15,133 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && len == len) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) || (((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && temp <= 0) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) [2022-11-22 02:19:15,134 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((1 <= data && 0 <= new_head) && new_head <= 0) && len <= 1) || ((1 <= data && 0 <= head) && head <= 0)) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= \old(data)) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && data == \old(data)) && data <= 1) && ((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 [2022-11-22 02:19:15,135 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((1 <= data && s == \result) && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && i <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-22 02:19:15,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((1 <= data && s == \result) && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && i <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-22 02:19:15,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((0 <= index + 1 && 1 <= data) && s == \result) && \old(data) <= 3) && head == \result) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && len <= 0) && 2 <= data) && 1 <= data) && data <= 3) && 1 <= \old(data)) && 0 <= i) && index <= 1) && data == 1) && head <= 0) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && 2 <= \old(data)) && \result == s) && \old(index) <= 1) && 2 <= new_data) && i <= 1) && new_data <= 3) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-22 02:19:15,138 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((1 <= data && s == \result) && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && ((((((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && 0 < index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && head == s) && 0 <= \result) && i <= 1) || ((((((((head == head && \old(index) == i) && len + i == expected) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && i <= 1) && head == head))) && #NULL == 0 [2022-11-22 02:19:15,138 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((1 <= data && s == \result) && unknown-#memory_int-unknown[head][head] == \result) && head == \result) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && ((((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && 0 < index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && head == s) || (((((((head == head && \old(index) == i) && len + i == expected) && 0 <= i) && head == s) && head == s) && \old(index) == index) && head == head))) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && !(0 < index)) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 [2022-11-22 02:19:15,171 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:19:15,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:19:15,177 INFO L158 Benchmark]: Toolchain (without parser) took 65416.17ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 135.9MB in the beginning and 181.4MB in the end (delta: -45.5MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,178 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory was 94.1MB in the beginning and 94.0MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:19:15,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.57ms. Allocated memory is still 182.5MB. Free memory was 135.9MB in the beginning and 118.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.78ms. Allocated memory is still 182.5MB. Free memory was 118.5MB in the beginning and 116.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,178 INFO L158 Benchmark]: Boogie Preprocessor took 29.31ms. Allocated memory is still 182.5MB. Free memory was 116.3MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,179 INFO L158 Benchmark]: RCFGBuilder took 642.94ms. Allocated memory is still 182.5MB. Free memory was 115.0MB in the beginning and 148.6MB in the end (delta: -33.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,179 INFO L158 Benchmark]: TraceAbstraction took 64045.58ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 147.6MB in the beginning and 185.6MB in the end (delta: -38.0MB). Peak memory consumption was 244.1MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,186 INFO L158 Benchmark]: Witness Printer took 94.79ms. Allocated memory is still 406.8MB. Free memory was 185.6MB in the beginning and 181.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:19:15,187 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory was 94.1MB in the beginning and 94.0MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.57ms. Allocated memory is still 182.5MB. Free memory was 135.9MB in the beginning and 118.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.78ms. Allocated memory is still 182.5MB. Free memory was 118.5MB in the beginning and 116.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.31ms. Allocated memory is still 182.5MB. Free memory was 116.3MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.94ms. Allocated memory is still 182.5MB. Free memory was 115.0MB in the beginning and 148.6MB in the end (delta: -33.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 64045.58ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 147.6MB in the beginning and 185.6MB in the end (delta: -38.0MB). Peak memory consumption was 244.1MB. Max. memory is 16.1GB. * Witness Printer took 94.79ms. Allocated memory is still 406.8MB. Free memory was 185.6MB in the beginning and 181.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 63.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1229 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1229 mSDsluCounter, 899 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 322 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 778 GetRequests, 492 SyntacticMatches, 80 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=14, InterpolantAutomatonStates: 141, 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, 127 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 31 NumberOfFragments, 1002 HoareAnnotationTreeSize, 10 FomulaSimplifications, 202 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 54184 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1772 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 225/249 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: 15.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 148, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 404, TOOLS_POST_TIME: 14.2s, 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: 404, TOOLS_QUANTIFIERELIM_TIME: 14.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 698, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 47, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 19, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 54, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 148, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 10.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 10.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 54, 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: 3220, DAG_COMPRESSION_RETAINED_NODES: 493, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && len == len) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) || (((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && temp <= 0) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) - InvariantResult [Line: 576]: Loop Invariant [2022-11-22 02:19:15,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((1 <= data && 0 <= new_head) && new_head <= 0) && len <= 1) || ((1 <= data && 0 <= head) && head <= 0)) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= \old(data)) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && data == \old(data)) && data <= 1) && ((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((1 <= data && s == \result) && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && i <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant [2022-11-22 02:19:15,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((1 <= data && s == \result) && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && ((((((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && 0 < index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && head == s) && 0 <= \result) && i <= 1) || ((((((((head == head && \old(index) == i) && len + i == expected) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && i <= 1) && head == head))) && #NULL == 0 - InvariantResult [Line: 624]: Loop Invariant [2022-11-22 02:19:15,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 02:19:15,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 02:19:15,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((1 <= data && s == \result) && unknown-#memory_int-unknown[head][head] == \result) && head == \result) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && ((((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && 0 < index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && head == s) || (((((((head == head && \old(index) == i) && len + i == expected) && 0 <= i) && head == s) && head == s) && \old(index) == index) && head == head))) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && !(0 < index)) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((0 <= index + 1 && 1 <= data) && s == \result) && \old(data) <= 3) && head == \result) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && len <= 0) && 2 <= data) && 1 <= data) && data <= 3) && 1 <= \old(data)) && 0 <= i) && index <= 1) && data == 1) && head <= 0) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && 2 <= \old(data)) && \result == s) && \old(index) <= 1) && 2 <= new_data) && i <= 1) && new_data <= 3) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((1 <= data && s == \result) && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && temp <= 0) && \result == s) && i <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-22 02:19:15,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4778dd91-1db0-479b-ab1c-13b06f7ad13c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE