./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96b71e4fe20331af08d1b5394215c6ca1c246124118142d0900823a256b0e31d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:45:12,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:45:12,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:45:12,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:45:12,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:45:12,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:45:12,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:45:12,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:45:12,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:45:12,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:45:12,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:45:12,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:45:12,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:45:12,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:45:12,982 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:45:12,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:45:12,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:45:12,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:45:12,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:45:12,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:45:12,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:45:12,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:45:12,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:45:12,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:45:12,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:45:12,988 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:45:12,988 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:45:12,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:45:12,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:45:12,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:45:12,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:45:12,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:45:12,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:45:12,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:45:12,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:45:12,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:45:12,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:45:12,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:45:12,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:45:12,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:45:12,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:45:12,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:45:12,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:45:12,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:45:12,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96b71e4fe20331af08d1b5394215c6ca1c246124118142d0900823a256b0e31d [2024-11-09 11:45:13,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:45:13,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:45:13,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:45:13,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:45:13,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:45:13,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2024-11-09 11:45:14,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:45:14,791 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:45:14,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2024-11-09 11:45:14,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973b777ac/e88a84dde73e49609c67667349b4485f/FLAGb3cf88b7a [2024-11-09 11:45:14,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973b777ac/e88a84dde73e49609c67667349b4485f [2024-11-09 11:45:14,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:45:14,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:45:14,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:45:14,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:45:14,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:45:14,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:45:14" (1/1) ... [2024-11-09 11:45:14,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8589b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:14, skipping insertion in model container [2024-11-09 11:45:14,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:45:14" (1/1) ... [2024-11-09 11:45:14,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:45:15,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:45:15,098 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:45:15,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:45:15,150 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:45:15,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15 WrapperNode [2024-11-09 11:45:15,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:45:15,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:45:15,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:45:15,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:45:15,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,180 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2024-11-09 11:45:15,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:45:15,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:45:15,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:45:15,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:45:15,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,206 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:45:15,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:45:15,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:45:15,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:45:15,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:45:15,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (1/1) ... [2024-11-09 11:45:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:45:15,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:15,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:45:15,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:45:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:45:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:45:15,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:45:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:45:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:45:15,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:45:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:45:15,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:45:15,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:45:15,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:45:15,732 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-09 11:45:15,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:45:15,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:45:15,752 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:45:15,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:45:15 BoogieIcfgContainer [2024-11-09 11:45:15,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:45:15,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:45:15,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:45:15,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:45:15,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:45:14" (1/3) ... [2024-11-09 11:45:15,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2079a6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:45:15, skipping insertion in model container [2024-11-09 11:45:15,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:45:15" (2/3) ... [2024-11-09 11:45:15,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2079a6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:45:15, skipping insertion in model container [2024-11-09 11:45:15,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:45:15" (3/3) ... [2024-11-09 11:45:15,763 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound10.c [2024-11-09 11:45:15,777 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:45:15,778 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-11-09 11:45:15,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:45:15,852 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;@69b4c687, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:45:15,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-09 11:45:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 133 states have internal predecessors, (139), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:45:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 11:45:15,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:15,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 11:45:15,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:15,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2024-11-09 11:45:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876728226] [2024-11-09 11:45:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:45:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876728226] [2024-11-09 11:45:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876728226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415510982] [2024-11-09 11:45:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:16,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:16,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,062 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 133 states have internal predecessors, (139), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:16,121 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2024-11-09 11:45:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:16,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 11:45:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:16,134 INFO L225 Difference]: With dead ends: 257 [2024-11-09 11:45:16,134 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 11:45:16,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,139 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:16,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 11:45:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 11:45:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.7142857142857142) internal successors, (120), 117 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2024-11-09 11:45:16,178 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 3 [2024-11-09 11:45:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:16,178 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2024-11-09 11:45:16,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2024-11-09 11:45:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:45:16,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:16,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:45:16,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:45:16,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2024-11-09 11:45:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501353375] [2024-11-09 11:45:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:45:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501353375] [2024-11-09 11:45:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501353375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:16,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014334600] [2024-11-09 11:45:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:16,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,208 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:16,257 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2024-11-09 11:45:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:16,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 11:45:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:16,259 INFO L225 Difference]: With dead ends: 123 [2024-11-09 11:45:16,259 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 11:45:16,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,261 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:16,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 11:45:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 11:45:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 113 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2024-11-09 11:45:16,270 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 4 [2024-11-09 11:45:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:16,271 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2024-11-09 11:45:16,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2024-11-09 11:45:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:45:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:16,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:16,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:45:16,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:16,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2024-11-09 11:45:16,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908094175] [2024-11-09 11:45:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:16,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965552372] [2024-11-09 11:45:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:16,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:16,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:16,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:16,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:45:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:16,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:45:16,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:45:16,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908094175] [2024-11-09 11:45:16,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965552372] [2024-11-09 11:45:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965552372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398428559] [2024-11-09 11:45:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:16,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,394 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:16,423 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2024-11-09 11:45:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 11:45:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:16,425 INFO L225 Difference]: With dead ends: 119 [2024-11-09 11:45:16,425 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 11:45:16,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,426 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:16,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 205 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 11:45:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 11:45:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 111 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2024-11-09 11:45:16,438 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 8 [2024-11-09 11:45:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:16,439 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2024-11-09 11:45:16,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:45:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-09 11:45:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:45:16,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:16,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:16,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:45:16,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:16,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:16,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1367701482, now seen corresponding path program 1 times [2024-11-09 11:45:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:16,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284823610] [2024-11-09 11:45:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:16,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982430443] [2024-11-09 11:45:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:16,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:16,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:16,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:16,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:45:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:16,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:45:16,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:16,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284823610] [2024-11-09 11:45:16,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982430443] [2024-11-09 11:45:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982430443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677388228] [2024-11-09 11:45:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,765 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:16,823 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2024-11-09 11:45:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-09 11:45:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:16,829 INFO L225 Difference]: With dead ends: 117 [2024-11-09 11:45:16,829 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 11:45:16,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:16,830 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 86 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:16,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 114 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 11:45:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 11:45:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.6) internal successors, (112), 109 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2024-11-09 11:45:16,842 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 25 [2024-11-09 11:45:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2024-11-09 11:45:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2024-11-09 11:45:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:45:16,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:16,844 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:16,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:45:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 11:45:17,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -550926956, now seen corresponding path program 1 times [2024-11-09 11:45:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708097000] [2024-11-09 11:45:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:17,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:17,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708097000] [2024-11-09 11:45:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708097000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907084867] [2024-11-09 11:45:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:17,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:17,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:17,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:17,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:45:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:17,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:45:17,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:17,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907084867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:17,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:45:17,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:45:17,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433538142] [2024-11-09 11:45:17,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:17,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:45:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:17,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:45:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:45:17,661 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:17,743 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2024-11-09 11:45:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:45:17,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 11:45:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:17,744 INFO L225 Difference]: With dead ends: 115 [2024-11-09 11:45:17,744 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 11:45:17,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:45:17,745 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 389 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-11-09 11:45:17,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 389 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 11:45:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 11:45:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 107 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2024-11-09 11:45:17,751 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 26 [2024-11-09 11:45:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:17,751 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2024-11-09 11:45:17,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2024-11-09 11:45:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 11:45:17,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:17,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:17,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:45:17,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:17,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:17,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1159825162, now seen corresponding path program 1 times [2024-11-09 11:45:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862311234] [2024-11-09 11:45:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:18,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862311234] [2024-11-09 11:45:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862311234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84062074] [2024-11-09 11:45:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:18,032 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:18,050 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2024-11-09 11:45:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 11:45:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:18,052 INFO L225 Difference]: With dead ends: 113 [2024-11-09 11:45:18,052 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 11:45:18,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:18,053 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:18,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 217 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 11:45:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 11:45:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2024-11-09 11:45:18,060 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 28 [2024-11-09 11:45:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:18,060 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2024-11-09 11:45:18,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2024-11-09 11:45:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:45:18,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:18,061 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:18,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:45:18,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:18,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1594841583, now seen corresponding path program 1 times [2024-11-09 11:45:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:18,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480421744] [2024-11-09 11:45:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:18,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480421744] [2024-11-09 11:45:18,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480421744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:18,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725796324] [2024-11-09 11:45:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:18,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:18,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:18,113 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:18,137 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2024-11-09 11:45:18,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:18,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 11:45:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:18,138 INFO L225 Difference]: With dead ends: 145 [2024-11-09 11:45:18,138 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 11:45:18,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:18,139 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:18,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 11:45:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 11:45:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.527027027027027) internal successors, (113), 110 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2024-11-09 11:45:18,147 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 29 [2024-11-09 11:45:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:18,147 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2024-11-09 11:45:18,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2024-11-09 11:45:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:45:18,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:18,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:45:18,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:18,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 660565843, now seen corresponding path program 1 times [2024-11-09 11:45:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778791832] [2024-11-09 11:45:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778791832] [2024-11-09 11:45:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778791832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:18,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:18,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144872505] [2024-11-09 11:45:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:18,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:18,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:18,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:18,246 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:18,284 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2024-11-09 11:45:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 11:45:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:18,287 INFO L225 Difference]: With dead ends: 118 [2024-11-09 11:45:18,287 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 11:45:18,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:18,288 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:18,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 159 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 11:45:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 11:45:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 75 states have (on average 1.52) internal successors, (114), 111 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2024-11-09 11:45:18,304 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 31 [2024-11-09 11:45:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:18,304 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2024-11-09 11:45:18,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-09 11:45:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:45:18,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:18,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:18,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:45:18,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:18,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash -997295267, now seen corresponding path program 1 times [2024-11-09 11:45:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:18,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866989696] [2024-11-09 11:45:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866989696] [2024-11-09 11:45:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866989696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239759916] [2024-11-09 11:45:18,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:18,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:18,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:18,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:18,365 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:18,434 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2024-11-09 11:45:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:18,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-09 11:45:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:18,435 INFO L225 Difference]: With dead ends: 119 [2024-11-09 11:45:18,435 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 11:45:18,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-09 11:45:18,436 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:18,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 214 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 11:45:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 11:45:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.513157894736842) internal successors, (115), 112 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2024-11-09 11:45:18,445 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 32 [2024-11-09 11:45:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:18,445 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2024-11-09 11:45:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2024-11-09 11:45:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:45:18,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:18,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:45:18,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash -851382123, now seen corresponding path program 1 times [2024-11-09 11:45:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891910683] [2024-11-09 11:45:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396981100] [2024-11-09 11:45:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:18,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:18,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:45:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:45:18,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:18,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:18,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891910683] [2024-11-09 11:45:18,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396981100] [2024-11-09 11:45:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396981100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629750737] [2024-11-09 11:45:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:18,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:18,560 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:18,608 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2024-11-09 11:45:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-09 11:45:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:18,609 INFO L225 Difference]: With dead ends: 154 [2024-11-09 11:45:18,609 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 11:45:18,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:18,610 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:18,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 188 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 11:45:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2024-11-09 11:45:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 113 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2024-11-09 11:45:18,616 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 33 [2024-11-09 11:45:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:18,617 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2024-11-09 11:45:18,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2024-11-09 11:45:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 11:45:18,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:18,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:18,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:45:18,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:18,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash -623041953, now seen corresponding path program 1 times [2024-11-09 11:45:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795209442] [2024-11-09 11:45:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:18,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795209442] [2024-11-09 11:45:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795209442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:18,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609359211] [2024-11-09 11:45:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:18,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:18,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:18,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:18,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:45:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:19,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:45:19,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:19,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609359211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:19,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:19,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 11:45:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734846854] [2024-11-09 11:45:19,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:19,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:45:19,358 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:19,561 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2024-11-09 11:45:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:45:19,561 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-09 11:45:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:19,563 INFO L225 Difference]: With dead ends: 154 [2024-11-09 11:45:19,563 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 11:45:19,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:45:19,564 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 217 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:19,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 573 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:45:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 11:45:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2024-11-09 11:45:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.5) internal successors, (117), 114 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:45:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2024-11-09 11:45:19,571 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 34 [2024-11-09 11:45:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:19,571 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2024-11-09 11:45:19,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2024-11-09 11:45:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:45:19,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:19,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:19,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:45:19,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 11:45:19,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:19,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1742859935, now seen corresponding path program 1 times [2024-11-09 11:45:19,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:19,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760323604] [2024-11-09 11:45:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:19,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:19,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075094371] [2024-11-09 11:45:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:19,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:19,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:45:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:19,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:45:19,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:45:20,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:20,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760323604] [2024-11-09 11:45:20,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075094371] [2024-11-09 11:45:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075094371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:20,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:45:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-09 11:45:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447865885] [2024-11-09 11:45:20,093 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:20,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:45:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:20,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:45:20,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:45:20,095 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:45:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:21,275 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2024-11-09 11:45:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:45:21,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-09 11:45:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:21,276 INFO L225 Difference]: With dead ends: 198 [2024-11-09 11:45:21,276 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:45:21,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:45:21,278 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 217 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:21,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 303 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 11:45:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:45:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2024-11-09 11:45:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.512) internal successors, (189), 161 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:45:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2024-11-09 11:45:21,287 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 36 [2024-11-09 11:45:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:21,288 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2024-11-09 11:45:21,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:45:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2024-11-09 11:45:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 11:45:21,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:21,289 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:21,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:45:21,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:21,494 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:21,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 148850787, now seen corresponding path program 1 times [2024-11-09 11:45:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311647852] [2024-11-09 11:45:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:45:21,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356772610] [2024-11-09 11:45:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:21,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:21,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:21,508 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:21,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:45:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:21,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:45:21,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:21,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:45:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311647852] [2024-11-09 11:45:21,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:45:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356772610] [2024-11-09 11:45:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356772610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:45:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100906030] [2024-11-09 11:45:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:45:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:45:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:21,573 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:21,659 INFO L93 Difference]: Finished difference Result 286 states and 346 transitions. [2024-11-09 11:45:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:45:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-09 11:45:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:21,661 INFO L225 Difference]: With dead ends: 286 [2024-11-09 11:45:21,661 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 11:45:21,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:45:21,662 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:21,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 11:45:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2024-11-09 11:45:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.4795918367346939) internal successors, (290), 232 states have internal predecessors, (290), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 302 transitions. [2024-11-09 11:45:21,671 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 302 transitions. Word has length 38 [2024-11-09 11:45:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:21,672 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 302 transitions. [2024-11-09 11:45:21,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:45:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 302 transitions. [2024-11-09 11:45:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 11:45:21,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:21,672 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:21,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:45:21,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:21,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:21,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash -671097975, now seen corresponding path program 1 times [2024-11-09 11:45:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:21,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41819131] [2024-11-09 11:45:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41819131] [2024-11-09 11:45:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41819131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:45:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3533922] [2024-11-09 11:45:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:21,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:45:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:45:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:21,962 INFO L87 Difference]: Start difference. First operand 241 states and 302 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:22,061 INFO L93 Difference]: Finished difference Result 241 states and 302 transitions. [2024-11-09 11:45:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-09 11:45:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:22,062 INFO L225 Difference]: With dead ends: 241 [2024-11-09 11:45:22,062 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 11:45:22,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:45:22,063 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 118 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:22,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 188 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 11:45:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-09 11:45:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 231 states have internal predecessors, (286), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2024-11-09 11:45:22,074 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 56 [2024-11-09 11:45:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:22,074 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2024-11-09 11:45:22,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2024-11-09 11:45:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 11:45:22,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:22,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:22,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:45:22,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:22,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash -671098295, now seen corresponding path program 1 times [2024-11-09 11:45:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727087808] [2024-11-09 11:45:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727087808] [2024-11-09 11:45:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727087808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771288982] [2024-11-09 11:45:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:22,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:22,123 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:22,225 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2024-11-09 11:45:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-09 11:45:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:22,226 INFO L225 Difference]: With dead ends: 256 [2024-11-09 11:45:22,226 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 11:45:22,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:22,227 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:22,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 197 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 11:45:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2024-11-09 11:45:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 231 states have internal predecessors, (284), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 296 transitions. [2024-11-09 11:45:22,236 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 296 transitions. Word has length 56 [2024-11-09 11:45:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 296 transitions. [2024-11-09 11:45:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 296 transitions. [2024-11-09 11:45:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 11:45:22,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:22,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:22,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:45:22,237 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 670799390, now seen corresponding path program 1 times [2024-11-09 11:45:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655289238] [2024-11-09 11:45:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:22,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655289238] [2024-11-09 11:45:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655289238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:22,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:45:22,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535752300] [2024-11-09 11:45:22,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:22,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:45:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:22,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:45:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:45:22,276 INFO L87 Difference]: Start difference. First operand 240 states and 296 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:22,378 INFO L93 Difference]: Finished difference Result 263 states and 323 transitions. [2024-11-09 11:45:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:45:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-09 11:45:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:22,380 INFO L225 Difference]: With dead ends: 263 [2024-11-09 11:45:22,380 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 11:45:22,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:22,380 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 54 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:22,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 191 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 11:45:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2024-11-09 11:45:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.402061855670103) internal successors, (272), 225 states have internal predecessors, (272), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2024-11-09 11:45:22,389 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 57 [2024-11-09 11:45:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:22,389 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2024-11-09 11:45:22,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2024-11-09 11:45:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 11:45:22,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:22,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 11:45:22,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:22,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 670789460, now seen corresponding path program 1 times [2024-11-09 11:45:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:22,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155890712] [2024-11-09 11:45:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:22,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155890712] [2024-11-09 11:45:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155890712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:45:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050766490] [2024-11-09 11:45:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:45:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:45:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:22,447 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:22,579 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2024-11-09 11:45:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-09 11:45:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:22,580 INFO L225 Difference]: With dead ends: 242 [2024-11-09 11:45:22,580 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 11:45:22,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:45:22,581 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 138 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:22,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 11:45:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2024-11-09 11:45:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 225 states have internal predecessors, (270), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:45:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2024-11-09 11:45:22,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 57 [2024-11-09 11:45:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:22,599 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2024-11-09 11:45:22,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2024-11-09 11:45:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:45:22,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:22,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:45:22,600 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:22,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash -825338779, now seen corresponding path program 1 times [2024-11-09 11:45:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296852955] [2024-11-09 11:45:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:22,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296852955] [2024-11-09 11:45:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296852955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:22,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227165661] [2024-11-09 11:45:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:22,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:22,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:22,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:22,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:45:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:22,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:45:22,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:22,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227165661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:22,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:22,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2024-11-09 11:45:22,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248319689] [2024-11-09 11:45:22,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:22,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:45:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:45:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:45:22,835 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:45:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:22,929 INFO L93 Difference]: Finished difference Result 602 states and 706 transitions. [2024-11-09 11:45:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:45:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2024-11-09 11:45:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:22,931 INFO L225 Difference]: With dead ends: 602 [2024-11-09 11:45:22,931 INFO L226 Difference]: Without dead ends: 559 [2024-11-09 11:45:22,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:45:22,932 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 224 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:22,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 790 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:45:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-09 11:45:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2024-11-09 11:45:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 372 states have (on average 1.4220430107526882) internal successors, (529), 403 states have internal predecessors, (529), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 551 transitions. [2024-11-09 11:45:22,948 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 551 transitions. Word has length 62 [2024-11-09 11:45:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:22,948 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 551 transitions. [2024-11-09 11:45:22,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:45:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 551 transitions. [2024-11-09 11:45:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:45:22,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:22,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:22,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 11:45:23,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 11:45:23,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1418385575, now seen corresponding path program 1 times [2024-11-09 11:45:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712824771] [2024-11-09 11:45:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:23,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:23,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712824771] [2024-11-09 11:45:23,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712824771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:45:23,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:45:23,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:45:23,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216117800] [2024-11-09 11:45:23,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:45:23,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:45:23,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:45:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:45:23,212 INFO L87 Difference]: Start difference. First operand 420 states and 551 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:23,329 INFO L93 Difference]: Finished difference Result 481 states and 622 transitions. [2024-11-09 11:45:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:45:23,329 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2024-11-09 11:45:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:23,331 INFO L225 Difference]: With dead ends: 481 [2024-11-09 11:45:23,331 INFO L226 Difference]: Without dead ends: 480 [2024-11-09 11:45:23,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:45:23,332 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:23,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 240 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:45:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-09 11:45:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 433. [2024-11-09 11:45:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 385 states have (on average 1.4077922077922078) internal successors, (542), 416 states have internal predecessors, (542), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 564 transitions. [2024-11-09 11:45:23,352 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 564 transitions. Word has length 64 [2024-11-09 11:45:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:23,352 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 564 transitions. [2024-11-09 11:45:23,352 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:45:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 564 transitions. [2024-11-09 11:45:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:45:23,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:23,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:23,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:45:23,353 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash -836399119, now seen corresponding path program 1 times [2024-11-09 11:45:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205739176] [2024-11-09 11:45:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205739176] [2024-11-09 11:45:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205739176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482438100] [2024-11-09 11:45:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:23,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:23,453 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:23,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:45:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:23,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:45:23,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:23,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482438100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:23,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-09 11:45:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091456882] [2024-11-09 11:45:23,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:23,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:45:23,702 INFO L87 Difference]: Start difference. First operand 433 states and 564 transitions. Second operand has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 11:45:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:24,240 INFO L93 Difference]: Finished difference Result 583 states and 738 transitions. [2024-11-09 11:45:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:45:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2024-11-09 11:45:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:24,243 INFO L225 Difference]: With dead ends: 583 [2024-11-09 11:45:24,243 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 11:45:24,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:45:24,243 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 597 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:24,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 415 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:45:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 11:45:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 436. [2024-11-09 11:45:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.3933161953727506) internal successors, (542), 419 states have internal predecessors, (542), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 564 transitions. [2024-11-09 11:45:24,262 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 564 transitions. Word has length 64 [2024-11-09 11:45:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:24,262 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 564 transitions. [2024-11-09 11:45:24,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 11:45:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 564 transitions. [2024-11-09 11:45:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:45:24,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:24,263 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:24,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:45:24,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:24,467 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1020279945, now seen corresponding path program 1 times [2024-11-09 11:45:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701692946] [2024-11-09 11:45:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701692946] [2024-11-09 11:45:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701692946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929581776] [2024-11-09 11:45:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:24,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:24,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:24,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:24,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:45:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:24,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:45:24,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:24,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:24,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929581776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:24,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 11:45:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707073041] [2024-11-09 11:45:24,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:24,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:45:24,843 INFO L87 Difference]: Start difference. First operand 436 states and 564 transitions. Second operand has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:45:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:45:25,339 INFO L93 Difference]: Finished difference Result 542 states and 697 transitions. [2024-11-09 11:45:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:45:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 65 [2024-11-09 11:45:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:45:25,343 INFO L225 Difference]: With dead ends: 542 [2024-11-09 11:45:25,343 INFO L226 Difference]: Without dead ends: 540 [2024-11-09 11:45:25,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:45:25,344 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 242 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:45:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 359 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:45:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-09 11:45:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 448. [2024-11-09 11:45:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 401 states have (on average 1.371571072319202) internal successors, (550), 431 states have internal predecessors, (550), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:45:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 572 transitions. [2024-11-09 11:45:25,369 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 572 transitions. Word has length 65 [2024-11-09 11:45:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:45:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 572 transitions. [2024-11-09 11:45:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:45:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 572 transitions. [2024-11-09 11:45:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:45:25,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:45:25,370 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:45:25,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 11:45:25,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 11:45:25,575 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-09 11:45:25,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:45:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash -158568833, now seen corresponding path program 1 times [2024-11-09 11:45:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:45:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251340327] [2024-11-09 11:45:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:45:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:25,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:45:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:45:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:45:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:45:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251340327] [2024-11-09 11:45:25,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251340327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:45:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363111130] [2024-11-09 11:45:25,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:45:25,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:45:25,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:45:25,644 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:45:25,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:45:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:45:25,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:45:25,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:45:43,733 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_45| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_45| |v_ULTIMATE.start_main_~R~0#1_45|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2024-11-09 11:45:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-09 11:45:43,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:45:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:45:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363111130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:45:43,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:45:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 11:45:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182727266] [2024-11-09 11:45:43,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:45:43,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:45:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:45:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:45:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-11-09 11:45:43,884 INFO L87 Difference]: Start difference. First operand 448 states and 572 transitions. Second operand has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 11:45:45,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:45:49,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:45:51,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:45:57,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:03,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:07,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:11,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:15,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:24,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:25,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:26,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:29,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:33,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:37,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:38,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:42,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:43,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:45,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:46,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:47,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:48,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:50,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:51,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:52,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:56,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:57,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:46:58,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]