./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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_FNV_test1-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 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:55:55,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:55:55,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 21:55:55,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:55:55,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:55:55,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:55:55,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:55:55,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:55:55,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:55:55,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:55:55,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:55:55,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:55:55,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:55:55,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:55:55,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:55:55,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:55:55,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:55:55,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 21:55:55,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:55:55,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 21:55:55,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:55:55,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:55:55,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:55:55,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:55:55,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:55:55,397 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:55:55,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:55:55,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 21:55:55,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:55:55,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:55:55,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:55:55,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:55:55,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:55:55,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:55:55,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:55:55,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:55:55,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:55:55,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:55:55,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:55:55,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:55:55,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:55:55,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:55:55,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:55:55,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:55:55,400 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 -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2024-11-10 21:55:55,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:55:55,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:55:55,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:55:55,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:55:55,649 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:55:55,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2024-11-10 21:55:56,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:55:57,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:55:57,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2024-11-10 21:55:57,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d14392b1/d192714d0af34bf094ca0ae257c4f5b2/FLAG2794b6bdc [2024-11-10 21:55:57,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d14392b1/d192714d0af34bf094ca0ae257c4f5b2 [2024-11-10 21:55:57,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:55:57,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:55:57,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:55:57,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:55:57,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:55:57,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:57,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e897015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57, skipping insertion in model container [2024-11-10 21:55:57,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:57,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:55:57,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:55:57,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:55:57,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:55:57,908 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:55:57,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57 WrapperNode [2024-11-10 21:55:57,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:55:57,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:55:57,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:55:57,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:55:57,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:57,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:57,984 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-10 21:55:57,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:55:57,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:55:57,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:55:57,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:55:57,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:57,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,041 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-10 21:55:58,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:55:58,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:55:58,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:55:58,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:55:58,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (1/1) ... [2024-11-10 21:55:58,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:55:58,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:58,105 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-10 21:55:58,107 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-10 21:55:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:55:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:55:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 21:55:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 21:55:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:55:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:55:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 21:55:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 21:55:58,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 21:55:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:55:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:55:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:55:58,274 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:55:58,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:55:59,021 INFO L? ?]: Removed 214 outVars from TransFormulas that were not future-live. [2024-11-10 21:55:59,021 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:55:59,056 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:55:59,057 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 21:55:59,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:59 BoogieIcfgContainer [2024-11-10 21:55:59,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:55:59,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:55:59,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:55:59,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:55:59,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:55:57" (1/3) ... [2024-11-10 21:55:59,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c36243f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:59, skipping insertion in model container [2024-11-10 21:55:59,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:57" (2/3) ... [2024-11-10 21:55:59,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c36243f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:59, skipping insertion in model container [2024-11-10 21:55:59,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:59" (3/3) ... [2024-11-10 21:55:59,062 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-1.i [2024-11-10 21:55:59,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:55:59,074 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 21:55:59,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:55:59,133 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;@40b7adf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:55:59,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 21:55:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 253 states, 231 states have (on average 1.606060606060606) internal successors, (371), 247 states have internal predecessors, (371), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:55:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:55:59,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:59,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:59,142 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-10 21:55:59,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1502697904, now seen corresponding path program 1 times [2024-11-10 21:55:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993362686] [2024-11-10 21:55:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:59,271 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-10 21:55:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993362686] [2024-11-10 21:55:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993362686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 21:55:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213978445] [2024-11-10 21:55:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:59,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:55:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:55:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:55:59,298 INFO L87 Difference]: Start difference. First operand has 253 states, 231 states have (on average 1.606060606060606) internal successors, (371), 247 states have internal predecessors, (371), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:59,380 INFO L93 Difference]: Finished difference Result 502 states and 801 transitions. [2024-11-10 21:55:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:55:59,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 21:55:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:59,391 INFO L225 Difference]: With dead ends: 502 [2024-11-10 21:55:59,391 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 21:55:59,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-10 21:55:59,396 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:59,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:55:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 21:55:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-10 21:55:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 226 states have (on average 1.4469026548672566) internal successors, (327), 240 states have internal predecessors, (327), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:55:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 353 transitions. [2024-11-10 21:55:59,436 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 353 transitions. Word has length 7 [2024-11-10 21:55:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 353 transitions. [2024-11-10 21:55:59,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 353 transitions. [2024-11-10 21:55:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:55:59,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:59,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:59,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:55:59,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:59,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash -673626249, now seen corresponding path program 1 times [2024-11-10 21:55:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:59,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588082227] [2024-11-10 21:55:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:59,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:59,499 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-10 21:55:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588082227] [2024-11-10 21:55:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588082227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:59,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:59,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584769272] [2024-11-10 21:55:59,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:59,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:55:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:59,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:55:59,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:59,503 INFO L87 Difference]: Start difference. First operand 246 states and 353 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-10 21:55:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:59,628 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2024-11-10 21:55:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:55:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-10 21:55:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:59,631 INFO L225 Difference]: With dead ends: 481 [2024-11-10 21:55:59,631 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 21:55:59,632 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-10 21:55:59,633 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 279 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:59,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 687 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 21:55:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 252. [2024-11-10 21:55:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 232 states have (on average 1.4353448275862069) internal successors, (333), 246 states have internal predecessors, (333), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:55:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 359 transitions. [2024-11-10 21:55:59,660 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 359 transitions. Word has length 8 [2024-11-10 21:55:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:59,661 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 359 transitions. [2024-11-10 21:55:59,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-10 21:55:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 359 transitions. [2024-11-10 21:55:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:55:59,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:59,663 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] [2024-11-10 21:55:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:55:59,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1330756842, now seen corresponding path program 1 times [2024-11-10 21:55:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530218612] [2024-11-10 21:55:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:59,938 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-10 21:55:59,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:59,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530218612] [2024-11-10 21:55:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530218612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:59,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:59,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972599269] [2024-11-10 21:55:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:59,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:59,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:59,940 INFO L87 Difference]: Start difference. First operand 252 states and 359 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10 21:56:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:00,036 INFO L93 Difference]: Finished difference Result 461 states and 654 transitions. [2024-11-10 21:56:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:56:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2024-11-10 21:56:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:00,038 INFO L225 Difference]: With dead ends: 461 [2024-11-10 21:56:00,038 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 21:56:00,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10 21:56:00,040 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 23 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:00,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 692 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 21:56:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2024-11-10 21:56:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 196 states have (on average 1.3520408163265305) internal successors, (265), 210 states have internal predecessors, (265), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 291 transitions. [2024-11-10 21:56:00,050 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 291 transitions. Word has length 83 [2024-11-10 21:56:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:00,050 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 291 transitions. [2024-11-10 21:56:00,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10 21:56:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2024-11-10 21:56:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:56:00,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:00,052 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] [2024-11-10 21:56:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:56:00,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1768766345, now seen corresponding path program 1 times [2024-11-10 21:56:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775381999] [2024-11-10 21:56:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,263 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-10 21:56:00,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:00,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775381999] [2024-11-10 21:56:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775381999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:00,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:00,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743033985] [2024-11-10 21:56:00,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:00,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:56:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:00,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:56:00,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:56:00,268 INFO L87 Difference]: Start difference. First operand 216 states and 291 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10 21:56:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:00,356 INFO L93 Difference]: Finished difference Result 412 states and 562 transitions. [2024-11-10 21:56:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:56:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2024-11-10 21:56:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:00,358 INFO L225 Difference]: With dead ends: 412 [2024-11-10 21:56:00,358 INFO L226 Difference]: Without dead ends: 204 [2024-11-10 21:56:00,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10 21:56:00,363 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 27 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:00,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 689 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-10 21:56:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-10 21:56:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 184 states have (on average 1.3369565217391304) internal successors, (246), 198 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 272 transitions. [2024-11-10 21:56:00,382 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 272 transitions. Word has length 83 [2024-11-10 21:56:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:00,382 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 272 transitions. [2024-11-10 21:56:00,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10 21:56:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 272 transitions. [2024-11-10 21:56:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:56:00,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:00,387 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] [2024-11-10 21:56:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:56:00,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1140257232, now seen corresponding path program 1 times [2024-11-10 21:56:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870908131] [2024-11-10 21:56:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,518 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-10 21:56:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870908131] [2024-11-10 21:56:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870908131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037321050] [2024-11-10 21:56:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:00,522 INFO L87 Difference]: Start difference. First operand 204 states and 272 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-10 21:56:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:00,574 INFO L93 Difference]: Finished difference Result 481 states and 645 transitions. [2024-11-10 21:56:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 21:56:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:00,576 INFO L225 Difference]: With dead ends: 481 [2024-11-10 21:56:00,576 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 21:56:00,577 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-10 21:56:00,578 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 54 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:00,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 496 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:56:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 21:56:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-10 21:56:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 265 states have (on average 1.3358490566037735) internal successors, (354), 279 states have internal predecessors, (354), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 380 transitions. [2024-11-10 21:56:00,596 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 380 transitions. Word has length 83 [2024-11-10 21:56:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:00,597 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 380 transitions. [2024-11-10 21:56:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-10 21:56:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-11-10 21:56:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 21:56:00,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:00,601 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] [2024-11-10 21:56:00,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 21:56:00,601 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-10 21:56:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 842264887, now seen corresponding path program 1 times [2024-11-10 21:56:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182863730] [2024-11-10 21:56:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:00,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,794 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-10 21:56:00,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:00,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182863730] [2024-11-10 21:56:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182863730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090123484] [2024-11-10 21:56:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:00,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:56:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:56:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:00,800 INFO L87 Difference]: Start difference. First operand 285 states and 380 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10 21:56:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:01,092 INFO L93 Difference]: Finished difference Result 356 states and 477 transitions. [2024-11-10 21:56:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:56:01,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 98 [2024-11-10 21:56:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:01,095 INFO L225 Difference]: With dead ends: 356 [2024-11-10 21:56:01,096 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 21:56:01,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:01,097 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 114 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:01,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 868 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:56:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 21:56:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2024-11-10 21:56:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 327 states have (on average 1.3241590214067278) internal successors, (433), 341 states have internal predecessors, (433), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 465 transitions. [2024-11-10 21:56:01,106 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 465 transitions. Word has length 98 [2024-11-10 21:56:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:01,107 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 465 transitions. [2024-11-10 21:56:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10 21:56:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 465 transitions. [2024-11-10 21:56:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 21:56:01,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:01,110 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-10 21:56:01,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 21:56:01,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:01,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1080715052, now seen corresponding path program 1 times [2024-11-10 21:56:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:01,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063413710] [2024-11-10 21:56:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:01,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063413710] [2024-11-10 21:56:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063413710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:01,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487332560] [2024-11-10 21:56:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:01,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:01,327 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-10 21:56:01,328 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-10 21:56:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:01,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:56:01,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:01,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:56:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487332560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:56:01,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:56:01,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 21:56:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791689522] [2024-11-10 21:56:01,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:56:01,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:56:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:56:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:56:01,821 INFO L87 Difference]: Start difference. First operand 350 states and 465 transitions. Second operand has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:56:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:02,140 INFO L93 Difference]: Finished difference Result 546 states and 741 transitions. [2024-11-10 21:56:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:56:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 106 [2024-11-10 21:56:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:02,143 INFO L225 Difference]: With dead ends: 546 [2024-11-10 21:56:02,143 INFO L226 Difference]: Without dead ends: 511 [2024-11-10 21:56:02,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:56:02,147 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 602 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:02,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1356 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:56:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-10 21:56:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 508. [2024-11-10 21:56:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 482 states have (on average 1.3174273858921162) internal successors, (635), 496 states have internal predecessors, (635), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 21:56:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 673 transitions. [2024-11-10 21:56:02,166 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 673 transitions. Word has length 106 [2024-11-10 21:56:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 673 transitions. [2024-11-10 21:56:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:56:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 673 transitions. [2024-11-10 21:56:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 21:56:02,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:02,169 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] [2024-11-10 21:56:02,184 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-10 21:56:02,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:02,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1093336465, now seen corresponding path program 1 times [2024-11-10 21:56:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296810537] [2024-11-10 21:56:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:56:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296810537] [2024-11-10 21:56:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296810537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733013959] [2024-11-10 21:56:02,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:02,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:02,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:02,743 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-10 21:56:02,744 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-10 21:56:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:02,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 21:56:02,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:02,983 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-10 21:56:03,000 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 27 treesize of output 11 [2024-11-10 21:56:03,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 21:56:03,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-11-10 21:56:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:03,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:56:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733013959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:56:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-10 21:56:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255450693] [2024-11-10 21:56:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:56:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:56:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:56:03,638 INFO L87 Difference]: Start difference. First operand 508 states and 673 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-10 21:56:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:04,658 INFO L93 Difference]: Finished difference Result 974 states and 1301 transitions. [2024-11-10 21:56:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 21:56:04,659 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-10 21:56:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:04,661 INFO L225 Difference]: With dead ends: 974 [2024-11-10 21:56:04,661 INFO L226 Difference]: Without dead ends: 508 [2024-11-10 21:56:04,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-10 21:56:04,663 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 292 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:04,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1517 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 21:56:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-10 21:56:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2024-11-10 21:56:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 482 states have (on average 1.3153526970954357) internal successors, (634), 496 states have internal predecessors, (634), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 21:56:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 672 transitions. [2024-11-10 21:56:04,681 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 672 transitions. Word has length 106 [2024-11-10 21:56:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:04,681 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 672 transitions. [2024-11-10 21:56:04,681 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-10 21:56:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 672 transitions. [2024-11-10 21:56:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 21:56:04,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:04,682 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] [2024-11-10 21:56:04,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 21:56:04,883 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,SelfDestructingSolverStorable7 [2024-11-10 21:56:04,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:04,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1643857620, now seen corresponding path program 1 times [2024-11-10 21:56:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264776204] [2024-11-10 21:56:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 21:56:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 21:56:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:56:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264776204] [2024-11-10 21:56:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264776204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280684574] [2024-11-10 21:56:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:05,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:05,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:05,239 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-10 21:56:05,240 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-10 21:56:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:05,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 21:56:05,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:57:01,202 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 21:57:06,755 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 21:57:21,415 WARN L286 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 21:57:37,489 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)