./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.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_SFH_test1-2.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 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:01:33,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:01:33,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 22:01:33,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:01:33,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:01:33,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:01:33,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:01:33,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:01:33,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:01:33,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:01:33,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 22:01:33,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 22:01:33,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:01:33,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:01:33,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:01:33,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:01:33,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 22:01:33,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:01:33,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:01:33,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:01:33,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:01:33,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 22:01:33,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 22:01:33,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 22:01:33,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:01:33,986 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 22:01:33,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:01:33,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:01:33,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:01:33,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:01:33,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:01:33,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:01:33,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 22:01:33,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 22:01:33,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 22:01:33,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:01:33,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 22:01:33,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 22:01:33,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:01:33,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 22:01:33,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 22:01:33,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 22:01:33,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 22:01:33,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 22:01:33,990 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 -> 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed [2024-11-10 22:01:34,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:01:34,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:01:34,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:01:34,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:01:34,299 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:01:34,300 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-2.i [2024-11-10 22:01:35,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:01:36,064 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:01:36,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-10 22:01:36,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/636f08a1b/aea81cdbad12456f864bc320d30997e3/FLAG2430b8607 [2024-11-10 22:01:36,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/636f08a1b/aea81cdbad12456f864bc320d30997e3 [2024-11-10 22:01:36,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:01:36,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:01:36,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:01:36,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:01:36,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:01:36,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:36,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338c61d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36, skipping insertion in model container [2024-11-10 22:01:36,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:36,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:01:36,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:01:36,700 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:01:36,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:01:36,895 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:01:36,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36 WrapperNode [2024-11-10 22:01:36,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:01:36,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:01:36,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:01:36,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:01:36,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:36,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:36,992 INFO L138 Inliner]: procedures = 176, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 992 [2024-11-10 22:01:36,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:01:36,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:01:36,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:01:36,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:01:37,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,101 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-10 22:01:37,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:01:37,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:01:37,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:01:37,161 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:01:37,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (1/1) ... [2024-11-10 22:01:37,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 22:01:37,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:01:37,198 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 22:01:37,201 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 22:01:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:01:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:01:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 22:01:37,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 22:01:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:01:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:01:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 22:01:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 22:01:37,255 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 22:01:37,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 22:01:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 22:01:37,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:01:37,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:01:37,477 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:01:37,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:01:38,577 INFO L? ?]: Removed 238 outVars from TransFormulas that were not future-live. [2024-11-10 22:01:38,578 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:01:38,635 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:01:38,635 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 22:01:38,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:38 BoogieIcfgContainer [2024-11-10 22:01:38,635 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:01:38,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 22:01:38,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 22:01:38,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 22:01:38,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:01:36" (1/3) ... [2024-11-10 22:01:38,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae0023a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:38, skipping insertion in model container [2024-11-10 22:01:38,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:36" (2/3) ... [2024-11-10 22:01:38,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae0023a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:38, skipping insertion in model container [2024-11-10 22:01:38,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:38" (3/3) ... [2024-11-10 22:01:38,646 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-2.i [2024-11-10 22:01:38,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 22:01:38,701 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 22:01:38,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 22:01:38,830 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;@66351a7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 22:01:38,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 22:01:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 282 states have internal predecessors, (428), 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 22:01:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 22:01:38,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:38,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:01:38,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 22:01:38,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1150794998, now seen corresponding path program 1 times [2024-11-10 22:01:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:38,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041066645] [2024-11-10 22:01:38,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:38,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:39,010 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 22:01:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:39,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041066645] [2024-11-10 22:01:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041066645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:39,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:01:39,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:01:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308115129] [2024-11-10 22:01:39,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 22:01:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 22:01:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:01:39,051 INFO L87 Difference]: Start difference. First operand has 288 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 282 states have internal predecessors, (428), 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, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:01:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:39,152 INFO L93 Difference]: Finished difference Result 572 states and 915 transitions. [2024-11-10 22:01:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 22:01:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 22:01:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:39,166 INFO L225 Difference]: With dead ends: 572 [2024-11-10 22:01:39,167 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 22:01:39,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:01:39,174 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 22:01:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 22:01:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-10 22:01:39,227 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 22:01:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 353 transitions. [2024-11-10 22:01:39,231 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 353 transitions. Word has length 7 [2024-11-10 22:01:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:39,234 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 353 transitions. [2024-11-10 22:01:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:01:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 353 transitions. [2024-11-10 22:01:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 22:01:39,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:39,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:01:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 22:01:39,236 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 22:01:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1018395529, now seen corresponding path program 1 times [2024-11-10 22:01:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368231583] [2024-11-10 22:01:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:01:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368231583] [2024-11-10 22:01:39,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368231583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:39,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:01:39,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:01:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588888077] [2024-11-10 22:01:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:39,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:01:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:01:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:01:39,323 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 22:01:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:39,472 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2024-11-10 22:01:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:01:39,473 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 22:01:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:39,476 INFO L225 Difference]: With dead ends: 481 [2024-11-10 22:01:39,476 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 22:01:39,481 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 22:01:39,483 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 279 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:39,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 646 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 22:01:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 22:01:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 252. [2024-11-10 22:01:39,514 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 22:01:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 359 transitions. [2024-11-10 22:01:39,516 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 359 transitions. Word has length 8 [2024-11-10 22:01:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:39,517 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 359 transitions. [2024-11-10 22:01:39,517 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 22:01:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 359 transitions. [2024-11-10 22:01:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 22:01:39,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:39,521 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 22:01:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 22:01:39,522 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 22:01:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -512155375, now seen corresponding path program 1 times [2024-11-10 22:01:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869923433] [2024-11-10 22:01:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:39,904 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 22:01:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869923433] [2024-11-10 22:01:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869923433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:39,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:01:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:01:39,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733717120] [2024-11-10 22:01:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:39,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:01:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:01:39,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:01:39,910 INFO L87 Difference]: Start difference. First operand 252 states and 359 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 22:01:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:40,049 INFO L93 Difference]: Finished difference Result 516 states and 740 transitions. [2024-11-10 22:01:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:01:40,050 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 22:01:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:40,052 INFO L225 Difference]: With dead ends: 516 [2024-11-10 22:01:40,052 INFO L226 Difference]: Without dead ends: 272 [2024-11-10 22:01:40,054 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-10 22:01:40,056 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 8 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:40,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 607 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 22:01:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-10 22:01:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-10 22:01:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 252 states have (on average 1.4007936507936507) internal successors, (353), 266 states have internal predecessors, (353), 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 22:01:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 379 transitions. [2024-11-10 22:01:40,077 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 379 transitions. Word has length 83 [2024-11-10 22:01:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 379 transitions. [2024-11-10 22:01:40,077 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 22:01:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 379 transitions. [2024-11-10 22:01:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 22:01:40,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:40,080 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 22:01:40,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 22:01:40,081 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 22:01:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1418463730, now seen corresponding path program 1 times [2024-11-10 22:01:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377994823] [2024-11-10 22:01:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:40,369 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 22:01:40,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:40,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377994823] [2024-11-10 22:01:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377994823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:40,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:01:40,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:01:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140979018] [2024-11-10 22:01:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:40,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 22:01:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:01:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:01:40,372 INFO L87 Difference]: Start difference. First operand 272 states and 379 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 22:01:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:40,489 INFO L93 Difference]: Finished difference Result 522 states and 736 transitions. [2024-11-10 22:01:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:01:40,490 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 22:01:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:40,492 INFO L225 Difference]: With dead ends: 522 [2024-11-10 22:01:40,492 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 22:01:40,493 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 22:01:40,494 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 105 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:40,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 824 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 22:01:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 22:01:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-10 22:01:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 238 states have (on average 1.3949579831932772) internal successors, (332), 252 states have internal predecessors, (332), 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 22:01:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2024-11-10 22:01:40,507 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 83 [2024-11-10 22:01:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:40,508 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2024-11-10 22:01:40,508 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 22:01:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2024-11-10 22:01:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 22:01:40,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:40,514 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 22:01:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 22:01:40,514 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 22:01:40,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 32520011, now seen corresponding path program 1 times [2024-11-10 22:01:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803525820] [2024-11-10 22:01:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:40,693 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 22:01:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:40,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803525820] [2024-11-10 22:01:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803525820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:01:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:01:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914869756] [2024-11-10 22:01:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:40,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:01:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:40,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:01:40,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:01:40,698 INFO L87 Difference]: Start difference. First operand 258 states and 358 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 22:01:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:40,817 INFO L93 Difference]: Finished difference Result 643 states and 903 transitions. [2024-11-10 22:01:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:01:40,818 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 22:01:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:40,821 INFO L225 Difference]: With dead ends: 643 [2024-11-10 22:01:40,821 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 22:01:40,821 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 22:01:40,822 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 134 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:40,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 638 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 22:01:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 22:01:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 22:01:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 373 states have (on average 1.4101876675603218) internal successors, (526), 387 states have internal predecessors, (526), 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 22:01:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 552 transitions. [2024-11-10 22:01:40,835 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 552 transitions. Word has length 83 [2024-11-10 22:01:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:40,836 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 552 transitions. [2024-11-10 22:01:40,836 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 22:01:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 552 transitions. [2024-11-10 22:01:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 22:01:40,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:40,838 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 22:01:40,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 22:01:40,838 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 22:01:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1461205576, now seen corresponding path program 1 times [2024-11-10 22:01:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365346148] [2024-11-10 22:01:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 22:01:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 22:01:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:41,070 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 22:01:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365346148] [2024-11-10 22:01:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365346148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:01:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:01:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051742107] [2024-11-10 22:01:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 22:01:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:01:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 22:01:41,073 INFO L87 Difference]: Start difference. First operand 393 states and 552 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 22:01:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:41,423 INFO L93 Difference]: Finished difference Result 464 states and 649 transitions. [2024-11-10 22:01:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:01:41,424 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 22:01:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:41,426 INFO L225 Difference]: With dead ends: 464 [2024-11-10 22:01:41,427 INFO L226 Difference]: Without dead ends: 462 [2024-11-10 22:01:41,430 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 22:01:41,432 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 194 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:41,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1151 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 22:01:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-10 22:01:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2024-11-10 22:01:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 435 states have (on average 1.3908045977011494) internal successors, (605), 449 states have internal predecessors, (605), 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 22:01:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 637 transitions. [2024-11-10 22:01:41,457 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 637 transitions. Word has length 98 [2024-11-10 22:01:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:41,458 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 637 transitions. [2024-11-10 22:01:41,458 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 22:01:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 637 transitions. [2024-11-10 22:01:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 22:01:41,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:41,460 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 22:01:41,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 22:01:41,460 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 22:01:41,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1577490515, now seen corresponding path program 1 times [2024-11-10 22:01:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277597661] [2024-11-10 22:01:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 22:01:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 22:01:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:41,792 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 22:01:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277597661] [2024-11-10 22:01:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277597661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:01:41,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187968965] [2024-11-10 22:01:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:01:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:01:41,797 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 22:01:41,799 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 22:01:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:42,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:01:42,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:01:42,272 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 22:01:42,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:01:42,445 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 22:01:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187968965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:01:42,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:01:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 22:01:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908784884] [2024-11-10 22:01:42,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:01:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 22:01:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 22:01:42,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 22:01:42,450 INFO L87 Difference]: Start difference. First operand 458 states and 637 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 22:01:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:42,926 INFO L93 Difference]: Finished difference Result 708 states and 999 transitions. [2024-11-10 22:01:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 22:01:42,926 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 22:01:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:42,930 INFO L225 Difference]: With dead ends: 708 [2024-11-10 22:01:42,930 INFO L226 Difference]: Without dead ends: 673 [2024-11-10 22:01:42,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 22:01:42,931 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1297 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:42,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1734 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 22:01:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-10 22:01:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 670. [2024-11-10 22:01:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 644 states have (on average 1.3866459627329193) internal successors, (893), 658 states have internal predecessors, (893), 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 22:01:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 931 transitions. [2024-11-10 22:01:42,947 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 931 transitions. Word has length 106 [2024-11-10 22:01:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:42,947 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 931 transitions. [2024-11-10 22:01:42,948 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 22:01:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 931 transitions. [2024-11-10 22:01:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 22:01:42,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:42,949 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 22:01:42,968 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 22:01:43,149 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 22:01:43,150 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 22:01:43,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1564869102, now seen corresponding path program 1 times [2024-11-10 22:01:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826706926] [2024-11-10 22:01:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 22:01:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 22:01:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:43,602 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 22:01:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:43,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826706926] [2024-11-10 22:01:43,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826706926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:01:43,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185219322] [2024-11-10 22:01:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:43,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:01:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:01:43,605 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 22:01:43,606 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 22:01:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:43,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 22:01:43,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:01:43,953 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 22:01:43,980 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 22:01:44,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:01:44,544 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 22:01:45,115 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 22:01:45,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 22:01:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185219322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:01:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 22:01:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-10 22:01:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44071586] [2024-11-10 22:01:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:01:45,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 22:01:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:01:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 22:01:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-10 22:01:45,118 INFO L87 Difference]: Start difference. First operand 670 states and 931 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 22:01:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:01:46,603 INFO L93 Difference]: Finished difference Result 1282 states and 1777 transitions. [2024-11-10 22:01:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 22:01:46,604 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 22:01:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 22:01:46,607 INFO L225 Difference]: With dead ends: 1282 [2024-11-10 22:01:46,607 INFO L226 Difference]: Without dead ends: 708 [2024-11-10 22:01:46,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-10 22:01:46,609 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 547 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 22:01:46,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1609 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 22:01:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-10 22:01:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 703. [2024-11-10 22:01:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 677 states have (on average 1.3751846381093058) internal successors, (931), 691 states have internal predecessors, (931), 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 22:01:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 969 transitions. [2024-11-10 22:01:46,629 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 969 transitions. Word has length 106 [2024-11-10 22:01:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 22:01:46,629 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 969 transitions. [2024-11-10 22:01:46,630 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 22:01:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 969 transitions. [2024-11-10 22:01:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 22:01:46,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 22:01:46,631 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 22:01:46,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 22:01:46,831 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 22:01:46,832 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 22:01:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:01:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1991507609, now seen corresponding path program 1 times [2024-11-10 22:01:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:01:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316914462] [2024-11-10 22:01:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:01:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 22:01:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 22:01:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:47,226 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 22:01:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:01:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316914462] [2024-11-10 22:01:47,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316914462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:01:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810289640] [2024-11-10 22:01:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:01:47,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:01:47,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:01:47,229 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 22:01:47,231 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 22:01:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:01:47,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 22:01:47,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:02:12,051 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 22:02:12,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 22:02:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810289640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:02:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 22:02:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-10 22:02:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384231135] [2024-11-10 22:02:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:02:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 22:02:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:02:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 22:02:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=172, Unknown=5, NotChecked=0, Total=210 [2024-11-10 22:02:12,057 INFO L87 Difference]: Start difference. First operand 703 states and 969 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 22:02:16,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:17,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:20,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:21,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:23,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:25,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:27,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:29,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:31,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:33,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:35,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:37,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:40,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:42,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:44,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:46,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:50,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:52,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:54,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:57,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:02:59,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 22:03:03,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]