./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:55:37,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:55:37,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 21:55:37,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:55:37,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:55:37,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:55:37,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:55:37,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:55:37,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:55:37,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:55:37,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:55:37,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:55:37,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:55:37,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:55:37,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:55:37,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:55:37,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:55:37,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 21:55:37,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:55:37,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 21:55:37,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:55:37,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:55:37,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:55:37,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:55:37,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:55:37,949 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:55:37,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:55:37,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 21:55:37,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:55:37,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:55:37,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:55:37,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:55:37,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:55:37,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:55:37,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:55:37,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:55:37,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:55:37,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:55:37,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:55:37,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:55:37,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:55:37,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:55:37,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:55:37,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:55:37,954 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-10 21:55:38,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:55:38,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:55:38,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:55:38,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:55:38,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:55:38,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2024-11-10 21:55:39,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:55:39,763 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:55:39,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2024-11-10 21:55:39,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c848b6ab1/0222d9d3fb7446eba0f038dced10189b/FLAG608a52b43 [2024-11-10 21:55:39,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c848b6ab1/0222d9d3fb7446eba0f038dced10189b [2024-11-10 21:55:39,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:55:39,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:55:39,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:55:39,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:55:39,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:55:39,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:39" (1/1) ... [2024-11-10 21:55:39,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1d154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:39, skipping insertion in model container [2024-11-10 21:55:39,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:39" (1/1) ... [2024-11-10 21:55:39,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:55:40,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:55:40,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:55:40,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:55:40,333 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:55:40,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40 WrapperNode [2024-11-10 21:55:40,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:55:40,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:55:40,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:55:40,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:55:40,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,411 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-10 21:55:40,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:55:40,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:55:40,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:55:40,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:55:40,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,468 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-10 21:55:40,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:55:40,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:55:40,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:55:40,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:55:40,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (1/1) ... [2024-11-10 21:55:40,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:55:40,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:40,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 21:55:40,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 21:55:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:55:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:55:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:55:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:55:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 21:55:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 21:55:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 21:55:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 21:55:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:55:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:55:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:55:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:55:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:55:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:55:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:55:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:55:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:55:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:55:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:55:40,713 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:55:40,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:55:41,472 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2024-11-10 21:55:41,473 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:55:41,498 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:55:41,498 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 21:55:41,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:41 BoogieIcfgContainer [2024-11-10 21:55:41,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:55:41,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:55:41,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:55:41,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:55:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:55:39" (1/3) ... [2024-11-10 21:55:41,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe2fc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:41, skipping insertion in model container [2024-11-10 21:55:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:40" (2/3) ... [2024-11-10 21:55:41,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe2fc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:41, skipping insertion in model container [2024-11-10 21:55:41,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:41" (3/3) ... [2024-11-10 21:55:41,508 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-1.i [2024-11-10 21:55:41,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:55:41,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 21:55:41,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:55:41,571 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;@6d94e30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:55:41,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 21:55:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 218 states have (on average 1.5963302752293578) internal successors, (348), 224 states have internal predecessors, (348), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:55:41,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:41,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:41,581 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 21:55:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash -785339238, now seen corresponding path program 1 times [2024-11-10 21:55:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986060619] [2024-11-10 21:55:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:41,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986060619] [2024-11-10 21:55:41,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986060619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:41,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:41,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:55:41,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385531055] [2024-11-10 21:55:41,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:55:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:55:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:55:41,820 INFO L87 Difference]: Start difference. First operand has 229 states, 218 states have (on average 1.5963302752293578) internal successors, (348), 224 states have internal predecessors, (348), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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 21:55:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:41,905 INFO L93 Difference]: Finished difference Result 455 states and 705 transitions. [2024-11-10 21:55:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:55:41,909 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 21:55:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:41,917 INFO L225 Difference]: With dead ends: 455 [2024-11-10 21:55:41,917 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 21:55:41,921 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 21:55:41,923 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:41,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:55:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 21:55:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-10 21:55:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.4360189573459716) internal successors, (303), 216 states have internal predecessors, (303), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 309 transitions. [2024-11-10 21:55:41,967 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 309 transitions. Word has length 7 [2024-11-10 21:55:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:41,967 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 309 transitions. [2024-11-10 21:55:41,968 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 21:55:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 309 transitions. [2024-11-10 21:55:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:55:41,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:41,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:55:41,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:41,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -775367238, now seen corresponding path program 1 times [2024-11-10 21:55:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941229549] [2024-11-10 21:55:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941229549] [2024-11-10 21:55:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941229549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:42,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:42,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894745192] [2024-11-10 21:55:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:42,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:42,170 INFO L87 Difference]: Start difference. First operand 221 states and 309 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:42,244 INFO L93 Difference]: Finished difference Result 235 states and 327 transitions. [2024-11-10 21:55:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 21:55:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:42,246 INFO L225 Difference]: With dead ends: 235 [2024-11-10 21:55:42,246 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 21:55:42,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:42,248 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 10 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:42,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 561 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 21:55:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2024-11-10 21:55:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 216 states have (on average 1.4305555555555556) internal successors, (309), 221 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 315 transitions. [2024-11-10 21:55:42,261 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 315 transitions. Word has length 7 [2024-11-10 21:55:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:42,261 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 315 transitions. [2024-11-10 21:55:42,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 315 transitions. [2024-11-10 21:55:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:55:42,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:42,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:42,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:55:42,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:42,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1720798327, now seen corresponding path program 1 times [2024-11-10 21:55:42,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87483707] [2024-11-10 21:55:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87483707] [2024-11-10 21:55:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87483707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:42,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:42,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083333877] [2024-11-10 21:55:42,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:55:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:55:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:42,290 INFO L87 Difference]: Start difference. First operand 226 states and 315 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:42,365 INFO L93 Difference]: Finished difference Result 430 states and 606 transitions. [2024-11-10 21:55:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:55:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 21:55:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:42,368 INFO L225 Difference]: With dead ends: 430 [2024-11-10 21:55:42,368 INFO L226 Difference]: Without dead ends: 422 [2024-11-10 21:55:42,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:42,369 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 280 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:42,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 565 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-10 21:55:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 226. [2024-11-10 21:55:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 216 states have (on average 1.4259259259259258) internal successors, (308), 221 states have internal predecessors, (308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2024-11-10 21:55:42,383 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 8 [2024-11-10 21:55:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:42,383 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2024-11-10 21:55:42,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2024-11-10 21:55:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:55:42,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:42,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:42,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:55:42,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:42,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1733419740, now seen corresponding path program 1 times [2024-11-10 21:55:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850933350] [2024-11-10 21:55:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:42,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850933350] [2024-11-10 21:55:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850933350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416092212] [2024-11-10 21:55:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:42,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:42,497 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:42,549 INFO L93 Difference]: Finished difference Result 229 states and 317 transitions. [2024-11-10 21:55:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:42,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 21:55:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:42,550 INFO L225 Difference]: With dead ends: 229 [2024-11-10 21:55:42,550 INFO L226 Difference]: Without dead ends: 228 [2024-11-10 21:55:42,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:42,552 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 2 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:42,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 563 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:55:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-10 21:55:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2024-11-10 21:55:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 217 states have (on average 1.423963133640553) internal successors, (309), 222 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 315 transitions. [2024-11-10 21:55:42,570 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 315 transitions. Word has length 8 [2024-11-10 21:55:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:42,570 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 315 transitions. [2024-11-10 21:55:42,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 315 transitions. [2024-11-10 21:55:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:55:42,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:42,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:42,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:55:42,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:42,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1013080415, now seen corresponding path program 1 times [2024-11-10 21:55:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037048054] [2024-11-10 21:55:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037048054] [2024-11-10 21:55:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037048054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757498852] [2024-11-10 21:55:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:55:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:55:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:42,770 INFO L87 Difference]: Start difference. First operand 227 states and 315 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:42,909 INFO L93 Difference]: Finished difference Result 466 states and 652 transitions. [2024-11-10 21:55:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:55:42,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 21:55:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:42,911 INFO L225 Difference]: With dead ends: 466 [2024-11-10 21:55:42,911 INFO L226 Difference]: Without dead ends: 247 [2024-11-10 21:55:42,912 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 21:55:42,913 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 8 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 519 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 21:55:42,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 519 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-10 21:55:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-10 21:55:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 237 states have (on average 1.3881856540084387) internal successors, (329), 242 states have internal predecessors, (329), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 335 transitions. [2024-11-10 21:55:42,931 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 335 transitions. Word has length 83 [2024-11-10 21:55:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:42,932 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 335 transitions. [2024-11-10 21:55:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 335 transitions. [2024-11-10 21:55:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:55:42,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:42,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 21:55:42,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 917538690, now seen corresponding path program 1 times [2024-11-10 21:55:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700121125] [2024-11-10 21:55:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700121125] [2024-11-10 21:55:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700121125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138909995] [2024-11-10 21:55:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:43,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:43,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:43,177 INFO L87 Difference]: Start difference. First operand 247 states and 335 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:43,276 INFO L93 Difference]: Finished difference Result 472 states and 648 transitions. [2024-11-10 21:55:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 21:55:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:43,278 INFO L225 Difference]: With dead ends: 472 [2024-11-10 21:55:43,278 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 21:55:43,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:43,279 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 105 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 692 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 21:55:43,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 692 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 21:55:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-10 21:55:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 228 states have internal predecessors, (308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 314 transitions. [2024-11-10 21:55:43,292 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 314 transitions. Word has length 83 [2024-11-10 21:55:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:43,293 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 314 transitions. [2024-11-10 21:55:43,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 314 transitions. [2024-11-10 21:55:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:55:43,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:43,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:43,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 21:55:43,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:43,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -468405029, now seen corresponding path program 1 times [2024-11-10 21:55:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850228553] [2024-11-10 21:55:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850228553] [2024-11-10 21:55:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850228553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:43,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:43,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552108569] [2024-11-10 21:55:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:43,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:55:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:55:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:43,418 INFO L87 Difference]: Start difference. First operand 233 states and 314 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:43,492 INFO L93 Difference]: Finished difference Result 593 states and 815 transitions. [2024-11-10 21:55:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:55:43,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 21:55:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:43,495 INFO L225 Difference]: With dead ends: 593 [2024-11-10 21:55:43,495 INFO L226 Difference]: Without dead ends: 368 [2024-11-10 21:55:43,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:43,498 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 134 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 550 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 21:55:43,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 550 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-10 21:55:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-10 21:55:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 358 states have (on average 1.4022346368715084) internal successors, (502), 363 states have internal predecessors, (502), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:55:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 508 transitions. [2024-11-10 21:55:43,508 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 508 transitions. Word has length 83 [2024-11-10 21:55:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:43,509 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 508 transitions. [2024-11-10 21:55:43,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 508 transitions. [2024-11-10 21:55:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 21:55:43,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:43,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:43,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 21:55:43,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:43,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 161201784, now seen corresponding path program 1 times [2024-11-10 21:55:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:43,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631559347] [2024-11-10 21:55:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631559347] [2024-11-10 21:55:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631559347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609490461] [2024-11-10 21:55:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:43,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:55:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:55:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:43,756 INFO L87 Difference]: Start difference. First operand 368 states and 508 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:55:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:44,203 INFO L93 Difference]: Finished difference Result 439 states and 605 transitions. [2024-11-10 21:55:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:55:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-11-10 21:55:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:44,210 INFO L225 Difference]: With dead ends: 439 [2024-11-10 21:55:44,211 INFO L226 Difference]: Without dead ends: 437 [2024-11-10 21:55:44,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:44,211 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 191 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:44,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1145 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:55:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-10 21:55:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2024-11-10 21:55:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 425 states have internal predecessors, (581), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 21:55:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 593 transitions. [2024-11-10 21:55:44,225 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 593 transitions. Word has length 98 [2024-11-10 21:55:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:44,225 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 593 transitions. [2024-11-10 21:55:44,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:55:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 593 transitions. [2024-11-10 21:55:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 21:55:44,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:44,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:44,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 21:55:44,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:44,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -448896252, now seen corresponding path program 1 times [2024-11-10 21:55:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500074607] [2024-11-10 21:55:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:44,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500074607] [2024-11-10 21:55:44,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500074607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:44,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907512648] [2024-11-10 21:55:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:44,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:44,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:44,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 21:55:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:44,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 21:55:44,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:45,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:55:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907512648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:55:45,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:55:45,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 21:55:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059758306] [2024-11-10 21:55:45,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:55:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 21:55:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 21:55:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:55:45,417 INFO L87 Difference]: Start difference. First operand 433 states and 593 transitions. Second operand has 14 states, 13 states have (on average 15.615384615384615) internal successors, (203), 13 states have internal predecessors, (203), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:45,849 INFO L93 Difference]: Finished difference Result 885 states and 1231 transitions. [2024-11-10 21:55:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:55:45,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.615384615384615) internal successors, (203), 13 states have internal predecessors, (203), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 105 [2024-11-10 21:55:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:45,856 INFO L225 Difference]: With dead ends: 885 [2024-11-10 21:55:45,856 INFO L226 Difference]: Without dead ends: 884 [2024-11-10 21:55:45,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-10 21:55:45,856 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1187 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:45,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 2759 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:55:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-10 21:55:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 857. [2024-11-10 21:55:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 838 states have (on average 1.3866348448687351) internal successors, (1162), 843 states have internal predecessors, (1162), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 21:55:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1186 transitions. [2024-11-10 21:55:45,874 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1186 transitions. Word has length 105 [2024-11-10 21:55:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1186 transitions. [2024-11-10 21:55:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.615384615384615) internal successors, (203), 13 states have internal predecessors, (203), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1186 transitions. [2024-11-10 21:55:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 21:55:45,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:45,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:45,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 21:55:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:46,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:46,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1043502995, now seen corresponding path program 1 times [2024-11-10 21:55:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145690695] [2024-11-10 21:55:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:46,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 21:55:46,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:46,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145690695] [2024-11-10 21:55:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145690695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332633503] [2024-11-10 21:55:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:46,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:46,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:46,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:46,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 21:55:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:46,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:55:46,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:46,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:55:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332633503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:55:46,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:55:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 21:55:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150221110] [2024-11-10 21:55:46,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:55:46,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:55:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:55:46,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:55:46,756 INFO L87 Difference]: Start difference. First operand 857 states and 1186 transitions. Second operand has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:55:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:47,120 INFO L93 Difference]: Finished difference Result 870 states and 1209 transitions. [2024-11-10 21:55:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:55:47,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 106 [2024-11-10 21:55:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:47,124 INFO L225 Difference]: With dead ends: 870 [2024-11-10 21:55:47,125 INFO L226 Difference]: Without dead ends: 861 [2024-11-10 21:55:47,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:55:47,126 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 736 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:47,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 2342 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:55:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-10 21:55:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 857. [2024-11-10 21:55:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 838 states have (on average 1.3830548926014319) internal successors, (1159), 843 states have internal predecessors, (1159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 21:55:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1183 transitions. [2024-11-10 21:55:47,145 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1183 transitions. Word has length 106 [2024-11-10 21:55:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:47,146 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1183 transitions. [2024-11-10 21:55:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:55:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1183 transitions. [2024-11-10 21:55:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 21:55:47,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:47,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:47,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 21:55:47,351 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,SelfDestructingSolverStorable9 [2024-11-10 21:55:47,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:47,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1030881582, now seen corresponding path program 1 times [2024-11-10 21:55:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171320969] [2024-11-10 21:55:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171320969] [2024-11-10 21:55:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171320969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074630971] [2024-11-10 21:55:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:47,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:47,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 21:55:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:48,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 21:55:48,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:48,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:55:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074630971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:55:48,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:55:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 21:55:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266812300] [2024-11-10 21:55:48,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:55:48,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 21:55:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:48,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 21:55:48,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:55:48,391 INFO L87 Difference]: Start difference. First operand 857 states and 1183 transitions. Second operand has 14 states, 13 states have (on average 15.846153846153847) internal successors, (206), 13 states have internal predecessors, (206), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:49,228 INFO L93 Difference]: Finished difference Result 872 states and 1209 transitions. [2024-11-10 21:55:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:55:49,229 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.846153846153847) internal successors, (206), 13 states have internal predecessors, (206), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 106 [2024-11-10 21:55:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:49,232 INFO L225 Difference]: With dead ends: 872 [2024-11-10 21:55:49,232 INFO L226 Difference]: Without dead ends: 871 [2024-11-10 21:55:49,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-10 21:55:49,233 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 851 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:49,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 2108 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 21:55:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-10 21:55:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 858. [2024-11-10 21:55:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 839 states have (on average 1.3802145411203814) internal successors, (1158), 844 states have internal predecessors, (1158), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 21:55:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1182 transitions. [2024-11-10 21:55:49,249 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1182 transitions. Word has length 106 [2024-11-10 21:55:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:49,249 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1182 transitions. [2024-11-10 21:55:49,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.846153846153847) internal successors, (206), 13 states have internal predecessors, (206), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1182 transitions. [2024-11-10 21:55:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 21:55:49,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:49,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:49,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 21:55:49,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:49,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:49,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1063736101, now seen corresponding path program 1 times [2024-11-10 21:55:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273467335] [2024-11-10 21:55:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:49,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273467335] [2024-11-10 21:55:49,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273467335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440878483] [2024-11-10 21:55:49,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:49,781 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:49,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 21:55:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:50,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 21:55:50,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:50,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440878483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:50,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-10 21:55:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473826642] [2024-11-10 21:55:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:50,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:55:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:55:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 21:55:50,268 INFO L87 Difference]: Start difference. First operand 858 states and 1182 transitions. Second operand has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:55:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:50,382 INFO L93 Difference]: Finished difference Result 858 states and 1182 transitions. [2024-11-10 21:55:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:55:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 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 181 [2024-11-10 21:55:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:50,385 INFO L225 Difference]: With dead ends: 858 [2024-11-10 21:55:50,386 INFO L226 Difference]: Without dead ends: 857 [2024-11-10 21:55:50,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 21:55:50,386 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 429 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:50,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1228 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-10 21:55:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2024-11-10 21:55:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 839 states have (on average 1.3766388557806912) internal successors, (1155), 843 states have internal predecessors, (1155), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 21:55:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1179 transitions. [2024-11-10 21:55:50,405 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1179 transitions. Word has length 181 [2024-11-10 21:55:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:50,405 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1179 transitions. [2024-11-10 21:55:50,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:55:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1179 transitions. [2024-11-10 21:55:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-10 21:55:50,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:50,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:50,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 21:55:50,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:50,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:50,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash 836937128, now seen corresponding path program 1 times [2024-11-10 21:55:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:50,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514177259] [2024-11-10 21:55:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-10 21:55:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514177259] [2024-11-10 21:55:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514177259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:51,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234188296] [2024-11-10 21:55:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:51,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:55:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:55:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:51,031 INFO L87 Difference]: Start difference. First operand 857 states and 1179 transitions. Second operand has 5 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:55:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:51,215 INFO L93 Difference]: Finished difference Result 860 states and 1194 transitions. [2024-11-10 21:55:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:55:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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 265 [2024-11-10 21:55:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:51,218 INFO L225 Difference]: With dead ends: 860 [2024-11-10 21:55:51,218 INFO L226 Difference]: Without dead ends: 859 [2024-11-10 21:55:51,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:51,219 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 201 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:51,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 781 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:55:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-10 21:55:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2024-11-10 21:55:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 839 states have (on average 1.3742550655542312) internal successors, (1153), 842 states have internal predecessors, (1153), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 21:55:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1177 transitions. [2024-11-10 21:55:51,234 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1177 transitions. Word has length 265 [2024-11-10 21:55:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:51,234 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1177 transitions. [2024-11-10 21:55:51,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:55:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1177 transitions. [2024-11-10 21:55:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-10 21:55:51,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:51,237 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 21:55:51,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 21:55:51,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:51,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash -766849203, now seen corresponding path program 1 times [2024-11-10 21:55:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633341628] [2024-11-10 21:55:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 251 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:51,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633341628] [2024-11-10 21:55:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633341628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:51,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616796957] [2024-11-10 21:55:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:51,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:51,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 21:55:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:52,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 21:55:52,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 251 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:52,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:55:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 251 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616796957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:55:53,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:55:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-10 21:55:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945614060] [2024-11-10 21:55:53,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:55:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 21:55:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:53,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 21:55:53,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-10 21:55:53,071 INFO L87 Difference]: Start difference. First operand 856 states and 1177 transitions. Second operand has 19 states, 19 states have (on average 32.21052631578947) internal successors, (612), 18 states have internal predecessors, (612), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:55:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:53,660 INFO L93 Difference]: Finished difference Result 1494 states and 2079 transitions. [2024-11-10 21:55:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 21:55:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 32.21052631578947) internal successors, (612), 18 states have internal predecessors, (612), 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 272 [2024-11-10 21:55:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:53,670 INFO L225 Difference]: With dead ends: 1494 [2024-11-10 21:55:53,670 INFO L226 Difference]: Without dead ends: 1486 [2024-11-10 21:55:53,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-10 21:55:53,671 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 2741 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 3081 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:53,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 3081 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 21:55:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-10 21:55:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1479. [2024-11-10 21:55:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1453 states have (on average 1.377150722642808) internal successors, (2001), 1456 states have internal predecessors, (2001), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 21:55:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2043 transitions. [2024-11-10 21:55:53,715 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2043 transitions. Word has length 272 [2024-11-10 21:55:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:53,716 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2043 transitions. [2024-11-10 21:55:53,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 32.21052631578947) internal successors, (612), 18 states have internal predecessors, (612), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:55:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2043 transitions. [2024-11-10 21:55:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-10 21:55:53,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:53,726 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:53,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 21:55:53,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 21:55:53,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:53,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1317933207, now seen corresponding path program 1 times [2024-11-10 21:55:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369386260] [2024-11-10 21:55:53,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369386260] [2024-11-10 21:55:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369386260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:56,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009739510] [2024-11-10 21:55:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:56,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:56,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:56,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 21:55:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:56,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 21:55:56,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:57,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:55:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:55:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009739510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:55:57,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:55:57,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2024-11-10 21:55:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387295273] [2024-11-10 21:55:57,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:55:57,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 21:55:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:57,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 21:55:57,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2024-11-10 21:55:57,595 INFO L87 Difference]: Start difference. First operand 1479 states and 2043 transitions. Second operand has 29 states, 28 states have (on average 25.464285714285715) internal successors, (713), 28 states have internal predecessors, (713), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:58,409 INFO L93 Difference]: Finished difference Result 2133 states and 2983 transitions. [2024-11-10 21:55:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 21:55:58,409 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 25.464285714285715) internal successors, (713), 28 states have internal predecessors, (713), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 354 [2024-11-10 21:55:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:58,415 INFO L225 Difference]: With dead ends: 2133 [2024-11-10 21:55:58,415 INFO L226 Difference]: Without dead ends: 2132 [2024-11-10 21:55:58,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=782, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 21:55:58,416 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 4092 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:58,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4291 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:55:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2024-11-10 21:55:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2024-11-10 21:55:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 2074 states have (on average 1.3775313404050145) internal successors, (2857), 2077 states have internal predecessors, (2857), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 21:55:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2917 transitions. [2024-11-10 21:55:58,452 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2917 transitions. Word has length 354 [2024-11-10 21:55:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:58,452 INFO L471 AbstractCegarLoop]: Abstraction has 2109 states and 2917 transitions. [2024-11-10 21:55:58,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 25.464285714285715) internal successors, (713), 28 states have internal predecessors, (713), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2917 transitions. [2024-11-10 21:55:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-10 21:55:58,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:58,457 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:58,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 21:55:58,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 21:55:58,658 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:58,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2093743201, now seen corresponding path program 1 times [2024-11-10 21:55:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2326438] [2024-11-10 21:55:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2326438] [2024-11-10 21:56:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2326438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910652705] [2024-11-10 21:56:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:00,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:00,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:00,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:56:00,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 21:56:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:01,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 21:56:01,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:01,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:56:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910652705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:56:02,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:56:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2024-11-10 21:56:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917200313] [2024-11-10 21:56:02,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:56:02,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 21:56:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 21:56:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2024-11-10 21:56:02,002 INFO L87 Difference]: Start difference. First operand 2109 states and 2917 transitions. Second operand has 29 states, 28 states have (on average 25.571428571428573) internal successors, (716), 28 states have internal predecessors, (716), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:56:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:02,717 INFO L93 Difference]: Finished difference Result 2133 states and 2977 transitions. [2024-11-10 21:56:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 21:56:02,718 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 25.571428571428573) internal successors, (716), 28 states have internal predecessors, (716), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 355 [2024-11-10 21:56:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:02,724 INFO L225 Difference]: With dead ends: 2133 [2024-11-10 21:56:02,724 INFO L226 Difference]: Without dead ends: 2132 [2024-11-10 21:56:02,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=340, Invalid=782, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 21:56:02,725 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 3556 mSDsluCounter, 4283 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3602 SdHoareTripleChecker+Valid, 4634 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:02,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3602 Valid, 4634 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:56:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2024-11-10 21:56:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2110. [2024-11-10 21:56:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2075 states have (on average 1.3749397590361445) internal successors, (2853), 2078 states have internal predecessors, (2853), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 21:56:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2913 transitions. [2024-11-10 21:56:02,755 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2913 transitions. Word has length 355 [2024-11-10 21:56:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 2913 transitions. [2024-11-10 21:56:02,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 25.571428571428573) internal successors, (716), 28 states have internal predecessors, (716), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:56:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2913 transitions. [2024-11-10 21:56:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2024-11-10 21:56:02,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:02,762 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:02,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 21:56:02,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:02,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:02,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2062736115, now seen corresponding path program 2 times [2024-11-10 21:56:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:02,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595823869] [2024-11-10 21:56:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 0 proven. 1745 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595823869] [2024-11-10 21:56:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595823869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046934070] [2024-11-10 21:56:04,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:56:04,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:04,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:04,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:56:04,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 21:56:05,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 21:56:05,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:56:05,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 21:56:05,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 0 proven. 1745 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:05,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:56:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 0 proven. 1745 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:06,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046934070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:56:06,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:56:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 24 [2024-11-10 21:56:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145340913] [2024-11-10 21:56:06,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:56:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 21:56:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 21:56:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-11-10 21:56:06,509 INFO L87 Difference]: Start difference. First operand 2110 states and 2913 transitions. Second operand has 24 states, 24 states have (on average 35.958333333333336) internal successors, (863), 23 states have internal predecessors, (863), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:56:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:07,161 INFO L93 Difference]: Finished difference Result 2121 states and 2954 transitions. [2024-11-10 21:56:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 21:56:07,161 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 35.958333333333336) internal successors, (863), 23 states have internal predecessors, (863), 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 604 [2024-11-10 21:56:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:07,168 INFO L225 Difference]: With dead ends: 2121 [2024-11-10 21:56:07,168 INFO L226 Difference]: Without dead ends: 2113 [2024-11-10 21:56:07,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1227 GetRequests, 1194 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-11-10 21:56:07,169 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 5551 mSDsluCounter, 3773 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5603 SdHoareTripleChecker+Valid, 4167 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:07,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5603 Valid, 4167 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 21:56:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2024-11-10 21:56:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2110. [2024-11-10 21:56:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2075 states have (on average 1.3734939759036144) internal successors, (2850), 2078 states have internal predecessors, (2850), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 21:56:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2910 transitions. [2024-11-10 21:56:07,217 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2910 transitions. Word has length 604 [2024-11-10 21:56:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:07,220 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 2910 transitions. [2024-11-10 21:56:07,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 35.958333333333336) internal successors, (863), 23 states have internal predecessors, (863), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:56:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2910 transitions. [2024-11-10 21:56:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-10 21:56:07,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:07,231 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:07,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 21:56:07,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 21:56:07,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1873777353, now seen corresponding path program 2 times [2024-11-10 21:56:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012502508] [2024-11-10 21:56:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3771 backedges. 3036 proven. 731 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:10,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012502508] [2024-11-10 21:56:10,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012502508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17673333] [2024-11-10 21:56:10,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:56:10,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:10,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:56:10,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 21:56:11,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 21:56:11,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:56:11,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 3908 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 21:56:11,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3771 backedges. 3767 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:12,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:56:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17673333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:12,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:56:12,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [24] total 26 [2024-11-10 21:56:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988943205] [2024-11-10 21:56:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:12,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 21:56:12,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:12,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 21:56:12,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2024-11-10 21:56:12,327 INFO L87 Difference]: Start difference. First operand 2110 states and 2910 transitions. Second operand has 23 states, 23 states have (on average 36.73913043478261) internal successors, (845), 23 states have internal predecessors, (845), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:13,314 INFO L93 Difference]: Finished difference Result 2327 states and 3208 transitions. [2024-11-10 21:56:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 21:56:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 36.73913043478261) internal successors, (845), 23 states have internal predecessors, (845), 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 852 [2024-11-10 21:56:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:13,325 INFO L225 Difference]: With dead ends: 2327 [2024-11-10 21:56:13,325 INFO L226 Difference]: Without dead ends: 2104 [2024-11-10 21:56:13,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2024-11-10 21:56:13,327 INFO L432 NwaCegarLoop]: 2268 mSDtfsCounter, 2259 mSDsluCounter, 13518 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 15786 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:13,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 15786 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 21:56:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2024-11-10 21:56:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2104. [2024-11-10 21:56:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 2071 states have (on average 1.3727667793336553) internal successors, (2843), 2072 states have internal predecessors, (2843), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 21:56:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 2903 transitions. [2024-11-10 21:56:13,374 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 2903 transitions. Word has length 852 [2024-11-10 21:56:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 2104 states and 2903 transitions. [2024-11-10 21:56:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 36.73913043478261) internal successors, (845), 23 states have internal predecessors, (845), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2903 transitions. [2024-11-10 21:56:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2024-11-10 21:56:13,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:13,382 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:13,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 21:56:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 21:56:13,587 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:13,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2029823130, now seen corresponding path program 3 times [2024-11-10 21:56:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972228420] [2024-11-10 21:56:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 542 proven. 3 refuted. 0 times theorem prover too weak. 3196 trivial. 0 not checked. [2024-11-10 21:57:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972228420] [2024-11-10 21:57:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972228420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:57:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351542454] [2024-11-10 21:57:00,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 21:57:00,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:00,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:57:00,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:57:00,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 21:57:02,040 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 21:57:02,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:57:02,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 21:57:02,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:57:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2024-11-10 21:57:02,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:57:02,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351542454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:02,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:57:02,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-11-10 21:57:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799265316] [2024-11-10 21:57:02,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:02,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:57:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:57:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:57:02,138 INFO L87 Difference]: Start difference. First operand 2104 states and 2903 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:02,450 INFO L93 Difference]: Finished difference Result 4642 states and 6375 transitions. [2024-11-10 21:57:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:57:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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 853 [2024-11-10 21:57:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:02,457 INFO L225 Difference]: With dead ends: 4642 [2024-11-10 21:57:02,457 INFO L226 Difference]: Without dead ends: 2634 [2024-11-10 21:57:02,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:57:02,463 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 30 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:02,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1003 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:57:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-11-10 21:57:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2514. [2024-11-10 21:57:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2481 states have (on average 1.343409915356711) internal successors, (3333), 2482 states have internal predecessors, (3333), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 21:57:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3393 transitions. [2024-11-10 21:57:02,534 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3393 transitions. Word has length 853 [2024-11-10 21:57:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:02,534 INFO L471 AbstractCegarLoop]: Abstraction has 2514 states and 3393 transitions. [2024-11-10 21:57:02,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3393 transitions. [2024-11-10 21:57:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2024-11-10 21:57:02,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:02,545 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:02,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 21:57:02,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:02,746 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:02,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash -129899722, now seen corresponding path program 1 times [2024-11-10 21:57:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891797348] [2024-11-10 21:57:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:04,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 21:57:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 21:57:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 3433 trivial. 0 not checked. [2024-11-10 21:57:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891797348] [2024-11-10 21:57:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891797348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:57:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812395470] [2024-11-10 21:57:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:57:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:57:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:57:04,487 INFO L87 Difference]: Start difference. First operand 2514 states and 3393 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:05,002 INFO L93 Difference]: Finished difference Result 4903 states and 6656 transitions. [2024-11-10 21:57:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:57:05,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 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 863 [2024-11-10 21:57:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:05,017 INFO L225 Difference]: With dead ends: 4903 [2024-11-10 21:57:05,021 INFO L226 Difference]: Without dead ends: 2527 [2024-11-10 21:57:05,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:57:05,029 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 16 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:05,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1050 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 21:57:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2024-11-10 21:57:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2484. [2024-11-10 21:57:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 2451 states have (on average 1.339453284373725) internal successors, (3283), 2452 states have internal predecessors, (3283), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 21:57:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3343 transitions. [2024-11-10 21:57:05,087 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3343 transitions. Word has length 863 [2024-11-10 21:57:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:05,088 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3343 transitions. [2024-11-10 21:57:05,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3343 transitions. [2024-11-10 21:57:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2024-11-10 21:57:05,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:05,096 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:05,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 21:57:05,096 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:05,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1336764512, now seen corresponding path program 1 times [2024-11-10 21:57:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:05,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411071479] [2024-11-10 21:57:05,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:05,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 21:57:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 21:57:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2024-11-10 21:57:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411071479] [2024-11-10 21:57:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411071479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:06,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:57:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251178870] [2024-11-10 21:57:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:57:06,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:06,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:57:06,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:57:06,275 INFO L87 Difference]: Start difference. First operand 2484 states and 3343 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 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)