./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/geo1-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound1.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 9e07bde78bec0a50daafc27f8ee8a57138b319676dd5631a76f48638e6ef09e9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:48:22,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:48:22,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:48:22,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:48:22,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:48:22,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:48:22,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:48:22,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:48:22,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:48:22,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:48:22,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:48:22,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:48:22,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:48:22,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:48:22,574 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:48:22,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:48:22,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:48:22,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:48:22,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:48:22,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:48:22,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:48:22,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:48:22,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:48:22,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:48:22,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:48:22,581 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:48:22,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:48:22,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:48:22,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:48:22,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:48:22,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:48:22,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:48:22,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:48:22,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:48:22,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:48:22,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:48:22,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:48:22,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:48:22,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:48:22,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:48:22,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:48:22,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:48:22,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:48:22,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:48:22,587 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 -> 9e07bde78bec0a50daafc27f8ee8a57138b319676dd5631a76f48638e6ef09e9 [2024-10-14 20:48:22,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:48:22,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:48:22,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:48:22,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:48:22,896 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:48:22,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound1.c [2024-10-14 20:48:24,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:48:24,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:48:24,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound1.c [2024-10-14 20:48:24,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef550ac3c/287717c7028f4d19a28aa802a4453a3a/FLAGb7d0bbab2 [2024-10-14 20:48:24,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef550ac3c/287717c7028f4d19a28aa802a4453a3a [2024-10-14 20:48:24,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:48:24,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:48:24,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:48:24,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:48:24,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:48:24,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a59b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24, skipping insertion in model container [2024-10-14 20:48:24,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:48:24,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:48:24,771 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:48:24,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:48:24,817 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:48:24,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24 WrapperNode [2024-10-14 20:48:24,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:48:24,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:48:24,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:48:24,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:48:24,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,856 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-10-14 20:48:24,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:48:24,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:48:24,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:48:24,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:48:24,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:48:24,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:48:24,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:48:24,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:48:24,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:48:24,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (1/1) ... [2024-10-14 20:48:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:48:24,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:24,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:48:24,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:48:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:48:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 20:48:24,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 20:48:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:48:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:48:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:48:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:48:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:48:25,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:48:25,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:48:25,471 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-10-14 20:48:25,471 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:48:25,510 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:48:25,510 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:48:25,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:48:25 BoogieIcfgContainer [2024-10-14 20:48:25,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:48:25,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:48:25,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:48:25,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:48:25,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:48:24" (1/3) ... [2024-10-14 20:48:25,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a9860d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:48:25, skipping insertion in model container [2024-10-14 20:48:25,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:48:24" (2/3) ... [2024-10-14 20:48:25,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a9860d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:48:25, skipping insertion in model container [2024-10-14 20:48:25,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:48:25" (3/3) ... [2024-10-14 20:48:25,520 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound1.c [2024-10-14 20:48:25,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:48:25,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-14 20:48:25,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:48:25,597 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;@702a2dbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:48:25,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-14 20:48:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 20:48:25,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:25,607 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:25,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash 321259115, now seen corresponding path program 1 times [2024-10-14 20:48:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136483012] [2024-10-14 20:48:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:25,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:25,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136483012] [2024-10-14 20:48:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136483012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:25,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:25,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:48:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758794078] [2024-10-14 20:48:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:25,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:48:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:48:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:48:25,812 INFO L87 Difference]: Start difference. First operand has 69 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 20:48:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:25,845 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2024-10-14 20:48:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:48:25,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-14 20:48:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:25,853 INFO L225 Difference]: With dead ends: 136 [2024-10-14 20:48:25,853 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 20:48:25,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:48:25,859 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:25,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:48:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 20:48:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 20:48:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 58 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:48:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-10-14 20:48:25,893 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 25 [2024-10-14 20:48:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:25,893 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-10-14 20:48:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 20:48:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-10-14 20:48:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 20:48:25,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:25,895 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:25,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:48:25,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:25,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 277368359, now seen corresponding path program 1 times [2024-10-14 20:48:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:25,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769688009] [2024-10-14 20:48:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:48:25,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978503692] [2024-10-14 20:48:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:25,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:25,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:25,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:48:25,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:48:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:26,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:48:26,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:48:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:26,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:48:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:26,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769688009] [2024-10-14 20:48:26,099 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:48:26,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978503692] [2024-10-14 20:48:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978503692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:26,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:48:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502884305] [2024-10-14 20:48:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:48:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:48:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:26,106 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:26,355 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2024-10-14 20:48:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:48:26,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2024-10-14 20:48:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:26,360 INFO L225 Difference]: With dead ends: 94 [2024-10-14 20:48:26,360 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 20:48:26,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:26,364 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:26,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:48:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 20:48:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-10-14 20:48:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.679245283018868) internal successors, (89), 76 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2024-10-14 20:48:26,376 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 25 [2024-10-14 20:48:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:26,378 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2024-10-14 20:48:26,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2024-10-14 20:48:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 20:48:26,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:26,379 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:26,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:48:26,580 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-14 20:48:26,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:26,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash 8484588, now seen corresponding path program 1 times [2024-10-14 20:48:26,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581469923] [2024-10-14 20:48:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:48:26,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791418472] [2024-10-14 20:48:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:26,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:26,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:48:26,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:48:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:26,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:48:26,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:48:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:26,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:48:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:26,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581469923] [2024-10-14 20:48:26,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:48:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791418472] [2024-10-14 20:48:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791418472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:26,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:26,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:48:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842062434] [2024-10-14 20:48:26,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:26,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:48:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:48:26,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:26,771 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:26,902 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-10-14 20:48:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:48:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 26 [2024-10-14 20:48:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:26,903 INFO L225 Difference]: With dead ends: 94 [2024-10-14 20:48:26,903 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 20:48:26,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:26,905 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 63 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:26,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 57 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:48:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 20:48:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-14 20:48:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 77 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-14 20:48:26,916 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 26 [2024-10-14 20:48:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:26,916 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-14 20:48:26,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-14 20:48:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 20:48:26,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:26,920 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 20:48:27,120 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,SelfDestructingSolverStorable2 [2024-10-14 20:48:27,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -638656661, now seen corresponding path program 1 times [2024-10-14 20:48:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005318377] [2024-10-14 20:48:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:48:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484026033] [2024-10-14 20:48:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:27,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:27,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:27,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:48:27,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:48:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:27,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:48:27,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:48:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:27,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:48:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005318377] [2024-10-14 20:48:27,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:48:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484026033] [2024-10-14 20:48:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484026033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:48:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772494399] [2024-10-14 20:48:27,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:27,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:48:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:48:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:48:27,283 INFO L87 Difference]: Start difference. First operand 86 states and 98 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:27,450 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-10-14 20:48:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:48:27,451 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-10-14 20:48:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:27,452 INFO L225 Difference]: With dead ends: 90 [2024-10-14 20:48:27,452 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 20:48:27,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:48:27,454 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:27,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:48:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 20:48:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-14 20:48:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 77 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-10-14 20:48:27,470 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 29 [2024-10-14 20:48:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:27,480 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-10-14 20:48:27,480 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-10-14 20:48:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 20:48:27,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:27,482 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:27,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 20:48:27,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:27,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:27,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1676480048, now seen corresponding path program 1 times [2024-10-14 20:48:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:27,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026073325] [2024-10-14 20:48:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:28,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:28,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026073325] [2024-10-14 20:48:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026073325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:48:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626038483] [2024-10-14 20:48:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:28,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:48:28,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:48:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:48:28,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:48:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:28,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:48:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626038483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:28,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:48:28,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 20:48:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794880625] [2024-10-14 20:48:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:28,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:48:28,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:48:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:48:28,118 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:28,276 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-10-14 20:48:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:48:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-10-14 20:48:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:28,277 INFO L225 Difference]: With dead ends: 90 [2024-10-14 20:48:28,277 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 20:48:28,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:48:28,278 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:28,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 74 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:48:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 20:48:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-14 20:48:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.490909090909091) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-14 20:48:28,291 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2024-10-14 20:48:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:28,292 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-14 20:48:28,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:48:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-14 20:48:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 20:48:28,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:28,293 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:28,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:48:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:28,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1038971038, now seen corresponding path program 1 times [2024-10-14 20:48:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876941255] [2024-10-14 20:48:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876941255] [2024-10-14 20:48:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876941255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:48:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576142769] [2024-10-14 20:48:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:28,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:28,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:48:28,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 20:48:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:28,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:48:28,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:48:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:28,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:48:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576142769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:48:28,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:48:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-14 20:48:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062158796] [2024-10-14 20:48:28,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:48:28,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 20:48:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 20:48:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:48:28,828 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 20:48:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:28,940 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-14 20:48:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:48:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 39 [2024-10-14 20:48:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:28,942 INFO L225 Difference]: With dead ends: 86 [2024-10-14 20:48:28,942 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 20:48:28,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:48:28,943 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:28,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:48:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 20:48:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-14 20:48:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-10-14 20:48:28,959 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 39 [2024-10-14 20:48:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:28,959 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-10-14 20:48:28,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 20:48:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-10-14 20:48:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 20:48:28,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:28,963 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:28,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 20:48:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:29,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1038970995, now seen corresponding path program 1 times [2024-10-14 20:48:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569289018] [2024-10-14 20:48:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569289018] [2024-10-14 20:48:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569289018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:48:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084749602] [2024-10-14 20:48:29,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:29,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:48:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:29,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:48:29,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:48:29,232 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:29,253 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-10-14 20:48:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:48:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-14 20:48:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:29,254 INFO L225 Difference]: With dead ends: 79 [2024-10-14 20:48:29,255 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 20:48:29,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:48:29,257 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:29,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:48:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 20:48:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 20:48:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 68 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-14 20:48:29,270 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 39 [2024-10-14 20:48:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-14 20:48:29,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-14 20:48:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:48:29,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:29,273 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:29,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:48:29,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:29,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1304644966, now seen corresponding path program 1 times [2024-10-14 20:48:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015126172] [2024-10-14 20:48:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015126172] [2024-10-14 20:48:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015126172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:29,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:48:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467278038] [2024-10-14 20:48:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:48:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:48:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:48:29,381 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:29,550 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2024-10-14 20:48:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:48:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-10-14 20:48:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:29,552 INFO L225 Difference]: With dead ends: 110 [2024-10-14 20:48:29,552 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 20:48:29,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:48:29,553 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:29,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 74 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:48:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 20:48:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 82. [2024-10-14 20:48:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 73 states have internal predecessors, (75), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-10-14 20:48:29,560 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 43 [2024-10-14 20:48:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:29,560 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-10-14 20:48:29,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-10-14 20:48:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:48:29,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:29,561 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:48:29,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1789288382, now seen corresponding path program 1 times [2024-10-14 20:48:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788526533] [2024-10-14 20:48:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788526533] [2024-10-14 20:48:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788526533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:48:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255672583] [2024-10-14 20:48:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:29,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:48:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:48:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:48:29,629 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:29,845 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-14 20:48:29,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:48:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-10-14 20:48:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:29,847 INFO L225 Difference]: With dead ends: 84 [2024-10-14 20:48:29,847 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 20:48:29,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:48:29,848 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:29,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:48:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 20:48:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 20:48:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 74 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-14 20:48:29,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 44 [2024-10-14 20:48:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-14 20:48:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-14 20:48:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:48:29,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:29,857 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:29,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:48:29,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:29,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -366634904, now seen corresponding path program 1 times [2024-10-14 20:48:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795702905] [2024-10-14 20:48:29,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795702905] [2024-10-14 20:48:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795702905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:29,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:29,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:48:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236523874] [2024-10-14 20:48:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:29,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:48:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:48:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:29,936 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:30,233 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-14 20:48:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:48:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-14 20:48:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:30,235 INFO L225 Difference]: With dead ends: 83 [2024-10-14 20:48:30,235 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 20:48:30,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:30,235 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:30,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:48:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 20:48:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 20:48:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 72 states have internal predecessors, (74), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:48:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-10-14 20:48:30,241 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 45 [2024-10-14 20:48:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:30,242 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-10-14 20:48:30,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-10-14 20:48:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:48:30,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:30,243 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:30,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:48:30,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1420767949, now seen corresponding path program 1 times [2024-10-14 20:48:30,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:30,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706084500] [2024-10-14 20:48:30,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:30,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706084500] [2024-10-14 20:48:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706084500] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:48:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259115457] [2024-10-14 20:48:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:30,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:48:30,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:48:30,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 20:48:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:48:30,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:48:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:30,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:48:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 20:48:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259115457] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:48:30,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:48:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-14 20:48:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620853916] [2024-10-14 20:48:30,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:48:30,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 20:48:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 20:48:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:48:30,623 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 20:48:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:30,684 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-10-14 20:48:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:48:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 45 [2024-10-14 20:48:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:30,685 INFO L225 Difference]: With dead ends: 88 [2024-10-14 20:48:30,685 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 20:48:30,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:48:30,686 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:48:30,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:48:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 20:48:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 20:48:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.0) internal successors, (27), 27 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:48:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-14 20:48:30,692 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 45 [2024-10-14 20:48:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:30,693 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-14 20:48:30,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 20:48:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-14 20:48:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 20:48:30,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:48:30,694 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:30,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 20:48:30,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:48:30,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:48:30,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:48:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1519219968, now seen corresponding path program 1 times [2024-10-14 20:48:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:48:30,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131530607] [2024-10-14 20:48:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:48:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:48:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:48:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:48:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:48:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:48:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:48:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:48:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:48:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:48:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131530607] [2024-10-14 20:48:31,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131530607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:48:31,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:48:31,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:48:31,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208245099] [2024-10-14 20:48:31,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:48:31,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:48:31,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:48:31,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:48:31,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:31,001 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:48:31,147 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-14 20:48:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:48:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2024-10-14 20:48:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:48:31,149 INFO L225 Difference]: With dead ends: 35 [2024-10-14 20:48:31,149 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:48:31,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:48:31,150 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 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-14 20:48:31,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:48:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:48:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:48:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:48:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:48:31,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-10-14 20:48:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:48:31,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:48:31,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:48:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:48:31,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:48:31,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-10-14 20:48:31,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-10-14 20:48:31,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-10-14 20:48:31,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-10-14 20:48:31,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-10-14 20:48:31,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-10-14 20:48:31,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-10-14 20:48:31,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-10-14 20:48:31,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-10-14 20:48:31,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-10-14 20:48:31,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-10-14 20:48:31,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-10-14 20:48:31,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-10-14 20:48:31,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-10-14 20:48:31,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-10-14 20:48:31,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-10-14 20:48:31,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-10-14 20:48:31,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-10-14 20:48:31,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-10-14 20:48:31,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-10-14 20:48:31,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-10-14 20:48:31,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-10-14 20:48:31,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-10-14 20:48:31,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-10-14 20:48:31,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 20:48:31,160 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:48:31,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:48:31,215 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:48:31,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:48:31 BoogieIcfgContainer [2024-10-14 20:48:31,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:48:31,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:48:31,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:48:31,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:48:31,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:48:25" (3/4) ... [2024-10-14 20:48:31,236 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:48:31,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 20:48:31,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:48:31,244 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 20:48:31,245 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:48:31,245 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:48:31,245 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:48:31,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:48:31,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:48:31,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:48:31,336 INFO L158 Benchmark]: Toolchain (without parser) took 6775.01ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 112.6MB in the beginning and 108.1MB in the end (delta: 4.5MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,336 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 96.5MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:48:31,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.68ms. Allocated memory is still 163.6MB. Free memory was 112.1MB in the beginning and 101.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.48ms. Allocated memory is still 163.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,337 INFO L158 Benchmark]: Boogie Preprocessor took 36.05ms. Allocated memory is still 163.6MB. Free memory was 99.5MB in the beginning and 97.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,337 INFO L158 Benchmark]: RCFGBuilder took 614.61ms. Allocated memory is still 163.6MB. Free memory was 97.4MB in the beginning and 125.9MB in the end (delta: -28.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,337 INFO L158 Benchmark]: TraceAbstraction took 5720.18ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 124.8MB in the beginning and 113.3MB in the end (delta: 11.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,337 INFO L158 Benchmark]: Witness Printer took 101.37ms. Allocated memory is still 197.1MB. Free memory was 112.3MB in the beginning and 108.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:48:31,339 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 96.5MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.68ms. Allocated memory is still 163.6MB. Free memory was 112.1MB in the beginning and 101.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.48ms. Allocated memory is still 163.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.05ms. Allocated memory is still 163.6MB. Free memory was 99.5MB in the beginning and 97.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 614.61ms. Allocated memory is still 163.6MB. Free memory was 97.4MB in the beginning and 125.9MB in the end (delta: -28.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5720.18ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 124.8MB in the beginning and 113.3MB in the end (delta: 11.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 101.37ms. Allocated memory is still 197.1MB. Free memory was 112.3MB in the beginning and 108.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 69 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 986 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 468 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=3, InterpolantAutomatonStates: 49, 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, 12 MinimizatonAttempts, 41 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1716 SizeOfPredicates, 2 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 366/408 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 24 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((0 <= k) && (k <= 1)) && (c == 1)) && (x == 1)) && (y == 1)) && (z == 1)) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:48:31,362 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