./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:19:53,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:19:53,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 07:19:53,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:19:53,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:19:53,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:19:53,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:19:53,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:19:53,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:19:53,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:19:53,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:19:53,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:19:53,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:19:53,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:19:53,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:19:53,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:19:53,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:19:53,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 07:19:53,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 07:19:53,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 07:19:53,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:19:53,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:19:53,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:19:53,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:19:53,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:19:53,384 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:19:53,385 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:19:53,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 07:19:53,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:19:53,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:19:53,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:19:53,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:19:53,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:19:53,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:19:53,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:19:53,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:19:53,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:19:53,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:19:53,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 07:19:53,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 07:19:53,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:19:53,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:19:53,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:19:53,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:19:53,388 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-17 07:19:53,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:19:53,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:19:53,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:19:53,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:19:53,587 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:19:53,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i [2024-11-17 07:19:54,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:19:54,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:19:54,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i [2024-11-17 07:19:55,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adec21ae/3d5013a31a924904946be78ab2c51032/FLAG8704cfa40 [2024-11-17 07:19:55,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adec21ae/3d5013a31a924904946be78ab2c51032 [2024-11-17 07:19:55,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:19:55,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:19:55,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:19:55,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:19:55,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:19:55,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f2f1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55, skipping insertion in model container [2024-11-17 07:19:55,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:19:55,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:19:55,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:19:55,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:19:55,620 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:19:55,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55 WrapperNode [2024-11-17 07:19:55,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:19:55,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:19:55,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:19:55,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:19:55,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,693 INFO L138 Inliner]: procedures = 177, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1407 [2024-11-17 07:19:55,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:19:55,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:19:55,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:19:55,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:19:55,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,776 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-17 07:19:55,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:19:55,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:19:55,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:19:55,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:19:55,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (1/1) ... [2024-11-17 07:19:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:19:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:19:55,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 07:19:55,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 07:19:55,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 07:19:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 07:19:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 07:19:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 07:19:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 07:19:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 07:19:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 07:19:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 07:19:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 07:19:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:19:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 07:19:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 07:19:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 07:19:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 07:19:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 07:19:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:19:55,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:19:56,062 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:19:56,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:19:57,067 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 07:19:57,150 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-17 07:19:57,151 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:19:57,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:19:57,196 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 07:19:57,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:19:57 BoogieIcfgContainer [2024-11-17 07:19:57,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:19:57,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:19:57,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:19:57,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:19:57,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:19:55" (1/3) ... [2024-11-17 07:19:57,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f6b43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:19:57, skipping insertion in model container [2024-11-17 07:19:57,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:19:55" (2/3) ... [2024-11-17 07:19:57,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f6b43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:19:57, skipping insertion in model container [2024-11-17 07:19:57,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:19:57" (3/3) ... [2024-11-17 07:19:57,207 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test3-1.i [2024-11-17 07:19:57,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:19:57,220 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 07:19:57,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:19:57,296 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f68a845, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:19:57,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 07:19:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 421 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 414 states have internal predecessors, (657), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 07:19:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 07:19:57,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:57,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:57,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:57,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2130674100, now seen corresponding path program 1 times [2024-11-17 07:19:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408224718] [2024-11-17 07:19:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408224718] [2024-11-17 07:19:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408224718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:19:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054339831] [2024-11-17 07:19:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:57,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 07:19:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 07:19:57,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:19:57,492 INFO L87 Difference]: Start difference. First operand has 421 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 414 states have internal predecessors, (657), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 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) [2024-11-17 07:19:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:57,588 INFO L93 Difference]: Finished difference Result 838 states and 1331 transitions. [2024-11-17 07:19:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 07:19:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 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 [2024-11-17 07:19:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:57,601 INFO L225 Difference]: With dead ends: 838 [2024-11-17 07:19:57,601 INFO L226 Difference]: Without dead ends: 410 [2024-11-17 07:19:57,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:19:57,610 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:57,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:19:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-17 07:19:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2024-11-17 07:19:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.4472361809045227) internal successors, (576), 404 states have internal predecessors, (576), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:19:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 584 transitions. [2024-11-17 07:19:57,676 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 584 transitions. Word has length 8 [2024-11-17 07:19:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:57,677 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 584 transitions. [2024-11-17 07:19:57,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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) [2024-11-17 07:19:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 584 transitions. [2024-11-17 07:19:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 07:19:57,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:57,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:57,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 07:19:57,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:57,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2130675061, now seen corresponding path program 1 times [2024-11-17 07:19:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436519929] [2024-11-17 07:19:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 07:19:57,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831079390] [2024-11-17 07:19:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:57,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:19:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:19:57,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:19:57,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 07:19:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:57,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 07:19:57,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:19:57,901 INFO L378 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 [2024-11-17 07:19:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:57,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:19:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436519929] [2024-11-17 07:19:57,928 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 07:19:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831079390] [2024-11-17 07:19:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831079390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:57,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:19:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549093360] [2024-11-17 07:19:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:57,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:19:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:19:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:19:57,931 INFO L87 Difference]: Start difference. First operand 410 states and 584 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) [2024-11-17 07:19:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:58,155 INFO L93 Difference]: Finished difference Result 809 states and 1158 transitions. [2024-11-17 07:19:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:19:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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 [2024-11-17 07:19:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:58,159 INFO L225 Difference]: With dead ends: 809 [2024-11-17 07:19:58,160 INFO L226 Difference]: Without dead ends: 807 [2024-11-17 07:19:58,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:19:58,161 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 560 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:58,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1630 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 07:19:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-17 07:19:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 416. [2024-11-17 07:19:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 404 states have (on average 1.443069306930693) internal successors, (583), 410 states have internal predecessors, (583), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:19:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 591 transitions. [2024-11-17 07:19:58,183 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 591 transitions. Word has length 8 [2024-11-17 07:19:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 591 transitions. [2024-11-17 07:19:58,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) [2024-11-17 07:19:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 591 transitions. [2024-11-17 07:19:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 07:19:58,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:58,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:58,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 07:19:58,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:19:58,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:58,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 868012450, now seen corresponding path program 1 times [2024-11-17 07:19:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838943247] [2024-11-17 07:19:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:58,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 07:19:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838943247] [2024-11-17 07:19:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838943247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:58,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:58,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 07:19:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284202819] [2024-11-17 07:19:58,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:58,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:19:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:58,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:19:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:19:58,623 INFO L87 Difference]: Start difference. First operand 416 states and 591 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:19:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:58,736 INFO L93 Difference]: Finished difference Result 569 states and 806 transitions. [2024-11-17 07:19:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:19:58,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-17 07:19:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:58,738 INFO L225 Difference]: With dead ends: 569 [2024-11-17 07:19:58,738 INFO L226 Difference]: Without dead ends: 374 [2024-11-17 07:19:58,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:19:58,739 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 30 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:58,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1327 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:19:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-17 07:19:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-17 07:19:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 362 states have (on average 1.3977900552486189) internal successors, (506), 368 states have internal predecessors, (506), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:19:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2024-11-17 07:19:58,747 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 72 [2024-11-17 07:19:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:58,747 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2024-11-17 07:19:58,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:19:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2024-11-17 07:19:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 07:19:58,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:58,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:58,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 07:19:58,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:58,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1258977188, now seen corresponding path program 1 times [2024-11-17 07:19:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615892265] [2024-11-17 07:19:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 07:19:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615892265] [2024-11-17 07:19:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615892265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 07:19:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185755004] [2024-11-17 07:19:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:58,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:19:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:19:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:19:58,872 INFO L87 Difference]: Start difference. First operand 374 states and 514 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:19:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:58,949 INFO L93 Difference]: Finished difference Result 527 states and 718 transitions. [2024-11-17 07:19:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:19:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-17 07:19:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:58,951 INFO L225 Difference]: With dead ends: 527 [2024-11-17 07:19:58,952 INFO L226 Difference]: Without dead ends: 369 [2024-11-17 07:19:58,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:19:58,953 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:58,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1393 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:19:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-17 07:19:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-17 07:19:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 359 states have (on average 1.3983286908077994) internal successors, (502), 364 states have internal predecessors, (502), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:19:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 508 transitions. [2024-11-17 07:19:58,966 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 508 transitions. Word has length 72 [2024-11-17 07:19:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:58,967 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 508 transitions. [2024-11-17 07:19:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:19:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 508 transitions. [2024-11-17 07:19:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 07:19:58,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:58,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:58,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 07:19:58,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:58,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1654396195, now seen corresponding path program 1 times [2024-11-17 07:19:58,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:58,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396064277] [2024-11-17 07:19:58,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:58,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396064277] [2024-11-17 07:19:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396064277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:19:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545944089] [2024-11-17 07:19:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:59,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:19:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:59,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:19:59,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:19:59,060 INFO L87 Difference]: Start difference. First operand 369 states and 508 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-17 07:19:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:59,145 INFO L93 Difference]: Finished difference Result 525 states and 715 transitions. [2024-11-17 07:19:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:19:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-17 07:19:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:59,149 INFO L225 Difference]: With dead ends: 525 [2024-11-17 07:19:59,149 INFO L226 Difference]: Without dead ends: 369 [2024-11-17 07:19:59,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:19:59,151 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 16 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:59,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 897 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:19:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-17 07:19:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-17 07:19:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 359 states have (on average 1.3871866295264623) internal successors, (498), 364 states have internal predecessors, (498), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:19:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 504 transitions. [2024-11-17 07:19:59,161 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 504 transitions. Word has length 73 [2024-11-17 07:19:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:59,162 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 504 transitions. [2024-11-17 07:19:59,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-17 07:19:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 504 transitions. [2024-11-17 07:19:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-17 07:19:59,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:59,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:59,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 07:19:59,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:59,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 390403196, now seen corresponding path program 1 times [2024-11-17 07:19:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610621486] [2024-11-17 07:19:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610621486] [2024-11-17 07:19:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610621486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:59,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:59,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 07:19:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533325680] [2024-11-17 07:19:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:59,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:19:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:19:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:19:59,318 INFO L87 Difference]: Start difference. First operand 369 states and 504 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2024-11-17 07:19:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:59,408 INFO L93 Difference]: Finished difference Result 687 states and 932 transitions. [2024-11-17 07:19:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:19:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2024-11-17 07:19:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:59,410 INFO L225 Difference]: With dead ends: 687 [2024-11-17 07:19:59,410 INFO L226 Difference]: Without dead ends: 327 [2024-11-17 07:19:59,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:19:59,411 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 30 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:59,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1075 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:19:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-17 07:19:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-11-17 07:19:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 317 states have (on average 1.3280757097791798) internal successors, (421), 322 states have internal predecessors, (421), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:19:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 427 transitions. [2024-11-17 07:19:59,417 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 427 transitions. Word has length 84 [2024-11-17 07:19:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 427 transitions. [2024-11-17 07:19:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2024-11-17 07:19:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 427 transitions. [2024-11-17 07:19:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-17 07:19:59,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:59,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 07:19:59,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:59,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash -995540523, now seen corresponding path program 1 times [2024-11-17 07:19:59,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:59,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670109404] [2024-11-17 07:19:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:19:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670109404] [2024-11-17 07:19:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670109404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:19:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121439343] [2024-11-17 07:19:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:59,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:19:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:19:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:19:59,513 INFO L87 Difference]: Start difference. First operand 327 states and 427 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-11-17 07:19:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:19:59,608 INFO L93 Difference]: Finished difference Result 830 states and 1092 transitions. [2024-11-17 07:19:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:19:59,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2024-11-17 07:19:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:19:59,611 INFO L225 Difference]: With dead ends: 830 [2024-11-17 07:19:59,611 INFO L226 Difference]: Without dead ends: 422 [2024-11-17 07:19:59,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:19:59,612 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 181 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:19:59,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 744 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:19:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-17 07:19:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2024-11-17 07:19:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 410 states have (on average 1.329268292682927) internal successors, (545), 415 states have internal predecessors, (545), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:19:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 551 transitions. [2024-11-17 07:19:59,619 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 551 transitions. Word has length 84 [2024-11-17 07:19:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:19:59,619 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 551 transitions. [2024-11-17 07:19:59,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-11-17 07:19:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 551 transitions. [2024-11-17 07:19:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 07:19:59,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:19:59,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:19:59,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 07:19:59,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:19:59,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:19:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash 956066919, now seen corresponding path program 1 times [2024-11-17 07:19:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:19:59,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22375721] [2024-11-17 07:19:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:19:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:19:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 07:19:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:59,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-17 07:19:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:19:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 07:19:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:19:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22375721] [2024-11-17 07:19:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22375721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:19:59,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:19:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 07:19:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081857791] [2024-11-17 07:19:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:19:59,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 07:19:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:19:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 07:19:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 07:19:59,929 INFO L87 Difference]: Start difference. First operand 420 states and 551 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:00,189 INFO L93 Difference]: Finished difference Result 645 states and 849 transitions. [2024-11-17 07:20:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 07:20:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-17 07:20:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:00,193 INFO L225 Difference]: With dead ends: 645 [2024-11-17 07:20:00,193 INFO L226 Difference]: Without dead ends: 643 [2024-11-17 07:20:00,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:20:00,194 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 305 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:00,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1398 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 07:20:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-17 07:20:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 485. [2024-11-17 07:20:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 477 states have internal predecessors, (624), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 07:20:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 636 transitions. [2024-11-17 07:20:00,206 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 636 transitions. Word has length 99 [2024-11-17 07:20:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:00,207 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 636 transitions. [2024-11-17 07:20:00,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 636 transitions. [2024-11-17 07:20:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 07:20:00,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:00,208 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:00,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 07:20:00,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:00,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2109770592, now seen corresponding path program 1 times [2024-11-17 07:20:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:00,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188603916] [2024-11-17 07:20:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 07:20:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:00,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-17 07:20:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 07:20:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188603916] [2024-11-17 07:20:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188603916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:20:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163857194] [2024-11-17 07:20:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:00,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:00,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:20:00,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:20:00,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 07:20:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:00,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 07:20:00,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:20:00,853 INFO L378 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 [2024-11-17 07:20:00,873 INFO L378 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 [2024-11-17 07:20:00,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-17 07:20:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 07:20:01,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:20:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163857194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:20:01,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:20:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-17 07:20:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195783828] [2024-11-17 07:20:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:20:01,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 07:20:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:20:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 07:20:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-17 07:20:01,549 INFO L87 Difference]: Start difference. First operand 485 states and 636 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:02,921 INFO L93 Difference]: Finished difference Result 1090 states and 1432 transitions. [2024-11-17 07:20:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 07:20:02,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2024-11-17 07:20:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:02,924 INFO L225 Difference]: With dead ends: 1090 [2024-11-17 07:20:02,924 INFO L226 Difference]: Without dead ends: 654 [2024-11-17 07:20:02,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-17 07:20:02,925 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 515 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:02,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2206 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 07:20:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-17 07:20:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 485. [2024-11-17 07:20:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 472 states have (on average 1.319915254237288) internal successors, (623), 477 states have internal predecessors, (623), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 07:20:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 635 transitions. [2024-11-17 07:20:02,941 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 635 transitions. Word has length 106 [2024-11-17 07:20:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:02,941 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 635 transitions. [2024-11-17 07:20:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 635 transitions. [2024-11-17 07:20:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-17 07:20:02,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:02,942 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:02,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 07:20:03,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-17 07:20:03,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:03,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 379285456, now seen corresponding path program 1 times [2024-11-17 07:20:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:03,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616145959] [2024-11-17 07:20:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-17 07:20:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-17 07:20:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 07:20:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616145959] [2024-11-17 07:20:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616145959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:20:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796351890] [2024-11-17 07:20:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:03,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:20:03,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:20:03,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 07:20:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:03,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 07:20:03,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:20:03,876 INFO L378 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 [2024-11-17 07:20:03,889 INFO L378 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 [2024-11-17 07:20:03,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-17 07:20:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 07:20:04,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:20:04,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796351890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:20:04,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:20:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-17 07:20:04,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014457564] [2024-11-17 07:20:04,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:20:04,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 07:20:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:20:04,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 07:20:04,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-17 07:20:04,600 INFO L87 Difference]: Start difference. First operand 485 states and 635 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:05,409 INFO L93 Difference]: Finished difference Result 1105 states and 1452 transitions. [2024-11-17 07:20:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 07:20:05,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2024-11-17 07:20:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:05,411 INFO L225 Difference]: With dead ends: 1105 [2024-11-17 07:20:05,412 INFO L226 Difference]: Without dead ends: 674 [2024-11-17 07:20:05,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-11-17 07:20:05,413 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 601 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:05,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1632 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 07:20:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-17 07:20:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 501. [2024-11-17 07:20:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 488 states have (on average 1.3176229508196722) internal successors, (643), 493 states have internal predecessors, (643), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 07:20:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 655 transitions. [2024-11-17 07:20:05,423 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 655 transitions. Word has length 107 [2024-11-17 07:20:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:05,424 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 655 transitions. [2024-11-17 07:20:05,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 655 transitions. [2024-11-17 07:20:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 07:20:05,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:05,425 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:05,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 07:20:05,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:05,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:05,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:05,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2116561703, now seen corresponding path program 1 times [2024-11-17 07:20:05,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:05,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084577897] [2024-11-17 07:20:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 07:20:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-17 07:20:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 07:20:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084577897] [2024-11-17 07:20:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084577897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:20:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:20:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 07:20:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077492039] [2024-11-17 07:20:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:20:05,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 07:20:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:20:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 07:20:05,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:20:05,883 INFO L87 Difference]: Start difference. First operand 501 states and 655 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:06,322 INFO L93 Difference]: Finished difference Result 952 states and 1259 transitions. [2024-11-17 07:20:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:20:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2024-11-17 07:20:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:06,326 INFO L225 Difference]: With dead ends: 952 [2024-11-17 07:20:06,327 INFO L226 Difference]: Without dead ends: 514 [2024-11-17 07:20:06,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:20:06,327 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 17 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:06,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2195 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 07:20:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-17 07:20:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 509. [2024-11-17 07:20:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 496 states have (on average 1.3165322580645162) internal successors, (653), 501 states have internal predecessors, (653), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 07:20:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 665 transitions. [2024-11-17 07:20:06,341 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 665 transitions. Word has length 108 [2024-11-17 07:20:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:06,341 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 665 transitions. [2024-11-17 07:20:06,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 665 transitions. [2024-11-17 07:20:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 07:20:06,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:06,342 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:06,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 07:20:06,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:06,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1006804067, now seen corresponding path program 1 times [2024-11-17 07:20:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897288279] [2024-11-17 07:20:06,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:06,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 07:20:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:06,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-17 07:20:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 07:20:06,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897288279] [2024-11-17 07:20:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897288279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:20:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:20:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 07:20:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807123114] [2024-11-17 07:20:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:20:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 07:20:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:20:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 07:20:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:20:06,595 INFO L87 Difference]: Start difference. First operand 509 states and 665 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:06,925 INFO L93 Difference]: Finished difference Result 967 states and 1279 transitions. [2024-11-17 07:20:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 07:20:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2024-11-17 07:20:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:06,927 INFO L225 Difference]: With dead ends: 967 [2024-11-17 07:20:06,927 INFO L226 Difference]: Without dead ends: 518 [2024-11-17 07:20:06,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:20:06,928 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 12 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:06,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1621 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 07:20:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-17 07:20:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 515. [2024-11-17 07:20:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 502 states have (on average 1.3127490039840637) internal successors, (659), 507 states have internal predecessors, (659), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 07:20:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 671 transitions. [2024-11-17 07:20:06,939 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 671 transitions. Word has length 108 [2024-11-17 07:20:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:06,939 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 671 transitions. [2024-11-17 07:20:06,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 671 transitions. [2024-11-17 07:20:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 07:20:06,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:06,940 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:06,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 07:20:06,940 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:06,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -90852809, now seen corresponding path program 1 times [2024-11-17 07:20:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:06,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139505409] [2024-11-17 07:20:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 07:20:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-17 07:20:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 07:20:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139505409] [2024-11-17 07:20:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139505409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:20:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654239849] [2024-11-17 07:20:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:07,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:07,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:20:07,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:20:07,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 07:20:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:07,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 07:20:07,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:20:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 07:20:07,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:20:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654239849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:20:07,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:20:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-17 07:20:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462423513] [2024-11-17 07:20:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:20:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 07:20:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:20:07,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 07:20:07,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-17 07:20:07,519 INFO L87 Difference]: Start difference. First operand 515 states and 671 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:07,764 INFO L93 Difference]: Finished difference Result 980 states and 1287 transitions. [2024-11-17 07:20:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 07:20:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2024-11-17 07:20:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:07,767 INFO L225 Difference]: With dead ends: 980 [2024-11-17 07:20:07,767 INFO L226 Difference]: Without dead ends: 521 [2024-11-17 07:20:07,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-17 07:20:07,768 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 44 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1927 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 07:20:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-17 07:20:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 503. [2024-11-17 07:20:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 490 states have (on average 1.3081632653061224) internal successors, (641), 495 states have internal predecessors, (641), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 07:20:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 653 transitions. [2024-11-17 07:20:07,780 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 653 transitions. Word has length 109 [2024-11-17 07:20:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 653 transitions. [2024-11-17 07:20:07,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 07:20:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 653 transitions. [2024-11-17 07:20:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 07:20:07,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:07,781 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:07,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 07:20:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:07,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1539430962, now seen corresponding path program 1 times [2024-11-17 07:20:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299302619] [2024-11-17 07:20:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 07:20:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-17 07:20:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 07:20:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299302619] [2024-11-17 07:20:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299302619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:20:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990194247] [2024-11-17 07:20:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:20:08,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:20:08,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 07:20:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:08,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 07:20:08,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:20:08,565 INFO L378 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 [2024-11-17 07:20:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:20:08,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:20:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990194247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:20:08,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 07:20:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2024-11-17 07:20:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551022105] [2024-11-17 07:20:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:20:08,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:20:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:20:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:20:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 07:20:08,600 INFO L87 Difference]: Start difference. First operand 503 states and 653 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:20:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:20:08,755 INFO L93 Difference]: Finished difference Result 902 states and 1177 transitions. [2024-11-17 07:20:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 07:20:08,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-11-17 07:20:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:20:08,758 INFO L225 Difference]: With dead ends: 902 [2024-11-17 07:20:08,758 INFO L226 Difference]: Without dead ends: 507 [2024-11-17 07:20:08,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 07:20:08,759 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 195 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:20:08,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 2009 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:20:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-17 07:20:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2024-11-17 07:20:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 492 states have (on average 1.3089430894308942) internal successors, (644), 498 states have internal predecessors, (644), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-17 07:20:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 658 transitions. [2024-11-17 07:20:08,771 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 658 transitions. Word has length 109 [2024-11-17 07:20:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:20:08,772 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 658 transitions. [2024-11-17 07:20:08,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:20:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 658 transitions. [2024-11-17 07:20:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-17 07:20:08,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:20:08,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:20:08,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 07:20:08,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 07:20:08,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:20:08,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:20:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1785173522, now seen corresponding path program 1 times [2024-11-17 07:20:08,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:20:08,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159939255] [2024-11-17 07:20:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:08,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:20:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 07:20:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-17 07:20:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 07:20:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:20:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159939255] [2024-11-17 07:20:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159939255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 07:20:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358859202] [2024-11-17 07:20:09,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:20:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 07:20:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:20:09,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 07:20:09,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 07:20:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:20:09,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-17 07:20:09,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:20:09,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-17 07:20:09,656 INFO L378 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 19 treesize of output 1 [2024-11-17 07:20:09,658 INFO L378 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 13 treesize of output 9 [2024-11-17 07:20:09,675 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-17 07:20:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-17 07:20:09,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 07:20:09,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-17 07:20:09,813 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 07:20:09,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 07:20:09,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 13 [2024-11-17 07:20:13,795 INFO L224 Elim1Store]: Index analysis took 122 ms