./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.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 c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:42:08,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:42:08,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:42:08,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:42:08,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:42:08,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:42:08,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:42:08,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:42:08,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:42:08,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:42:08,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:42:08,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:42:08,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:42:08,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:42:08,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:42:08,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:42:08,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:42:08,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:42:08,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:42:08,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:42:08,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:42:08,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:42:08,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:42:08,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:42:08,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:42:08,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:42:08,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:42:08,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:42:08,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:42:08,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:42:08,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:42:08,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:42:08,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:42:08,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:42:08,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:42:08,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:42:08,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:42:08,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:42:08,172 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 -> c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b [2024-10-13 13:42:08,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:42:08,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:42:08,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:42:08,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:42:08,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:42:08,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2024-10-13 13:42:09,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:42:09,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:42:09,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2024-10-13 13:42:09,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cb13583/9c677c0fed0a4c1e98ba18dd02f95856/FLAG89dfe25d1 [2024-10-13 13:42:10,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cb13583/9c677c0fed0a4c1e98ba18dd02f95856 [2024-10-13 13:42:10,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:42:10,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:42:10,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:42:10,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:42:10,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:42:10,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d59063c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10, skipping insertion in model container [2024-10-13 13:42:10,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:42:10,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:42:10,398 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:42:10,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:42:10,423 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:42:10,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10 WrapperNode [2024-10-13 13:42:10,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:42:10,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:42:10,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:42:10,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:42:10,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,452 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-10-13 13:42:10,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:42:10,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:42:10,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:42:10,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:42:10,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,476 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-13 13:42:10,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:42:10,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:42:10,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:42:10,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:42:10,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (1/1) ... [2024-10-13 13:42:10,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:42:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:10,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:42:10,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:42:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:42:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:42:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 13:42:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:42:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:42:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:42:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:42:10,639 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:42:10,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:42:10,910 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-13 13:42:10,911 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:42:10,939 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:42:10,939 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:42:10,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:42:10 BoogieIcfgContainer [2024-10-13 13:42:10,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:42:10,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:42:10,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:42:10,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:42:10,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:42:10" (1/3) ... [2024-10-13 13:42:10,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5353df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:42:10, skipping insertion in model container [2024-10-13 13:42:10,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:42:10" (2/3) ... [2024-10-13 13:42:10,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5353df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:42:10, skipping insertion in model container [2024-10-13 13:42:10,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:42:10" (3/3) ... [2024-10-13 13:42:10,952 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound1.c [2024-10-13 13:42:10,965 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:42:10,966 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-13 13:42:11,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:42:11,028 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;@1095991b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:42:11,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-13 13:42:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 40 states have (on average 1.9) internal successors, (76), 68 states have internal predecessors, (76), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:42:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 13:42:11,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:11,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 13:42:11,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:11,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash 163595, now seen corresponding path program 1 times [2024-10-13 13:42:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80983276] [2024-10-13 13:42:11,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:42:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80983276] [2024-10-13 13:42:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80983276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:11,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:42:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466277428] [2024-10-13 13:42:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:11,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:42:11,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:11,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:42:11,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:42:11,278 INFO L87 Difference]: Start difference. First operand has 77 states, 40 states have (on average 1.9) internal successors, (76), 68 states have internal predecessors, (76), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 1.0) 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-10-13 13:42:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:11,345 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2024-10-13 13:42:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:42:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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-10-13 13:42:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:11,355 INFO L225 Difference]: With dead ends: 157 [2024-10-13 13:42:11,355 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 13:42:11,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-13 13:42:11,361 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:11,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 239 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 13:42:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 13:42:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:42:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-10-13 13:42:11,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 3 [2024-10-13 13:42:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-10-13 13:42:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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-10-13 13:42:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-10-13 13:42:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 13:42:11,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:11,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:42:11,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:11,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash -576103490, now seen corresponding path program 1 times [2024-10-13 13:42:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261704182] [2024-10-13 13:42:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:42:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651285495] [2024-10-13 13:42:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:11,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:11,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:11,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:11,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:42:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:11,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:42:11,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:42:11,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:42:11,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261704182] [2024-10-13 13:42:11,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:42:11,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651285495] [2024-10-13 13:42:11,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651285495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:11,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:11,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:42:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122218095] [2024-10-13 13:42:11,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:42:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:42:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:11,543 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-10-13 13:42:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:11,688 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2024-10-13 13:42:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:42:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 16 [2024-10-13 13:42:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:11,691 INFO L225 Difference]: With dead ends: 166 [2024-10-13 13:42:11,691 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 13:42:11,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:11,692 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:11,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 122 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:42:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 13:42:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2024-10-13 13:42:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 88 states have internal predecessors, (103), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-10-13 13:42:11,701 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 16 [2024-10-13 13:42:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:11,703 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-10-13 13:42:11,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-10-13 13:42:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-10-13 13:42:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 13:42:11,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:11,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:11,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 13:42:11,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:11,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:11,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 117225432, now seen corresponding path program 1 times [2024-10-13 13:42:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439444615] [2024-10-13 13:42:11,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:12,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439444615] [2024-10-13 13:42:12,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439444615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:12,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:12,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:42:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763630533] [2024-10-13 13:42:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:12,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:42:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:42:12,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:12,037 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:12,096 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2024-10-13 13:42:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:42:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-13 13:42:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:12,098 INFO L225 Difference]: With dead ends: 112 [2024-10-13 13:42:12,098 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 13:42:12,100 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-10-13 13:42:12,100 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:12,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 126 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:42:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 13:42:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2024-10-13 13:42:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 88 states have internal predecessors, (101), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2024-10-13 13:42:12,113 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 24 [2024-10-13 13:42:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:12,114 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2024-10-13 13:42:12,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2024-10-13 13:42:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:42:12,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:12,115 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:42:12,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -660980348, now seen corresponding path program 1 times [2024-10-13 13:42:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822737528] [2024-10-13 13:42:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822737528] [2024-10-13 13:42:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822737528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:42:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298867261] [2024-10-13 13:42:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:42:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:42:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:42:12,228 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:12,305 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2024-10-13 13:42:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:42:12,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-13 13:42:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:12,306 INFO L225 Difference]: With dead ends: 135 [2024-10-13 13:42:12,306 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 13:42:12,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:42:12,307 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:12,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 353 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:42:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 13:42:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2024-10-13 13:42:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 84 states have internal predecessors, (91), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:42:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-10-13 13:42:12,314 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 25 [2024-10-13 13:42:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:12,314 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-10-13 13:42:12,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-10-13 13:42:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 13:42:12,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:12,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:12,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:42:12,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:12,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 984445769, now seen corresponding path program 1 times [2024-10-13 13:42:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141872209] [2024-10-13 13:42:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141872209] [2024-10-13 13:42:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141872209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:42:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415176579] [2024-10-13 13:42:12,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:42:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:12,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:42:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:42:12,410 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:12,474 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-10-13 13:42:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:42:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-13 13:42:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:12,475 INFO L225 Difference]: With dead ends: 101 [2024-10-13 13:42:12,475 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 13:42:12,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:42:12,476 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:12,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 415 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 13:42:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-13 13:42:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 84 states have internal predecessors, (90), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:42:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-13 13:42:12,483 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 26 [2024-10-13 13:42:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:12,483 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-13 13:42:12,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-13 13:42:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 13:42:12,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:12,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:42:12,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1159581497, now seen corresponding path program 1 times [2024-10-13 13:42:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941726673] [2024-10-13 13:42:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:42:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350986200] [2024-10-13 13:42:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:12,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:12,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:12,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:12,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:42:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:42:12,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:12,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:42:12,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:12,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941726673] [2024-10-13 13:42:12,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:42:12,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350986200] [2024-10-13 13:42:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350986200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:12,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:42:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094562515] [2024-10-13 13:42:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:12,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:42:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:42:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:12,568 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:12,633 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2024-10-13 13:42:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:42:12,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-13 13:42:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:12,634 INFO L225 Difference]: With dead ends: 135 [2024-10-13 13:42:12,634 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 13:42:12,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:12,635 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:12,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:42:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 13:42:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2024-10-13 13:42:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 102 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-10-13 13:42:12,649 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 28 [2024-10-13 13:42:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:12,649 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-13 13:42:12,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2024-10-13 13:42:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 13:42:12,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:12,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:12,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:42:12,854 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,SelfDestructingSolverStorable5 [2024-10-13 13:42:12,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1317260150, now seen corresponding path program 1 times [2024-10-13 13:42:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522446505] [2024-10-13 13:42:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522446505] [2024-10-13 13:42:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522446505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:42:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309117502] [2024-10-13 13:42:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:12,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:42:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:12,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:42:12,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:13,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:42:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309117502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:42:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 13:42:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513193722] [2024-10-13 13:42:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:13,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:42:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:42:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:42:13,095 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:13,130 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2024-10-13 13:42:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:42:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-13 13:42:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:13,136 INFO L225 Difference]: With dead ends: 124 [2024-10-13 13:42:13,136 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 13:42:13,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:42:13,136 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:13,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 195 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 13:42:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-10-13 13:42:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 104 states have internal predecessors, (123), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2024-10-13 13:42:13,143 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 29 [2024-10-13 13:42:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:13,143 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2024-10-13 13:42:13,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2024-10-13 13:42:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 13:42:13,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:13,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:13,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:42:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:13,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1961293115, now seen corresponding path program 1 times [2024-10-13 13:42:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740987027] [2024-10-13 13:42:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:42:13,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693740132] [2024-10-13 13:42:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:13,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:13,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:42:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:13,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:42:13,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:13,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:42:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740987027] [2024-10-13 13:42:13,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:42:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693740132] [2024-10-13 13:42:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693740132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:42:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468864307] [2024-10-13 13:42:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:42:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:13,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:42:13,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:13,476 INFO L87 Difference]: Start difference. First operand 118 states and 143 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:13,522 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2024-10-13 13:42:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:42:13,522 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-13 13:42:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:13,523 INFO L225 Difference]: With dead ends: 132 [2024-10-13 13:42:13,523 INFO L226 Difference]: Without dead ends: 130 [2024-10-13 13:42:13,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:13,524 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 38 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:13,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-13 13:42:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2024-10-13 13:42:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 105 states have internal predecessors, (123), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-10-13 13:42:13,532 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 30 [2024-10-13 13:42:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:13,532 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-10-13 13:42:13,532 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-10-13 13:42:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 13:42:13,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:13,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:13,546 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-10-13 13:42:13,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:13,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:13,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2114608351, now seen corresponding path program 1 times [2024-10-13 13:42:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24116867] [2024-10-13 13:42:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:13,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24116867] [2024-10-13 13:42:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24116867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:42:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005888857] [2024-10-13 13:42:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:13,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:13,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:13,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:42:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:13,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:42:13,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:13,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:42:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005888857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:13,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:42:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-13 13:42:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350466059] [2024-10-13 13:42:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:13,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:42:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:42:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:42:13,907 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:13,948 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-10-13 13:42:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:42:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-13 13:42:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:13,949 INFO L225 Difference]: With dead ends: 124 [2024-10-13 13:42:13,949 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 13:42:13,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:42:13,950 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:13,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 266 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 13:42:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-10-13 13:42:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-13 13:42:13,966 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 30 [2024-10-13 13:42:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:13,968 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-13 13:42:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-13 13:42:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 13:42:13,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:13,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:13,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:42:14,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:14,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:14,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash 670544555, now seen corresponding path program 1 times [2024-10-13 13:42:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:14,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284804188] [2024-10-13 13:42:14,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:14,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284804188] [2024-10-13 13:42:14,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284804188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:14,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:14,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:42:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707771012] [2024-10-13 13:42:14,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:14,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:42:14,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:42:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:42:14,242 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:14,286 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2024-10-13 13:42:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:42:14,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-10-13 13:42:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:14,287 INFO L225 Difference]: With dead ends: 123 [2024-10-13 13:42:14,287 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 13:42:14,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:42:14,288 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:14,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 13:42:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-13 13:42:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.56) internal successors, (117), 100 states have internal predecessors, (117), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2024-10-13 13:42:14,293 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 31 [2024-10-13 13:42:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2024-10-13 13:42:14,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2024-10-13 13:42:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:42:14,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:14,294 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:42:14,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:14,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2012098831, now seen corresponding path program 1 times [2024-10-13 13:42:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:14,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099364567] [2024-10-13 13:42:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 13:42:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099364567] [2024-10-13 13:42:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099364567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:42:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996699633] [2024-10-13 13:42:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:42:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:42:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:42:14,329 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:14,363 INFO L93 Difference]: Finished difference Result 195 states and 236 transitions. [2024-10-13 13:42:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:42:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-13 13:42:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:14,364 INFO L225 Difference]: With dead ends: 195 [2024-10-13 13:42:14,364 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 13:42:14,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:42:14,365 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:14,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 280 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 13:42:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-10-13 13:42:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:42:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-13 13:42:14,370 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 33 [2024-10-13 13:42:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:14,370 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-13 13:42:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-13 13:42:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 13:42:14,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:14,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 13:42:14,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2049445602, now seen corresponding path program 1 times [2024-10-13 13:42:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570504658] [2024-10-13 13:42:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570504658] [2024-10-13 13:42:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570504658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:42:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669056353] [2024-10-13 13:42:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:14,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:14,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:42:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:14,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:42:14,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:14,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:42:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:42:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669056353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:42:14,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:42:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-10-13 13:42:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082451011] [2024-10-13 13:42:14,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:42:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:42:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:42:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:42:14,617 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 13:42:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:14,754 INFO L93 Difference]: Finished difference Result 169 states and 199 transitions. [2024-10-13 13:42:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 13:42:14,755 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 34 [2024-10-13 13:42:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:14,756 INFO L225 Difference]: With dead ends: 169 [2024-10-13 13:42:14,756 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 13:42:14,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:42:14,756 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 189 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:14,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 536 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:42:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 13:42:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2024-10-13 13:42:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 133 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:42:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 191 transitions. [2024-10-13 13:42:14,765 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 191 transitions. Word has length 34 [2024-10-13 13:42:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:14,766 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 191 transitions. [2024-10-13 13:42:14,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 13:42:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 191 transitions. [2024-10-13 13:42:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 13:42:14,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:14,768 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-13 13:42:14,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:42:14,968 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-10-13 13:42:14,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:14,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 4952566, now seen corresponding path program 1 times [2024-10-13 13:42:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781191806] [2024-10-13 13:42:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:42:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102251748] [2024-10-13 13:42:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:14,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:14,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:14,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:14,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 13:42:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:42:15,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:42:15,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:42:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781191806] [2024-10-13 13:42:15,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:42:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102251748] [2024-10-13 13:42:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102251748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:42:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:42:15,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:42:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237870450] [2024-10-13 13:42:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:42:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:42:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:42:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:15,092 INFO L87 Difference]: Start difference. First operand 150 states and 191 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:15,161 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2024-10-13 13:42:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:42:15,162 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-13 13:42:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:15,162 INFO L225 Difference]: With dead ends: 165 [2024-10-13 13:42:15,162 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 13:42:15,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:42:15,163 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:15,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 90 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:42:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 13:42:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2024-10-13 13:42:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 126 states have internal predecessors, (153), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:42:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2024-10-13 13:42:15,168 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 39 [2024-10-13 13:42:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:15,169 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2024-10-13 13:42:15,169 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:42:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2024-10-13 13:42:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 13:42:15,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:42:15,169 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:15,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:42:15,369 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-10-13 13:42:15,370 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:42:15,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:42:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash -177943393, now seen corresponding path program 1 times [2024-10-13 13:42:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:42:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363347622] [2024-10-13 13:42:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:42:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 13:42:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 13:42:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 13:42:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 13:42:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 13:42:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 13:42:15,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:42:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363347622] [2024-10-13 13:42:15,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363347622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:42:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689607026] [2024-10-13 13:42:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:42:15,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:42:15,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:42:15,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:42:15,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 13:42:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:42:15,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:42:15,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:42:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:42:15,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:42:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 13:42:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689607026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:42:15,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:42:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2024-10-13 13:42:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173244150] [2024-10-13 13:42:15,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:42:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 13:42:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:42:15,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 13:42:15,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:42:15,588 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 13:42:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:42:15,622 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2024-10-13 13:42:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:42:15,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 42 [2024-10-13 13:42:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:42:15,623 INFO L225 Difference]: With dead ends: 147 [2024-10-13 13:42:15,623 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:42:15,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:42:15,624 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:42:15,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:42:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:42:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:42:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:42:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:42:15,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-10-13 13:42:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:42:15,624 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:42:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 13:42:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:42:15,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:42:15,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2024-10-13 13:42:15,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2024-10-13 13:42:15,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2024-10-13 13:42:15,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2024-10-13 13:42:15,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2024-10-13 13:42:15,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2024-10-13 13:42:15,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2024-10-13 13:42:15,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2024-10-13 13:42:15,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2024-10-13 13:42:15,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2024-10-13 13:42:15,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 13:42:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 13:42:15,834 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:42:15,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:42:15,923 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:42:15,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:42:15 BoogieIcfgContainer [2024-10-13 13:42:15,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:42:15,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:42:15,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:42:15,937 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:42:15,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:42:10" (3/4) ... [2024-10-13 13:42:15,938 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:42:15,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:42:15,945 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 13:42:15,945 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 13:42:15,945 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 13:42:15,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:42:15,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:42:16,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:42:16,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:42:16,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:42:16,021 INFO L158 Benchmark]: Toolchain (without parser) took 5791.97ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 128.3MB in the beginning and 117.0MB in the end (delta: 11.3MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,022 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:42:16,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.95ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 115.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.73ms. Allocated memory is still 184.5MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,022 INFO L158 Benchmark]: Boogie Preprocessor took 35.42ms. Allocated memory is still 184.5MB. Free memory was 113.6MB in the beginning and 112.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,022 INFO L158 Benchmark]: RCFGBuilder took 450.92ms. Allocated memory is still 184.5MB. Free memory was 112.1MB in the beginning and 94.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,022 INFO L158 Benchmark]: TraceAbstraction took 4993.21ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 93.2MB in the beginning and 122.2MB in the end (delta: -29.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,023 INFO L158 Benchmark]: Witness Printer took 84.65ms. Allocated memory is still 257.9MB. Free memory was 122.2MB in the beginning and 117.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:42:16,023 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.95ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 115.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.73ms. Allocated memory is still 184.5MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.42ms. Allocated memory is still 184.5MB. Free memory was 113.6MB in the beginning and 112.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.92ms. Allocated memory is still 184.5MB. Free memory was 112.1MB in the beginning and 94.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4993.21ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 93.2MB in the beginning and 122.2MB in the end (delta: -29.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * Witness Printer took 84.65ms. Allocated memory is still 257.9MB. Free memory was 122.2MB in the beginning and 117.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 3033 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2110 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 923 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 356 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 114 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 638 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 1625 SizeOfPredicates, 11 NumberOfNonLiveVariables, 813 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 338/355 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((r <= 2147483647) && (q == 0)) && (counter == 1)) && (0 <= (r + 2147483648))) || (((((((d == 1) && (p == 1)) && (r <= 2147483647)) && (q == 0)) && (counter == 0)) && (B == 1)) && (0 <= (r + 2147483648)))) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((r <= 2147483647) && (q == 0)) && (counter == 2)) && (0 <= (r + 2147483648))) || (((((((d == 1) && (p == 1)) && (q == 0)) && (r <= 0)) && (counter == 1)) && (B == 1)) && (0 <= (r + 2147483648)))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:42:16,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE