./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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_SFH_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 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:49:22,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:49:22,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 14:49:22,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:49:22,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:49:22,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:49:22,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:49:22,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:49:22,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:49:22,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:49:22,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:49:22,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:49:22,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:49:22,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:49:22,700 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:49:22,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:49:22,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:49:22,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 14:49:22,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:49:22,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 14:49:22,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:49:22,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:49:22,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:49:22,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:49:22,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:49:22,703 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:49:22,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:49:22,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 14:49:22,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:49:22,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:49:22,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:49:22,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:49:22,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:49:22,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:49:22,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:49:22,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:49:22,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:49:22,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:49:22,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:49:22,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:49:22,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:49:22,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:49:22,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:49:22,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:49:22,706 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 -> 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 [2024-11-09 14:49:22,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:49:22,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:49:22,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:49:22,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:49:22,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:49:22,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-09 14:49:24,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:49:24,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:49:24,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-09 14:49:24,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f0350a7/9092bd616959440dbcb41b94bc4b111e/FLAG13287381c [2024-11-09 14:49:24,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f0350a7/9092bd616959440dbcb41b94bc4b111e [2024-11-09 14:49:24,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:49:24,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:49:24,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:49:24,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:49:24,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:49:24,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:24" (1/1) ... [2024-11-09 14:49:24,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192931cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:24, skipping insertion in model container [2024-11-09 14:49:24,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:24" (1/1) ... [2024-11-09 14:49:24,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:49:25,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:49:25,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:49:25,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:49:25,143 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:49:25,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25 WrapperNode [2024-11-09 14:49:25,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:49:25,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:49:25,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:49:25,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:49:25,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,219 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 849 [2024-11-09 14:49:25,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:49:25,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:49:25,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:49:25,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:49:25,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,284 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-09 14:49:25,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:49:25,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:49:25,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:49:25,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:49:25,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (1/1) ... [2024-11-09 14:49:25,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:49:25,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:25,372 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-09 14:49:25,376 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-09 14:49:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 14:49:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 14:49:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 14:49:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 14:49:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:49:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:49:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 14:49:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 14:49:25,415 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 14:49:25,416 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 14:49:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:49:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:49:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:49:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:49:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:49:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:49:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:49:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:49:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:49:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:49:25,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:49:25,565 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:49:25,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:49:26,476 INFO L? ?]: Removed 214 outVars from TransFormulas that were not future-live. [2024-11-09 14:49:26,476 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:49:26,491 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:49:26,493 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-09 14:49:26,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:26 BoogieIcfgContainer [2024-11-09 14:49:26,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:49:26,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:49:26,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:49:26,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:49:26,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:49:24" (1/3) ... [2024-11-09 14:49:26,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceca27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:26, skipping insertion in model container [2024-11-09 14:49:26,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:25" (2/3) ... [2024-11-09 14:49:26,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceca27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:26, skipping insertion in model container [2024-11-09 14:49:26,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:26" (3/3) ... [2024-11-09 14:49:26,501 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-1.i [2024-11-09 14:49:26,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:49:26,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 14:49:26,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:49:26,595 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;@169058f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:49:26,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 14:49:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 225 states have (on average 1.6222222222222222) internal successors, (365), 241 states have internal predecessors, (365), 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-09 14:49:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 14:49:26,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:26,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 14:49:26,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1363672333, now seen corresponding path program 1 times [2024-11-09 14:49:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:26,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350074597] [2024-11-09 14:49:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:26,802 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-09 14:49:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350074597] [2024-11-09 14:49:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350074597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:49:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123036439] [2024-11-09 14:49:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:26,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:49:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:26,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:49:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:49:26,834 INFO L87 Difference]: Start difference. First operand has 247 states, 225 states have (on average 1.6222222222222222) internal successors, (365), 241 states have internal predecessors, (365), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 14:49:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:26,941 INFO L93 Difference]: Finished difference Result 686 states and 1109 transitions. [2024-11-09 14:49:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:49:26,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 14:49:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:26,960 INFO L225 Difference]: With dead ends: 686 [2024-11-09 14:49:26,960 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 14:49:26,964 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-09 14:49:26,966 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 276 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:26,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:49:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 14:49:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 245. [2024-11-09 14:49:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 225 states have (on average 1.448888888888889) internal successors, (326), 239 states have internal predecessors, (326), 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-09 14:49:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 352 transitions. [2024-11-09 14:49:27,010 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 352 transitions. Word has length 6 [2024-11-09 14:49:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 352 transitions. [2024-11-09 14:49:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 14:49:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 352 transitions. [2024-11-09 14:49:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 14:49:27,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:27,014 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] [2024-11-09 14:49:27,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:49:27,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:27,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:27,015 INFO L85 PathProgramCache]: Analyzing trace with hash 34814661, now seen corresponding path program 1 times [2024-11-09 14:49:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711016518] [2024-11-09 14:49:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:27,359 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-09 14:49:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:27,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711016518] [2024-11-09 14:49:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711016518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:27,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:49:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305558817] [2024-11-09 14:49:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:27,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:49:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:49:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:49:27,362 INFO L87 Difference]: Start difference. First operand 245 states and 352 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-09 14:49:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:27,460 INFO L93 Difference]: Finished difference Result 486 states and 700 transitions. [2024-11-09 14:49:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:49:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-09 14:49:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:27,463 INFO L225 Difference]: With dead ends: 486 [2024-11-09 14:49:27,464 INFO L226 Difference]: Without dead ends: 248 [2024-11-09 14:49:27,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:49:27,466 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 87 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:27,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1171 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:49:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-09 14:49:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2024-11-09 14:49:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 239 states have internal predecessors, (319), 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-09 14:49:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 345 transitions. [2024-11-09 14:49:27,487 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 345 transitions. Word has length 80 [2024-11-09 14:49:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:27,487 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 345 transitions. [2024-11-09 14:49:27,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-09 14:49:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 345 transitions. [2024-11-09 14:49:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 14:49:27,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:27,490 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] [2024-11-09 14:49:27,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 14:49:27,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 603954361, now seen corresponding path program 1 times [2024-11-09 14:49:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594813985] [2024-11-09 14:49:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:27,656 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-09 14:49:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594813985] [2024-11-09 14:49:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594813985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:49:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438138724] [2024-11-09 14:49:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:49:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:49:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:49:27,658 INFO L87 Difference]: Start difference. First operand 245 states and 345 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 14:49:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:27,701 INFO L93 Difference]: Finished difference Result 489 states and 692 transitions. [2024-11-09 14:49:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:49:27,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2024-11-09 14:49:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:27,703 INFO L225 Difference]: With dead ends: 489 [2024-11-09 14:49:27,703 INFO L226 Difference]: Without dead ends: 251 [2024-11-09 14:49:27,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 14:49:27,705 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:27,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:49:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-09 14:49:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-09 14:49:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 231 states have (on average 1.406926406926407) internal successors, (325), 245 states have internal predecessors, (325), 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-09 14:49:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 351 transitions. [2024-11-09 14:49:27,720 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 351 transitions. Word has length 80 [2024-11-09 14:49:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:27,720 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 351 transitions. [2024-11-09 14:49:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 14:49:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 351 transitions. [2024-11-09 14:49:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 14:49:27,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:27,727 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] [2024-11-09 14:49:27,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:49:27,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:27,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1085034619, now seen corresponding path program 1 times [2024-11-09 14:49:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772575574] [2024-11-09 14:49:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:27,837 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-09 14:49:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772575574] [2024-11-09 14:49:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772575574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:27,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:49:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347470621] [2024-11-09 14:49:27,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:27,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:49:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:49:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:49:27,840 INFO L87 Difference]: Start difference. First operand 251 states and 351 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 14:49:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:27,870 INFO L93 Difference]: Finished difference Result 628 states and 888 transitions. [2024-11-09 14:49:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:49:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2024-11-09 14:49:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:27,873 INFO L225 Difference]: With dead ends: 628 [2024-11-09 14:49:27,873 INFO L226 Difference]: Without dead ends: 384 [2024-11-09 14:49:27,874 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-09 14:49:27,876 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 134 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:27,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 670 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:49:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-09 14:49:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-09 14:49:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 364 states have (on average 1.4203296703296704) internal successors, (517), 378 states have internal predecessors, (517), 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-09 14:49:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 543 transitions. [2024-11-09 14:49:27,897 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 543 transitions. Word has length 80 [2024-11-09 14:49:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 543 transitions. [2024-11-09 14:49:27,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 14:49:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 543 transitions. [2024-11-09 14:49:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 14:49:27,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:27,901 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] [2024-11-09 14:49:27,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:49:27,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1820315274, now seen corresponding path program 1 times [2024-11-09 14:49:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79412835] [2024-11-09 14:49:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:49:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 14:49:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:28,126 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-09 14:49:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79412835] [2024-11-09 14:49:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79412835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:49:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469343851] [2024-11-09 14:49:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:28,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:49:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:49:28,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:49:28,130 INFO L87 Difference]: Start difference. First operand 384 states and 543 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-09 14:49:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:28,566 INFO L93 Difference]: Finished difference Result 453 states and 638 transitions. [2024-11-09 14:49:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:49:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 95 [2024-11-09 14:49:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:28,570 INFO L225 Difference]: With dead ends: 453 [2024-11-09 14:49:28,570 INFO L226 Difference]: Without dead ends: 451 [2024-11-09 14:49:28,571 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-09 14:49:28,574 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 192 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:28,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1223 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 14:49:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-09 14:49:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2024-11-09 14:49:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 425 states have (on average 1.4) internal successors, (595), 439 states have internal predecessors, (595), 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-09 14:49:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 627 transitions. [2024-11-09 14:49:28,590 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 627 transitions. Word has length 95 [2024-11-09 14:49:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:28,591 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 627 transitions. [2024-11-09 14:49:28,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-09 14:49:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 627 transitions. [2024-11-09 14:49:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 14:49:28,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:28,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:49:28,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 14:49:28,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 680877468, now seen corresponding path program 1 times [2024-11-09 14:49:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853286359] [2024-11-09 14:49:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:28,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:49:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 14:49:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 14:49:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853286359] [2024-11-09 14:49:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853286359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:49:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013962191] [2024-11-09 14:49:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:49:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:28,807 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-09 14:49:28,808 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-09 14:49:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:29,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:49:29,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:49:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 14:49:29,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:49:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 14:49:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013962191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:49:29,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:49:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 14:49:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238201149] [2024-11-09 14:49:29,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:49:29,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 14:49:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 14:49:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 14:49:29,284 INFO L87 Difference]: Start difference. First operand 448 states and 627 transitions. Second operand has 11 states, 11 states have (on average 24.09090909090909) internal successors, (265), 10 states have internal predecessors, (265), 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-09 14:49:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:29,592 INFO L93 Difference]: Finished difference Result 690 states and 981 transitions. [2024-11-09 14:49:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:49:29,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.09090909090909) internal successors, (265), 10 states have internal predecessors, (265), 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 100 [2024-11-09 14:49:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:29,595 INFO L225 Difference]: With dead ends: 690 [2024-11-09 14:49:29,595 INFO L226 Difference]: Without dead ends: 656 [2024-11-09 14:49:29,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 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-09 14:49:29,599 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 1060 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:29,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2260 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 14:49:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-09 14:49:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2024-11-09 14:49:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 627 states have (on average 1.3971291866028708) internal successors, (876), 641 states have internal predecessors, (876), 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-09 14:49:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 914 transitions. [2024-11-09 14:49:29,619 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 914 transitions. Word has length 100 [2024-11-09 14:49:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 914 transitions. [2024-11-09 14:49:29,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.09090909090909) internal successors, (265), 10 states have internal predecessors, (265), 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-09 14:49:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 914 transitions. [2024-11-09 14:49:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 14:49:29,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:29,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:49:29,635 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-09 14:49:29,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 14:49:29,821 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-09 14:49:29,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -388511669, now seen corresponding path program 1 times [2024-11-09 14:49:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516835441] [2024-11-09 14:49:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:49:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:30,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 14:49:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 14:49:30,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:30,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516835441] [2024-11-09 14:49:30,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516835441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:49:30,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167991900] [2024-11-09 14:49:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:49:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:30,199 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-09 14:49:30,200 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-09 14:49:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:30,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 14:49:30,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:49:30,466 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-09 14:49:30,490 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 21 treesize of output 20 [2024-11-09 14:49:31,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:49:31,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2024-11-09 14:49:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 14:49:31,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:49:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167991900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:49:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-09 14:49:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442402532] [2024-11-09 14:49:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:31,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 14:49:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 14:49:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 14:49:31,245 INFO L87 Difference]: Start difference. First operand 653 states and 914 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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-09 14:49:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:32,853 INFO L93 Difference]: Finished difference Result 1250 states and 1745 transitions. [2024-11-09 14:49:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:49:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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 101 [2024-11-09 14:49:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:32,856 INFO L225 Difference]: With dead ends: 1250 [2024-11-09 14:49:32,856 INFO L226 Difference]: Without dead ends: 690 [2024-11-09 14:49:32,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2024-11-09 14:49:32,858 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 541 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:49:32,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2177 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 14:49:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-09 14:49:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 685. [2024-11-09 14:49:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 659 states have (on average 1.385432473444613) internal successors, (913), 673 states have internal predecessors, (913), 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-09 14:49:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 951 transitions. [2024-11-09 14:49:32,873 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 951 transitions. Word has length 101 [2024-11-09 14:49:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:32,873 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 951 transitions. [2024-11-09 14:49:32,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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-09 14:49:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 951 transitions. [2024-11-09 14:49:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 14:49:32,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:32,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:49:32,891 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-09 14:49:33,074 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,SelfDestructingSolverStorable6 [2024-11-09 14:49:33,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 14:49:33,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1711298838, now seen corresponding path program 1 times [2024-11-09 14:49:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185500582] [2024-11-09 14:49:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:49:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:49:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 14:49:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185500582] [2024-11-09 14:49:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185500582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:49:33,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172928949] [2024-11-09 14:49:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:33,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:49:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:33,349 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-09 14:49:33,350 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-09 14:49:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:33,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 14:49:33,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:50:23,542 WARN L286 SmtUtils]: Spent 8.49s 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) [2024-11-09 14:50:47,595 WARN L286 SmtUtils]: Spent 6.47s 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-09 14:50:58,467 WARN L286 SmtUtils]: Spent 5.82s 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)