./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:22:37,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:22:38,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:22:38,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:22:38,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:22:38,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:22:38,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:22:38,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:22:38,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:22:38,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:22:38,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:22:38,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:22:38,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:22:38,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:22:38,065 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:22:38,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:22:38,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:22:38,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:22:38,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:22:38,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:22:38,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:22:38,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:22:38,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:22:38,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:22:38,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:22:38,069 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:22:38,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:22:38,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:22:38,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:22:38,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:22:38,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:22:38,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:22:38,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:22:38,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:22:38,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:38,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:22:38,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:22:38,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:22:38,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:22:38,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:22:38,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:22:38,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:22:38,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:22:38,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:22:38,077 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-clean/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-clean/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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2024-10-11 20:22:38,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:22:38,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:22:38,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:22:38,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:22:38,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:22:38,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-11 20:22:39,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:22:39,967 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:22:39,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-11 20:22:39,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/73c0bf873/5c0b4539b82f4c818fde6ca97059cdfc/FLAGa0deafddb [2024-10-11 20:22:39,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/73c0bf873/5c0b4539b82f4c818fde6ca97059cdfc [2024-10-11 20:22:40,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:22:40,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:22:40,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:40,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:22:40,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:22:40,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:39" (1/1) ... [2024-10-11 20:22:40,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eece7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40, skipping insertion in model container [2024-10-11 20:22:40,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:39" (1/1) ... [2024-10-11 20:22:40,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:22:40,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:40,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:22:40,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:40,578 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:22:40,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40 WrapperNode [2024-10-11 20:22:40,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:40,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:40,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:22:40,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:22:40,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,640 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 351 [2024-10-11 20:22:40,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:40,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:22:40,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:22:40,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:22:40,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,695 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2024-10-11 20:22:40,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:22:40,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:22:40,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:22:40,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:22:40,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (1/1) ... [2024-10-11 20:22:40,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:40,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:40,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:22:40,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:22:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:22:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:22:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:22:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:22:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:22:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:22:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:22:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:22:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:22:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:22:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-11 20:22:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-11 20:22:40,929 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:22:40,931 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:22:41,317 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-10-11 20:22:41,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:22:41,353 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:22:41,354 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 20:22:41,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:41 BoogieIcfgContainer [2024-10-11 20:22:41,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:22:41,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:22:41,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:22:41,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:22:41,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:22:39" (1/3) ... [2024-10-11 20:22:41,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea748a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:41, skipping insertion in model container [2024-10-11 20:22:41,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:40" (2/3) ... [2024-10-11 20:22:41,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea748a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:41, skipping insertion in model container [2024-10-11 20:22:41,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:41" (3/3) ... [2024-10-11 20:22:41,363 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2024-10-11 20:22:41,379 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:22:41,379 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:22:41,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:22:41,438 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;@79e31626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:22:41,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:22:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 58 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:22:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 20:22:41,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:41,453 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:41,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:41,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1896225196, now seen corresponding path program 1 times [2024-10-11 20:22:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228168083] [2024-10-11 20:22:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:22:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 20:22:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 20:22:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:22:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:22:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:22:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 20:22:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:22:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-11 20:22:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228168083] [2024-10-11 20:22:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228168083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:42,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:22:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835342038] [2024-10-11 20:22:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:22:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:22:42,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:22:42,395 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 58 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:22:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:42,563 INFO L93 Difference]: Finished difference Result 145 states and 239 transitions. [2024-10-11 20:22:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:22:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-11 20:22:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:42,575 INFO L225 Difference]: With dead ends: 145 [2024-10-11 20:22:42,575 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 20:22:42,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-11 20:22:42,583 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:42,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 20:22:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-11 20:22:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.5) internal successors, (75), 55 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:22:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-10-11 20:22:42,623 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 81 [2024-10-11 20:22:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:42,624 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-10-11 20:22:42,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:22:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-10-11 20:22:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 20:22:42,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:42,633 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:42,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:22:42,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 616565047, now seen corresponding path program 1 times [2024-10-11 20:22:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167059143] [2024-10-11 20:22:42,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-10-11 20:22:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167059143] [2024-10-11 20:22:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167059143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168579379] [2024-10-11 20:22:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:44,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:44,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:22:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:22:45,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-11 20:22:45,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168579379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-11 20:22:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392794573] [2024-10-11 20:22:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:45,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:45,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:45,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:45,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:45,290 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:45,332 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2024-10-11 20:22:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:45,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 20:22:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:45,334 INFO L225 Difference]: With dead ends: 71 [2024-10-11 20:22:45,334 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 20:22:45,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:45,336 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:45,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 20:22:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-11 20:22:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.48) internal successors, (74), 54 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:22:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-10-11 20:22:45,345 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 119 [2024-10-11 20:22:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:45,349 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-10-11 20:22:45,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-10-11 20:22:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 20:22:45,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:45,357 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:45,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:22:45,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:45,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:45,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1933647467, now seen corresponding path program 1 times [2024-10-11 20:22:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126275527] [2024-10-11 20:22:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:45,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-10-11 20:22:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126275527] [2024-10-11 20:22:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126275527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324371056] [2024-10-11 20:22:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:46,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:46,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:22:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:47,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 1785 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:22:47,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-11 20:22:47,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324371056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-11 20:22:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106087707] [2024-10-11 20:22:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:47,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:47,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:47,656 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:47,703 INFO L93 Difference]: Finished difference Result 92 states and 134 transitions. [2024-10-11 20:22:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 20:22:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:47,706 INFO L225 Difference]: With dead ends: 92 [2024-10-11 20:22:47,706 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 20:22:47,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:47,708 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:47,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 20:22:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-11 20:22:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 57 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:22:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-10-11 20:22:47,721 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 120 [2024-10-11 20:22:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:47,722 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-10-11 20:22:47,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-10-11 20:22:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 20:22:47,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:47,724 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:47,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:22:47,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:47,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:47,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:47,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1190631033, now seen corresponding path program 1 times [2024-10-11 20:22:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163389679] [2024-10-11 20:22:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:22:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163389679] [2024-10-11 20:22:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163389679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627611861] [2024-10-11 20:22:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:49,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:49,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:22:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:49,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 1799 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:22:49,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-11 20:22:50,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-11 20:22:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627611861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:50,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-10-11 20:22:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060726479] [2024-10-11 20:22:50,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:22:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:22:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:22:50,144 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-11 20:22:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:51,068 INFO L93 Difference]: Finished difference Result 185 states and 325 transitions. [2024-10-11 20:22:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 20:22:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 123 [2024-10-11 20:22:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:51,073 INFO L225 Difference]: With dead ends: 185 [2024-10-11 20:22:51,073 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:22:51,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:22:51,077 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:51,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 767 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:22:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:22:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2024-10-11 20:22:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.408450704225352) internal successors, (100), 77 states have internal predecessors, (100), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 175 transitions. [2024-10-11 20:22:51,125 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 175 transitions. Word has length 123 [2024-10-11 20:22:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:51,126 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 175 transitions. [2024-10-11 20:22:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-11 20:22:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 175 transitions. [2024-10-11 20:22:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 20:22:51,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:51,128 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:51,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:22:51,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:51,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1641488542, now seen corresponding path program 1 times [2024-10-11 20:22:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324402901] [2024-10-11 20:22:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-11 20:22:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324402901] [2024-10-11 20:22:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324402901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229699229] [2024-10-11 20:22:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:51,966 INFO L87 Difference]: Start difference. First operand 106 states and 175 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:52,047 INFO L93 Difference]: Finished difference Result 111 states and 180 transitions. [2024-10-11 20:22:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-10-11 20:22:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:52,050 INFO L225 Difference]: With dead ends: 111 [2024-10-11 20:22:52,050 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 20:22:52,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:52,051 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:52,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 20:22:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 20:22:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 80 states have internal predecessors, (103), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 178 transitions. [2024-10-11 20:22:52,075 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 178 transitions. Word has length 139 [2024-10-11 20:22:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:52,076 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 178 transitions. [2024-10-11 20:22:52,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 178 transitions. [2024-10-11 20:22:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 20:22:52,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:52,082 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:52,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:22:52,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:52,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash 912738875, now seen corresponding path program 1 times [2024-10-11 20:22:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413856103] [2024-10-11 20:22:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-11 20:22:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413856103] [2024-10-11 20:22:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413856103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:52,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:22:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12555410] [2024-10-11 20:22:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:52,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:52,598 INFO L87 Difference]: Start difference. First operand 109 states and 178 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:52,723 INFO L93 Difference]: Finished difference Result 133 states and 209 transitions. [2024-10-11 20:22:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-11 20:22:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:52,725 INFO L225 Difference]: With dead ends: 133 [2024-10-11 20:22:52,725 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:22:52,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:52,726 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:52,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 326 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:22:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-11 20:22:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.381578947368421) internal successors, (105), 82 states have internal predecessors, (105), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 180 transitions. [2024-10-11 20:22:52,745 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 180 transitions. Word has length 142 [2024-10-11 20:22:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:52,746 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 180 transitions. [2024-10-11 20:22:52,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 180 transitions. [2024-10-11 20:22:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 20:22:52,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:52,750 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:52,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:22:52,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:52,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash -367124803, now seen corresponding path program 1 times [2024-10-11 20:22:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350756359] [2024-10-11 20:22:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-11 20:22:53,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:53,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350756359] [2024-10-11 20:22:53,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350756359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:53,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:53,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:22:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355537813] [2024-10-11 20:22:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:53,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:53,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:53,265 INFO L87 Difference]: Start difference. First operand 111 states and 180 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:53,352 INFO L93 Difference]: Finished difference Result 137 states and 213 transitions. [2024-10-11 20:22:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-11 20:22:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:53,354 INFO L225 Difference]: With dead ends: 137 [2024-10-11 20:22:53,354 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:22:53,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:53,355 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:53,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:22:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 20:22:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 84 states have internal predecessors, (107), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 182 transitions. [2024-10-11 20:22:53,376 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 182 transitions. Word has length 142 [2024-10-11 20:22:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:53,376 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 182 transitions. [2024-10-11 20:22:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 182 transitions. [2024-10-11 20:22:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 20:22:53,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:53,381 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:22:53,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -953930817, now seen corresponding path program 1 times [2024-10-11 20:22:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570189980] [2024-10-11 20:22:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-11 20:22:53,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570189980] [2024-10-11 20:22:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570189980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:53,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:53,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:22:53,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736484344] [2024-10-11 20:22:53,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:53,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:53,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:53,945 INFO L87 Difference]: Start difference. First operand 113 states and 182 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:54,035 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2024-10-11 20:22:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:54,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-11 20:22:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:54,037 INFO L225 Difference]: With dead ends: 141 [2024-10-11 20:22:54,039 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 20:22:54,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:54,040 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:54,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 20:22:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 20:22:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.3625) internal successors, (109), 86 states have internal predecessors, (109), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 184 transitions. [2024-10-11 20:22:54,056 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 184 transitions. Word has length 142 [2024-10-11 20:22:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:54,056 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 184 transitions. [2024-10-11 20:22:54,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2024-10-11 20:22:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 20:22:54,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:54,059 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:54,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:22:54,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:54,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash -252866239, now seen corresponding path program 1 times [2024-10-11 20:22:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062433316] [2024-10-11 20:22:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-11 20:22:54,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062433316] [2024-10-11 20:22:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062433316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:22:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129809014] [2024-10-11 20:22:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:54,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:54,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:54,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:54,592 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:54,665 INFO L93 Difference]: Finished difference Result 145 states and 221 transitions. [2024-10-11 20:22:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:54,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-11 20:22:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:54,666 INFO L225 Difference]: With dead ends: 145 [2024-10-11 20:22:54,667 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:22:54,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:54,669 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:54,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 329 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:22:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 20:22:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.353658536585366) internal successors, (111), 88 states have internal predecessors, (111), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 186 transitions. [2024-10-11 20:22:54,681 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 186 transitions. Word has length 142 [2024-10-11 20:22:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:54,681 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 186 transitions. [2024-10-11 20:22:54,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 186 transitions. [2024-10-11 20:22:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 20:22:54,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:54,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:54,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:22:54,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 427192131, now seen corresponding path program 1 times [2024-10-11 20:22:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876777028] [2024-10-11 20:22:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:22:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876777028] [2024-10-11 20:22:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876777028] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538206578] [2024-10-11 20:22:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:55,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:55,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:55,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:22:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:56,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 1812 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:22:56,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:22:56,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:22:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538206578] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:56,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-11 20:22:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235082635] [2024-10-11 20:22:56,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:56,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:22:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:22:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:22:56,616 INFO L87 Difference]: Start difference. First operand 117 states and 186 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:56,733 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-10-11 20:22:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:22:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-10-11 20:22:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:56,735 INFO L225 Difference]: With dead ends: 155 [2024-10-11 20:22:56,736 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 20:22:56,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:22:56,737 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:56,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 20:22:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-11 20:22:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 97 states have internal predecessors, (120), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2024-10-11 20:22:56,747 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 142 [2024-10-11 20:22:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:56,747 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2024-10-11 20:22:56,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2024-10-11 20:22:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 20:22:56,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:56,749 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:56,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:22:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:22:56,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:56,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1625059787, now seen corresponding path program 2 times [2024-10-11 20:22:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774402245] [2024-10-11 20:22:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:22:57,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774402245] [2024-10-11 20:22:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774402245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:57,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102404691] [2024-10-11 20:22:57,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:22:57,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:57,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:57,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:57,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:22:58,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:22:58,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:58,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:22:58,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-10-11 20:22:58,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102404691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:58,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:58,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2024-10-11 20:22:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378674965] [2024-10-11 20:22:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:22:58,780 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:58,811 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2024-10-11 20:22:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:58,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 151 [2024-10-11 20:22:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:58,813 INFO L225 Difference]: With dead ends: 137 [2024-10-11 20:22:58,813 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 20:22:58,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:22:58,814 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:58,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 20:22:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-11 20:22:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 99 states have internal predecessors, (122), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:22:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 197 transitions. [2024-10-11 20:22:58,825 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 197 transitions. Word has length 151 [2024-10-11 20:22:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:58,825 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 197 transitions. [2024-10-11 20:22:58,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:22:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 197 transitions. [2024-10-11 20:22:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 20:22:58,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:58,827 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:58,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:22:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:22:59,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 448834859, now seen corresponding path program 1 times [2024-10-11 20:22:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583623044] [2024-10-11 20:22:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:22:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:22:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:22:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:22:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:22:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:22:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:22:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:22:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:22:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:22:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:22:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:22:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:22:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:22:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:22:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:22:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583623044] [2024-10-11 20:22:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583623044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164735633] [2024-10-11 20:22:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:59,887 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:59,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:23:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:00,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:23:00,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:23:01,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:23:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-11 20:23:01,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164735633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:23:01,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:23:01,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2024-10-11 20:23:01,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511323907] [2024-10-11 20:23:01,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:23:01,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:23:01,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:01,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:23:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:23:01,195 INFO L87 Difference]: Start difference. First operand 128 states and 197 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:23:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:01,316 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2024-10-11 20:23:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:23:01,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 151 [2024-10-11 20:23:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:01,318 INFO L225 Difference]: With dead ends: 162 [2024-10-11 20:23:01,318 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 20:23:01,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 318 SyntacticMatches, 11 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:23:01,319 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:01,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 20:23:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 20:23:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 102 states have internal predecessors, (125), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:23:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2024-10-11 20:23:01,334 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 151 [2024-10-11 20:23:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:01,334 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2024-10-11 20:23:01,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:23:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2024-10-11 20:23:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 20:23:01,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:01,337 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:01,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:23:01,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:23:01,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:23:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash -114093127, now seen corresponding path program 2 times [2024-10-11 20:23:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848888904] [2024-10-11 20:23:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:23:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:23:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:23:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:23:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:23:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:23:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:23:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:23:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:23:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:23:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:23:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:23:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:23:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:23:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:23:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-11 20:23:02,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:02,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848888904] [2024-10-11 20:23:02,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848888904] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:23:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446164078] [2024-10-11 20:23:02,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:23:02,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:02,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:02,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:23:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:23:03,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:23:03,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:23:03,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 1943 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:23:03,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-11 20:23:03,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:23:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446164078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:23:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:23:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940996410] [2024-10-11 20:23:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:03,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:23:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:23:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:23:03,685 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:23:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:03,714 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-11 20:23:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:23:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 154 [2024-10-11 20:23:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:03,716 INFO L225 Difference]: With dead ends: 131 [2024-10-11 20:23:03,716 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 20:23:03,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:23:03,717 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:03,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 360 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:23:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 20:23:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 20:23:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 101 states have internal predecessors, (124), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-10-11 20:23:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-11 20:23:03,725 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 154 [2024-10-11 20:23:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:03,725 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-11 20:23:03,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:23:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-11 20:23:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 20:23:03,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:03,727 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:03,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:23:03,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:03,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:23:03,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 758080620, now seen corresponding path program 1 times [2024-10-11 20:23:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011337765] [2024-10-11 20:23:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 20:23:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:23:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:23:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:23:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:23:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:23:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 20:23:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:23:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:23:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:23:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:23:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:23:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:23:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:23:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:23:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-11 20:23:04,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:04,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011337765] [2024-10-11 20:23:04,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011337765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:04,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:23:04,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:23:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626060365] [2024-10-11 20:23:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:23:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:23:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:23:04,358 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:23:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:04,435 INFO L93 Difference]: Finished difference Result 130 states and 199 transitions. [2024-10-11 20:23:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:23:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 155 [2024-10-11 20:23:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:04,436 INFO L225 Difference]: With dead ends: 130 [2024-10-11 20:23:04,437 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:23:04,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11 20:23:04,438 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:04,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:23:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:23:04,439 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-11 20:23:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:23:04,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2024-10-11 20:23:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:04,440 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:23:04,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 20:23:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:23:04,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:23:04,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:23:04,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:23:04,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:23:04,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:23:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:23:04,446 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:04,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:23:04,549 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:23:04,564 WARN L155 FloydHoareUtils]: Requires clause for append contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 20:23:04,569 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 20:23:04,570 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 20:23:04,570 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] [2024-10-11 20:23:04,570 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 20:23:04,570 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] [2024-10-11 20:23:04,570 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] [2024-10-11 20:23:04,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:23:04 BoogieIcfgContainer [2024-10-11 20:23:04,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:23:04,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:23:04,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:23:04,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:23:04,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:41" (3/4) ... [2024-10-11 20:23:04,573 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:23:04,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure append [2024-10-11 20:23:04,582 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-11 20:23:04,582 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:23:04,583 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:23:04,583 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:23:04,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:23:04,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:23:04,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:23:04,739 INFO L158 Benchmark]: Toolchain (without parser) took 24735.48ms. Allocated memory was 169.9MB in the beginning and 874.5MB in the end (delta: 704.6MB). Free memory was 98.1MB in the beginning and 818.0MB in the end (delta: -720.0MB). Peak memory consumption was 492.3MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,739 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 169.9MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:23:04,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.37ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 132.4MB in the end (delta: -34.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.46ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 129.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,740 INFO L158 Benchmark]: Boogie Preprocessor took 78.68ms. Allocated memory is still 169.9MB. Free memory was 129.0MB in the beginning and 124.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,740 INFO L158 Benchmark]: RCFGBuilder took 634.39ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 91.1MB in the end (delta: 32.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,740 INFO L158 Benchmark]: TraceAbstraction took 23213.33ms. Allocated memory was 169.9MB in the beginning and 874.5MB in the end (delta: 704.6MB). Free memory was 90.5MB in the beginning and 313.7MB in the end (delta: -223.2MB). Peak memory consumption was 483.1MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,740 INFO L158 Benchmark]: Witness Printer took 167.51ms. Allocated memory is still 874.5MB. Free memory was 313.7MB in the beginning and 818.0MB in the end (delta: -504.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:23:04,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 169.9MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.37ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 132.4MB in the end (delta: -34.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.46ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 129.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.68ms. Allocated memory is still 169.9MB. Free memory was 129.0MB in the beginning and 124.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 634.39ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 91.1MB in the end (delta: 32.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23213.33ms. Allocated memory was 169.9MB in the beginning and 874.5MB in the end (delta: 704.6MB). Free memory was 90.5MB in the beginning and 313.7MB in the end (delta: -223.2MB). Peak memory consumption was 483.1MB. Max. memory is 16.1GB. * Witness Printer took 167.51ms. Allocated memory is still 874.5MB. Free memory was 313.7MB in the beginning and 818.0MB in the end (delta: -504.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] * 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: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: 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 2 procedures, 73 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 5279 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4003 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 1276 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1866 GetRequests, 1750 SyntacticMatches, 11 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=12, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2753 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3255 ConstructedInterpolants, 0 QuantifiedInterpolants, 8781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11361 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 12326/12813 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 4 specifications checked. All of them hold - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((0 <= counter) && (counter <= 2147483646)) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (0 < (2147483649 + counter)) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 591]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 20:23:04,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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