./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:17:46,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:17:46,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:17:46,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:17:46,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:17:46,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:17:46,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:17:46,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:17:46,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:17:46,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:17:46,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:17:46,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:17:46,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:17:46,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:17:46,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:17:46,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:17:46,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:17:46,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:17:46,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:17:46,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:17:46,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:17:46,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:17:46,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:17:46,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:17:46,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:17:46,978 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:17:46,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:17:46,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:17:46,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:17:46,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:17:46,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:17:46,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:17:46,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:17:46,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:17:46,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:46,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:17:46,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:17:46,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:17:46,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:17:46,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:17:46,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:17:46,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:17:46,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:17:46,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:17:46,985 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2024-10-14 21:17:47,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:17:47,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:17:47,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:17:47,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:17:47,281 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:17:47,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-10-14 21:17:48,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:17:48,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:17:48,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-10-14 21:17:49,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba7b4b73/8639689967004b2c9b9c5677516288d7/FLAG6aca45d3d [2024-10-14 21:17:49,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba7b4b73/8639689967004b2c9b9c5677516288d7 [2024-10-14 21:17:49,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:17:49,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:17:49,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:49,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:17:49,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:17:49,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea655bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49, skipping insertion in model container [2024-10-14 21:17:49,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:17:49,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:49,217 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:17:49,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:49,261 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:17:49,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49 WrapperNode [2024-10-14 21:17:49,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:49,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:49,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:17:49,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:17:49,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,298 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2024-10-14 21:17:49,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:49,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:17:49,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:17:49,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:17:49,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,345 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 5, 7]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 3]. [2024-10-14 21:17:49,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:17:49,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:17:49,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:17:49,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:17:49,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (1/1) ... [2024-10-14 21:17:49,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:49,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:49,442 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-10-14 21:17:49,445 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-10-14 21:17:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:17:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:17:49,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:17:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:17:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 21:17:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 21:17:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 21:17:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 21:17:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 21:17:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 21:17:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 21:17:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 21:17:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 21:17:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:17:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:17:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 21:17:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 21:17:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 21:17:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 21:17:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:17:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:17:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 21:17:49,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:17:49,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:17:49,827 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-14 21:17:49,827 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:17:49,872 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:17:49,872 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 21:17:49,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:49 BoogieIcfgContainer [2024-10-14 21:17:49,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:17:49,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:17:49,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:17:49,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:17:49,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:17:49" (1/3) ... [2024-10-14 21:17:49,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f561d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:49, skipping insertion in model container [2024-10-14 21:17:49,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:49" (2/3) ... [2024-10-14 21:17:49,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f561d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:49, skipping insertion in model container [2024-10-14 21:17:49,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:49" (3/3) ... [2024-10-14 21:17:49,880 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-10-14 21:17:49,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:17:49,894 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 21:17:49,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:17:49,944 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;@4a3dcd72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:17:49,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 21:17:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:17:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 21:17:49,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:49,954 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:49,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:49,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 718273684, now seen corresponding path program 1 times [2024-10-14 21:17:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:49,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092687904] [2024-10-14 21:17:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:50,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:50,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092687904] [2024-10-14 21:17:50,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092687904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:50,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:17:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340663241] [2024-10-14 21:17:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:50,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 21:17:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:50,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 21:17:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:17:50,176 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:17:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:50,204 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2024-10-14 21:17:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 21:17:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-14 21:17:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:50,211 INFO L225 Difference]: With dead ends: 90 [2024-10-14 21:17:50,212 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 21:17:50,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-10-14 21:17:50,218 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:50,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 21:17:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 21:17:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-14 21:17:50,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 25 [2024-10-14 21:17:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:50,247 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-14 21:17:50,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 21:17:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-14 21:17:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 21:17:50,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:50,248 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:17:50,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 674382928, now seen corresponding path program 1 times [2024-10-14 21:17:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:50,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720862569] [2024-10-14 21:17:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:50,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720862569] [2024-10-14 21:17:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720862569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:50,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:17:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858702717] [2024-10-14 21:17:50,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:50,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:17:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:17:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:17:50,403 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:50,430 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-10-14 21:17:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:17:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2024-10-14 21:17:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:50,431 INFO L225 Difference]: With dead ends: 39 [2024-10-14 21:17:50,431 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 21:17:50,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-10-14 21:17:50,433 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:50,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 41 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 21:17:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-10-14 21:17:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-14 21:17:50,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2024-10-14 21:17:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:50,440 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-14 21:17:50,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-14 21:17:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:17:50,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:50,441 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:17:50,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2114661064, now seen corresponding path program 1 times [2024-10-14 21:17:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286857137] [2024-10-14 21:17:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286857137] [2024-10-14 21:17:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286857137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458940931] [2024-10-14 21:17:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:50,556 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:50,620 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-14 21:17:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:50,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-10-14 21:17:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:50,621 INFO L225 Difference]: With dead ends: 41 [2024-10-14 21:17:50,622 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 21:17:50,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:50,623 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:50,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 21:17:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-14 21:17:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-10-14 21:17:50,633 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2024-10-14 21:17:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:50,633 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-10-14 21:17:50,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-10-14 21:17:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:17:50,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:50,635 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:50,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:17:50,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:50,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2114657011, now seen corresponding path program 1 times [2024-10-14 21:17:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856452863] [2024-10-14 21:17:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:50,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856452863] [2024-10-14 21:17:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856452863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:50,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:50,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:17:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990663034] [2024-10-14 21:17:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:50,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:17:50,796 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:50,861 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-10-14 21:17:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-10-14 21:17:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:50,866 INFO L225 Difference]: With dead ends: 39 [2024-10-14 21:17:50,866 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 21:17:50,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:17:50,896 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:50,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 21:17:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-14 21:17:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-14 21:17:50,903 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 29 [2024-10-14 21:17:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:50,903 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-14 21:17:50,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-14 21:17:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 21:17:50,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:50,905 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:50,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:17:50,905 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-10-14 21:17:50,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1129857820, now seen corresponding path program 1 times [2024-10-14 21:17:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350133472] [2024-10-14 21:17:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:50,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350133472] [2024-10-14 21:17:50,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350133472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:50,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:50,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:17:50,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031427751] [2024-10-14 21:17:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:50,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:50,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:50,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:17:50,996 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:51,044 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-14 21:17:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-10-14 21:17:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:51,045 INFO L225 Difference]: With dead ends: 43 [2024-10-14 21:17:51,045 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 21:17:51,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:17:51,046 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:51,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 21:17:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-14 21:17:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-14 21:17:51,055 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 30 [2024-10-14 21:17:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:51,057 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-14 21:17:51,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-14 21:17:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 21:17:51,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:51,058 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:51,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:17:51,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:51,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash 712627491, now seen corresponding path program 1 times [2024-10-14 21:17:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685064968] [2024-10-14 21:17:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:51,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685064968] [2024-10-14 21:17:51,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685064968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:51,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842266816] [2024-10-14 21:17:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:51,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:51,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:51,155 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-10-14 21:17:51,158 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-10-14 21:17:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:51,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:51,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842266816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:51,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:51,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 21:17:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799197410] [2024-10-14 21:17:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:51,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:17:51,302 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:51,346 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-14 21:17:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-14 21:17:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:51,347 INFO L225 Difference]: With dead ends: 41 [2024-10-14 21:17:51,351 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 21:17:51,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:17:51,352 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:51,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 43 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 21:17:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 21:17:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-14 21:17:51,360 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2024-10-14 21:17:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-14 21:17:51,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-14 21:17:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 21:17:51,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:51,366 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:51,390 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-10-14 21:17:51,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 21:17:51,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:51,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash 616615803, now seen corresponding path program 1 times [2024-10-14 21:17:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716795714] [2024-10-14 21:17:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716795714] [2024-10-14 21:17:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716795714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309239286] [2024-10-14 21:17:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:51,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:51,634 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-10-14 21:17:51,636 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-10-14 21:17:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:51,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:51,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:51,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:51,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309239286] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:51,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:51,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-14 21:17:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065112554] [2024-10-14 21:17:51,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:51,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:17:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:17:51,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:51,801 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:51,868 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-10-14 21:17:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:17:51,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-10-14 21:17:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:51,869 INFO L225 Difference]: With dead ends: 57 [2024-10-14 21:17:51,869 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 21:17:51,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:51,871 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:51,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 120 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 21:17:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-14 21:17:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-10-14 21:17:51,882 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 33 [2024-10-14 21:17:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:51,882 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-10-14 21:17:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-10-14 21:17:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 21:17:51,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:51,883 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:51,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:17:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 21:17:52,089 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-10-14 21:17:52,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1998112986, now seen corresponding path program 1 times [2024-10-14 21:17:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256308932] [2024-10-14 21:17:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256308932] [2024-10-14 21:17:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256308932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085550233] [2024-10-14 21:17:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:52,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:52,250 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-10-14 21:17:52,254 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-10-14 21:17:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:17:52,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:52,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:52,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085550233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:52,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:52,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-10-14 21:17:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368989201] [2024-10-14 21:17:52,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:52,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 21:17:52,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 21:17:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:17:52,438 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:52,584 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-10-14 21:17:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 21:17:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2024-10-14 21:17:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:52,586 INFO L225 Difference]: With dead ends: 66 [2024-10-14 21:17:52,586 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 21:17:52,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-10-14 21:17:52,587 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 66 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:52,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 119 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 21:17:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-10-14 21:17:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2024-10-14 21:17:52,597 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 34 [2024-10-14 21:17:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:52,598 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2024-10-14 21:17:52,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2024-10-14 21:17:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 21:17:52,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:52,599 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:52,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:17:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:52,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:52,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash 26334304, now seen corresponding path program 1 times [2024-10-14 21:17:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549222715] [2024-10-14 21:17:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549222715] [2024-10-14 21:17:52,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549222715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302925322] [2024-10-14 21:17:52,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:52,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:52,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:52,921 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-10-14 21:17:52,923 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-10-14 21:17:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:53,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:53,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:53,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302925322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:53,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:53,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-10-14 21:17:53,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295250050] [2024-10-14 21:17:53,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:53,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:53,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:53,071 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:53,119 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2024-10-14 21:17:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:17:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-14 21:17:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:53,120 INFO L225 Difference]: With dead ends: 106 [2024-10-14 21:17:53,120 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:17:53,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:53,121 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:53,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:17:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-14 21:17:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 63 states have internal predecessors, (74), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2024-10-14 21:17:53,132 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 36 [2024-10-14 21:17:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:53,133 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2024-10-14 21:17:53,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2024-10-14 21:17:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 21:17:53,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:53,136 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:53,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 21:17:53,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:53,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:53,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 487296982, now seen corresponding path program 1 times [2024-10-14 21:17:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678792824] [2024-10-14 21:17:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 21:17:53,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:53,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678792824] [2024-10-14 21:17:53,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678792824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:53,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366675901] [2024-10-14 21:17:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:53,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:53,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:53,445 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-10-14 21:17:53,446 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-10-14 21:17:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:53,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:17:53,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:53,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:53,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366675901] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:53,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:53,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 14 [2024-10-14 21:17:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165480120] [2024-10-14 21:17:53,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:53,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:17:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:53,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:17:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:17:53,681 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:54,018 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2024-10-14 21:17:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 21:17:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-14 21:17:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:54,020 INFO L225 Difference]: With dead ends: 129 [2024-10-14 21:17:54,020 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 21:17:54,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-10-14 21:17:54,021 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:54,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 153 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:17:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 21:17:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-14 21:17:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 84 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-10-14 21:17:54,033 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 40 [2024-10-14 21:17:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-10-14 21:17:54,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-10-14 21:17:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:17:54,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:54,034 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:54,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:17:54,237 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,SelfDestructingSolverStorable9 [2024-10-14 21:17:54,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:54,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1876596347, now seen corresponding path program 1 times [2024-10-14 21:17:54,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:54,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158210707] [2024-10-14 21:17:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 21:17:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158210707] [2024-10-14 21:17:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158210707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840717370] [2024-10-14 21:17:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:54,341 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-10-14 21:17:54,343 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-10-14 21:17:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:17:54,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 21:17:54,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 21:17:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840717370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:54,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:54,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-14 21:17:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286612802] [2024-10-14 21:17:54,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:54,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:17:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:17:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:17:54,612 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:54,811 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2024-10-14 21:17:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 21:17:54,812 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-14 21:17:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:54,813 INFO L225 Difference]: With dead ends: 111 [2024-10-14 21:17:54,813 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 21:17:54,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:17:54,815 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:54,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 104 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 21:17:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2024-10-14 21:17:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 91 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2024-10-14 21:17:54,829 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 45 [2024-10-14 21:17:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:54,829 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2024-10-14 21:17:54,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2024-10-14 21:17:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 21:17:54,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:54,830 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:54,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:17:55,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:55,031 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-10-14 21:17:55,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -911185220, now seen corresponding path program 2 times [2024-10-14 21:17:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517365285] [2024-10-14 21:17:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:55,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517365285] [2024-10-14 21:17:55,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517365285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:55,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994778416] [2024-10-14 21:17:55,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:17:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:55,205 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-10-14 21:17:55,206 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-10-14 21:17:55,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 21:17:55,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:17:55,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:55,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 21:17:55,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 21:17:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994778416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:55,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 17 [2024-10-14 21:17:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961657144] [2024-10-14 21:17:55,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 21:17:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 21:17:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-10-14 21:17:55,407 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 21:17:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,666 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2024-10-14 21:17:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 21:17:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2024-10-14 21:17:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,667 INFO L225 Difference]: With dead ends: 102 [2024-10-14 21:17:55,667 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 21:17:55,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 21:17:55,668 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 115 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 21:17:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2024-10-14 21:17:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 72 states have internal predecessors, (82), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-10-14 21:17:55,674 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 46 [2024-10-14 21:17:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,674 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-10-14 21:17:55,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 21:17:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-10-14 21:17:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 21:17:55,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,675 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:55,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:17:55,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:55,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:55,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1029941961, now seen corresponding path program 1 times [2024-10-14 21:17:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152719782] [2024-10-14 21:17:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152719782] [2024-10-14 21:17:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152719782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:55,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195767979] [2024-10-14 21:17:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:55,973 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:56,010 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-10-14 21:17:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:56,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-10-14 21:17:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:56,011 INFO L225 Difference]: With dead ends: 78 [2024-10-14 21:17:56,011 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 21:17:56,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:56,012 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:56,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 21:17:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 21:17:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-10-14 21:17:56,021 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 56 [2024-10-14 21:17:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:56,021 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-10-14 21:17:56,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-10-14 21:17:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 21:17:56,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:56,026 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:56,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 21:17:56,026 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:56,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1999823059, now seen corresponding path program 2 times [2024-10-14 21:17:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036468553] [2024-10-14 21:17:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 21:17:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036468553] [2024-10-14 21:17:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036468553] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597770245] [2024-10-14 21:17:56,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:17:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:56,316 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-10-14 21:17:56,318 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-10-14 21:17:56,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 21:17:56,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:17:56,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:56,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 21:17:56,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597770245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:56,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:56,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2024-10-14 21:17:56,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80093720] [2024-10-14 21:17:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:56,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:17:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:56,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:17:56,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-14 21:17:56,405 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:56,441 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-10-14 21:17:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2024-10-14 21:17:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:56,442 INFO L225 Difference]: With dead ends: 67 [2024-10-14 21:17:56,442 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 21:17:56,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-10-14 21:17:56,443 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:56,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 21:17:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 21:17:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-10-14 21:17:56,448 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 59 [2024-10-14 21:17:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:56,448 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-10-14 21:17:56,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-10-14 21:17:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 21:17:56,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:56,449 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:56,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:56,653 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,SelfDestructingSolverStorable13 [2024-10-14 21:17:56,654 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:56,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1185665509, now seen corresponding path program 1 times [2024-10-14 21:17:56,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489482622] [2024-10-14 21:17:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 52 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 21:17:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489482622] [2024-10-14 21:17:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489482622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609663722] [2024-10-14 21:17:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:56,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:56,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:56,840 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-10-14 21:17:56,841 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-10-14 21:17:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:17:56,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 21:17:57,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 21:17:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609663722] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:57,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2024-10-14 21:17:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912427617] [2024-10-14 21:17:57,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 21:17:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 21:17:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-14 21:17:57,142 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:57,305 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-10-14 21:17:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 21:17:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2024-10-14 21:17:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:57,307 INFO L225 Difference]: With dead ends: 141 [2024-10-14 21:17:57,307 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 21:17:57,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:17:57,308 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:57,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 21:17:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-10-14 21:17:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.0898876404494382) internal successors, (97), 89 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-10-14 21:17:57,313 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 67 [2024-10-14 21:17:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:57,313 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-10-14 21:17:57,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 21:17:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-10-14 21:17:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 21:17:57,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:57,314 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:57,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:17:57,515 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,SelfDestructingSolverStorable14 [2024-10-14 21:17:57,515 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 21:17:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash 16263087, now seen corresponding path program 2 times [2024-10-14 21:17:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:57,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853848945] [2024-10-14 21:17:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:57,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 21:17:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 21:17:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-14 21:17:57,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853848945] [2024-10-14 21:17:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853848945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225407870] [2024-10-14 21:17:57,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:17:57,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:57,632 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-10-14 21:17:57,636 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-10-14 21:17:57,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 21:17:57,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:17:57,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:57,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-14 21:17:57,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-14 21:17:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225407870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:57,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-14 21:17:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043694146] [2024-10-14 21:17:57,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:57,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 21:17:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:57,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 21:17:57,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:57,839 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 21:17:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:57,993 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2024-10-14 21:17:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:17:57,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-10-14 21:17:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:57,994 INFO L225 Difference]: With dead ends: 152 [2024-10-14 21:17:57,994 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:17:57,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-14 21:17:57,999 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 74 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-10-14 21:17:58,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 74 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:17:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:17:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10-14 21:17:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:17:58,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2024-10-14 21:17:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:58,007 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:17:58,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 21:17:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:17:58,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:17:58,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 21:17:58,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 21:17:58,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 21:17:58,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 21:17:58,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 21:17:58,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 21:17:58,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:58,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 21:17:58,217 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:58,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:17:58,605 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:17:58,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:17:58 BoogieIcfgContainer [2024-10-14 21:17:58,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:17:58,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:17:58,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:17:58,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:17:58,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:49" (3/4) ... [2024-10-14 21:17:58,629 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:17:58,632 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 21:17:58,632 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 21:17:58,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-14 21:17:58,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 21:17:58,636 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 21:17:58,636 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:17:58,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:17:58,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:17:58,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:17:58,720 INFO L158 Benchmark]: Toolchain (without parser) took 9702.72ms. Allocated memory was 186.6MB in the beginning and 327.2MB in the end (delta: 140.5MB). Free memory was 116.0MB in the beginning and 135.4MB in the end (delta: -19.4MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,720 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:17:58,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.66ms. Allocated memory is still 186.6MB. Free memory was 115.8MB in the beginning and 103.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.54ms. Allocated memory is still 186.6MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,721 INFO L158 Benchmark]: Boogie Preprocessor took 58.58ms. Allocated memory is still 186.6MB. Free memory was 101.7MB in the beginning and 155.4MB in the end (delta: -53.7MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,721 INFO L158 Benchmark]: RCFGBuilder took 514.53ms. Allocated memory is still 186.6MB. Free memory was 155.4MB in the beginning and 134.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,721 INFO L158 Benchmark]: TraceAbstraction took 8752.42ms. Allocated memory was 186.6MB in the beginning and 327.2MB in the end (delta: 140.5MB). Free memory was 133.5MB in the beginning and 140.6MB in the end (delta: -7.1MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,722 INFO L158 Benchmark]: Witness Printer took 92.75ms. Allocated memory is still 327.2MB. Free memory was 140.6MB in the beginning and 135.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:17:58,723 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.66ms. Allocated memory is still 186.6MB. Free memory was 115.8MB in the beginning and 103.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.54ms. Allocated memory is still 186.6MB. Free memory was 103.8MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.58ms. Allocated memory is still 186.6MB. Free memory was 101.7MB in the beginning and 155.4MB in the end (delta: -53.7MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.53ms. Allocated memory is still 186.6MB. Free memory was 155.4MB in the beginning and 134.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8752.42ms. Allocated memory was 186.6MB in the beginning and 327.2MB in the end (delta: 140.5MB). Free memory was 133.5MB in the beginning and 140.6MB in the end (delta: -7.1MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. * Witness Printer took 92.75ms. Allocated memory is still 327.2MB. Free memory was 140.6MB in the beginning and 135.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1326 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1029 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1485 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 297 mSDtfsCounter, 1485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 863 SyntacticMatches, 21 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 60 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1423 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1439 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 1446/1762 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((2 <= j) && (i <= 1)) && (n <= j)) && (j <= ((long long) i + 1))) || (((((n <= 2147483647) && (0 <= (j + 2147483648))) && (0 <= (i + 2147483648))) && (i <= 2147483646)) && (n <= 2147483647))) || (((((n <= 2147483647) && (0 <= (i + 2147483648))) && (i <= 2147483646)) && (n <= j)) && (j <= ((long long) i + 1)))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((n <= 2) && (i == 1)) || ((0 <= (i + 2147483648)) && (n <= i))) || (((n <= 2147483647) && (0 <= (i + 2147483648))) && (n <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:17:58,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE