./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/hard-u_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 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/hard-u_unwindbound100.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 aa72233183b4e91144bd6a6eb8a8b140b7f90e590c3e855f829f337fec510ab9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 18:47:47,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 18:47:47,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 18:47:47,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 18:47:47,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 18:47:47,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 18:47:47,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 18:47:47,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 18:47:47,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 18:47:47,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 18:47:47,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 18:47:47,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 18:47:47,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 18:47:47,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 18:47:47,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 18:47:47,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 18:47:47,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 18:47:47,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 18:47:47,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 18:47:47,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 18:47:47,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 18:47:47,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 18:47:47,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 18:47:47,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 18:47:47,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 18:47:47,794 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 18:47:47,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 18:47:47,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 18:47:47,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 18:47:47,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 18:47:47,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 18:47:47,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 18:47:47,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 18:47:47,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 18:47:47,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:47:47,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 18:47:47,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 18:47:47,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 18:47:47,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 18:47:47,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 18:47:47,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 18:47:47,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 18:47:47,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 18:47:47,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 18:47:47,797 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 -> aa72233183b4e91144bd6a6eb8a8b140b7f90e590c3e855f829f337fec510ab9 [2024-11-20 18:47:48,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 18:47:48,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 18:47:48,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 18:47:48,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 18:47:48,041 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 18:47:48,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c [2024-11-20 18:47:49,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 18:47:49,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 18:47:49,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c [2024-11-20 18:47:49,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd3975983/5a00dc8ea1fc42358a845daf18a3d744/FLAG8ec3940bb [2024-11-20 18:47:49,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd3975983/5a00dc8ea1fc42358a845daf18a3d744 [2024-11-20 18:47:49,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 18:47:49,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 18:47:49,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 18:47:49,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 18:47:49,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 18:47:49,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:49" (1/1) ... [2024-11-20 18:47:49,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3702c600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:49, skipping insertion in model container [2024-11-20 18:47:49,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:49" (1/1) ... [2024-11-20 18:47:49,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 18:47:49,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:47:49,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 18:47:50,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:47:50,028 INFO L204 MainTranslator]: Completed translation [2024-11-20 18:47:50,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50 WrapperNode [2024-11-20 18:47:50,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 18:47:50,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 18:47:50,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 18:47:50,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 18:47:50,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,055 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-20 18:47:50,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 18:47:50,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 18:47:50,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 18:47:50,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 18:47:50,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 18:47:50,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 18:47:50,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 18:47:50,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 18:47:50,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 18:47:50,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (1/1) ... [2024-11-20 18:47:50,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:47:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:50,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 18:47:50,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 18:47:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 18:47:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 18:47:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 18:47:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 18:47:50,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 18:47:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 18:47:50,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 18:47:50,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 18:47:50,440 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-20 18:47:50,440 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 18:47:50,463 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 18:47:50,463 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 18:47:50,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:50 BoogieIcfgContainer [2024-11-20 18:47:50,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 18:47:50,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 18:47:50,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 18:47:50,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 18:47:50,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:47:49" (1/3) ... [2024-11-20 18:47:50,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd6e03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:50, skipping insertion in model container [2024-11-20 18:47:50,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:50" (2/3) ... [2024-11-20 18:47:50,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd6e03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:50, skipping insertion in model container [2024-11-20 18:47:50,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:50" (3/3) ... [2024-11-20 18:47:50,472 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound100.c [2024-11-20 18:47:50,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 18:47:50,486 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-20 18:47:50,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 18:47:50,549 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;@7e560b5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 18:47:50,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 18:47:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 18:47:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 18:47:50,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:50,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 18:47:50,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-20 18:47:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:50,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433478871] [2024-11-20 18:47:50,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:50,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:47:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433478871] [2024-11-20 18:47:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433478871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:47:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:47:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 18:47:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268169912] [2024-11-20 18:47:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:47:50,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 18:47:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 18:47:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 18:47:50,682 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:47:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:50,696 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-20 18:47:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 18:47:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 18:47:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:50,701 INFO L225 Difference]: With dead ends: 68 [2024-11-20 18:47:50,702 INFO L226 Difference]: Without dead ends: 28 [2024-11-20 18:47:50,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11-20 18:47:50,706 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:50,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:47:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-20 18:47:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-20 18:47:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-20 18:47:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-20 18:47:50,735 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2024-11-20 18:47:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:50,735 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-20 18:47:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:47:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-20 18:47:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 18:47:50,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:50,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 18:47:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 18:47:50,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:50,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-20 18:47:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207306365] [2024-11-20 18:47:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:47:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207306365] [2024-11-20 18:47:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207306365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:47:50,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:47:50,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 18:47:50,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820567744] [2024-11-20 18:47:50,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:47:50,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 18:47:50,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:50,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 18:47:50,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 18:47:50,822 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:47:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:50,863 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-20 18:47:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 18:47:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 18:47:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:50,864 INFO L225 Difference]: With dead ends: 37 [2024-11-20 18:47:50,864 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 18:47:50,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 18:47:50,866 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:50,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:47:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 18:47:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-20 18:47:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 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-11-20 18:47:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-20 18:47:50,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2024-11-20 18:47:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-20 18:47:50,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:47:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-20 18:47:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 18:47:50,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:50,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:50,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 18:47:50,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:50,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-20 18:47:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056459616] [2024-11-20 18:47:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:47:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056459616] [2024-11-20 18:47:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056459616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:47:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:47:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 18:47:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073815456] [2024-11-20 18:47:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:47:50,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 18:47:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 18:47:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 18:47:50,940 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:47:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:50,977 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-20 18:47:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 18:47:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 18:47:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:50,978 INFO L225 Difference]: With dead ends: 50 [2024-11-20 18:47:50,980 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 18:47:50,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 18:47:50,981 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:50,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:47:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 18:47:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-20 18:47:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 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-11-20 18:47:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-20 18:47:50,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2024-11-20 18:47:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:50,988 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-20 18:47:50,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:47:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-20 18:47:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 18:47:50,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:50,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:50,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 18:47:50,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1297109879, now seen corresponding path program 1 times [2024-11-20 18:47:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94347927] [2024-11-20 18:47:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94347927] [2024-11-20 18:47:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94347927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:47:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:47:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 18:47:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985379642] [2024-11-20 18:47:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:47:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 18:47:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 18:47:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 18:47:51,154 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 18:47:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:51,212 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-20 18:47:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 18:47:51,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-20 18:47:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:51,213 INFO L225 Difference]: With dead ends: 35 [2024-11-20 18:47:51,213 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 18:47:51,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 18:47:51,214 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:51,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:47:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 18:47:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 18:47:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 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-11-20 18:47:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-20 18:47:51,219 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2024-11-20 18:47:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:51,221 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-20 18:47:51,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 18:47:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-20 18:47:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 18:47:51,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:51,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 18:47:51,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1555700513, now seen corresponding path program 1 times [2024-11-20 18:47:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931025603] [2024-11-20 18:47:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:51,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:51,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931025603] [2024-11-20 18:47:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931025603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:47:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:47:51,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 18:47:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41526073] [2024-11-20 18:47:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:47:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 18:47:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 18:47:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 18:47:51,380 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 18:47:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:51,458 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-20 18:47:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 18:47:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-20 18:47:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:51,461 INFO L225 Difference]: With dead ends: 51 [2024-11-20 18:47:51,461 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 18:47:51,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 18:47:51,462 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:51,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:47:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 18:47:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-20 18:47:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 18:47:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-20 18:47:51,474 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2024-11-20 18:47:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:51,474 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-20 18:47:51,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 18:47:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-20 18:47:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 18:47:51,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:51,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:51,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 18:47:51,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:51,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1555664763, now seen corresponding path program 1 times [2024-11-20 18:47:51,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:51,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134326868] [2024-11-20 18:47:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:51,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134326868] [2024-11-20 18:47:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134326868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:47:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75566323] [2024-11-20 18:47:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:51,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:51,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:51,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:47:51,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 18:47:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:51,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 18:47:51,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:47:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:51,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 18:47:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75566323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:47:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 18:47:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-20 18:47:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151605646] [2024-11-20 18:47:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:47:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 18:47:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 18:47:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 18:47:51,726 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 18:47:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:51,769 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-20 18:47:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 18:47:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-20 18:47:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:51,770 INFO L225 Difference]: With dead ends: 49 [2024-11-20 18:47:51,770 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 18:47:51,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 18:47:51,771 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:51,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:47:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 18:47:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-20 18:47:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 18:47:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-20 18:47:51,778 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2024-11-20 18:47:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-20 18:47:51,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-20 18:47:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-20 18:47:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 18:47:51,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:51,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:51,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 18:47:51,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 18:47:51,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:51,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1040655112, now seen corresponding path program 1 times [2024-11-20 18:47:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:51,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177794464] [2024-11-20 18:47:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:51,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177794464] [2024-11-20 18:47:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177794464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:47:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758534300] [2024-11-20 18:47:52,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:52,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:52,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:47:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 18:47:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 18:47:52,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:47:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:52,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:47:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 18:47:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758534300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 18:47:52,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 18:47:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-20 18:47:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757459027] [2024-11-20 18:47:52,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 18:47:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 18:47:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 18:47:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 18:47:52,183 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 18:47:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:52,319 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-20 18:47:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 18:47:52,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2024-11-20 18:47:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:52,320 INFO L225 Difference]: With dead ends: 93 [2024-11-20 18:47:52,320 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 18:47:52,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-20 18:47:52,321 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:52,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:47:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 18:47:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2024-11-20 18:47:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 18:47:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-11-20 18:47:52,329 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2024-11-20 18:47:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:52,330 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-20 18:47:52,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 18:47:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-11-20 18:47:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 18:47:52,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:52,331 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:52,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 18:47:52,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 18:47:52,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:52,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 182070449, now seen corresponding path program 1 times [2024-11-20 18:47:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491118959] [2024-11-20 18:47:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 18:47:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 18:47:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 18:47:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491118959] [2024-11-20 18:47:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491118959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:47:52,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088169070] [2024-11-20 18:47:52,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:52,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:47:52,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 18:47:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:52,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 18:47:52,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:47:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 18:47:52,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:47:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 18:47:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088169070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 18:47:52,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 18:47:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-20 18:47:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278610909] [2024-11-20 18:47:52,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 18:47:52,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 18:47:52,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 18:47:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-20 18:47:52,864 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-20 18:47:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:53,182 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-20 18:47:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 18:47:53,182 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 43 [2024-11-20 18:47:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:53,184 INFO L225 Difference]: With dead ends: 133 [2024-11-20 18:47:53,184 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 18:47:53,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 18:47:53,185 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:53,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 18:47:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 18:47:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-20 18:47:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 18:47:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2024-11-20 18:47:53,203 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2024-11-20 18:47:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:53,205 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2024-11-20 18:47:53,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-20 18:47:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2024-11-20 18:47:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 18:47:53,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:53,210 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:53,218 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-11-20 18:47:53,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:53,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:53,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1955862377, now seen corresponding path program 2 times [2024-11-20 18:47:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799609372] [2024-11-20 18:47:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 18:47:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 18:47:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 18:47:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 18:47:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 18:47:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 18:47:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 18:47:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 18:47:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 18:47:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 18:47:53,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:53,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799609372] [2024-11-20 18:47:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799609372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:47:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814411381] [2024-11-20 18:47:53,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 18:47:53,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:53,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:47:53,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 18:47:53,709 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 18:47:53,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 18:47:53,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 18:47:53,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:47:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 18:47:53,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:47:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 18:47:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814411381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 18:47:54,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 18:47:54,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-20 18:47:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701180227] [2024-11-20 18:47:54,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 18:47:54,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-20 18:47:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-20 18:47:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 18:47:54,135 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-20 18:47:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:54,524 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-11-20 18:47:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 18:47:54,525 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2024-11-20 18:47:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:54,526 INFO L225 Difference]: With dead ends: 196 [2024-11-20 18:47:54,526 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 18:47:54,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2024-11-20 18:47:54,527 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:54,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 250 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 18:47:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 18:47:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 144. [2024-11-20 18:47:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 18:47:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2024-11-20 18:47:54,551 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2024-11-20 18:47:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2024-11-20 18:47:54,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-20 18:47:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2024-11-20 18:47:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 18:47:54,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:54,553 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:54,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 18:47:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:54,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1533400926, now seen corresponding path program 1 times [2024-11-20 18:47:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986197673] [2024-11-20 18:47:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 18:47:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 18:47:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 18:47:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 18:47:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 18:47:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 18:47:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 18:47:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 18:47:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 18:47:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 18:47:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 18:47:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 18:47:55,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:55,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986197673] [2024-11-20 18:47:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986197673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:47:55,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813965698] [2024-11-20 18:47:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:55,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:55,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:47:55,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 18:47:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:55,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 18:47:55,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:47:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 389 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 18:47:55,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:47:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 18:47:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813965698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 18:47:55,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 18:47:55,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2024-11-20 18:47:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814619055] [2024-11-20 18:47:55,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 18:47:55,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-20 18:47:55,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:55,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-20 18:47:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 18:47:55,744 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-20 18:47:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:47:56,672 INFO L93 Difference]: Finished difference Result 370 states and 444 transitions. [2024-11-20 18:47:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-20 18:47:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) Word has length 111 [2024-11-20 18:47:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:47:56,675 INFO L225 Difference]: With dead ends: 370 [2024-11-20 18:47:56,675 INFO L226 Difference]: Without dead ends: 369 [2024-11-20 18:47:56,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1659, Invalid=4661, Unknown=0, NotChecked=0, Total=6320 [2024-11-20 18:47:56,678 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 265 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 18:47:56,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 380 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 18:47:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-20 18:47:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 252. [2024-11-20 18:47:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.118279569892473) internal successors, (208), 186 states have internal predecessors, (208), 45 states have call successors, (45), 20 states have call predecessors, (45), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 18:47:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 298 transitions. [2024-11-20 18:47:56,695 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 298 transitions. Word has length 111 [2024-11-20 18:47:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:47:56,696 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 298 transitions. [2024-11-20 18:47:56,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-20 18:47:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 298 transitions. [2024-11-20 18:47:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-20 18:47:56,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:47:56,699 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 18:47:56,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 18:47:56,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 18:47:56,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:47:56,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:47:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1354925193, now seen corresponding path program 2 times [2024-11-20 18:47:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:47:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35149448] [2024-11-20 18:47:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:47:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:47:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:47:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:47:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:47:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 18:47:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 18:47:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 18:47:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 18:47:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 18:47:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 18:47:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 18:47:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 18:47:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 18:47:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 18:47:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 18:47:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 18:47:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 18:47:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 18:47:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 18:47:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 18:47:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 18:47:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 18:47:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 18:47:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 18:47:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-20 18:47:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-20 18:47:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-20 18:47:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-20 18:47:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-20 18:47:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-20 18:47:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:47:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 18:47:57,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:47:57,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35149448] [2024-11-20 18:47:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35149448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:47:57,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877306719] [2024-11-20 18:47:57,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 18:47:57,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:47:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:47:57,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:47:57,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 18:47:57,826 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 18:47:57,826 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 18:47:57,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 18:47:57,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:47:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-20 18:47:58,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:47:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 18:47:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877306719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 18:47:58,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 18:47:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 29] total 57 [2024-11-20 18:47:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774463002] [2024-11-20 18:47:58,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 18:47:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-20 18:47:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:47:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-20 18:47:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2024-11-20 18:47:58,756 INFO L87 Difference]: Start difference. First operand 252 states and 298 transitions. Second operand has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-20 18:48:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:48:00,271 INFO L93 Difference]: Finished difference Result 762 states and 904 transitions. [2024-11-20 18:48:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-20 18:48:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) Word has length 227 [2024-11-20 18:48:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:48:00,275 INFO L225 Difference]: With dead ends: 762 [2024-11-20 18:48:00,275 INFO L226 Difference]: Without dead ends: 761 [2024-11-20 18:48:00,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3474 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3562, Invalid=10244, Unknown=0, NotChecked=0, Total=13806 [2024-11-20 18:48:00,278 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 421 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 18:48:00,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 349 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 18:48:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-20 18:48:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 356. [2024-11-20 18:48:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 261 states have internal predecessors, (293), 65 states have call successors, (65), 29 states have call predecessors, (65), 29 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 18:48:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2024-11-20 18:48:00,300 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 227 [2024-11-20 18:48:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:48:00,301 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2024-11-20 18:48:00,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-20 18:48:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2024-11-20 18:48:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-20 18:48:00,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:48:00,304 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-11-20 18:48:00,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 18:48:00,508 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-11-20 18:48:00,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:48:00,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:48:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash -721746986, now seen corresponding path program 3 times [2024-11-20 18:48:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:48:00,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250254951] [2024-11-20 18:48:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:48:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:48:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 18:48:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-20 18:48:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:48:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 18:48:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 18:48:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 18:48:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 18:48:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 18:48:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 18:48:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 18:48:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 18:48:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 18:48:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 18:48:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 18:48:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 18:48:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 18:48:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 18:48:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 18:48:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 18:48:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 18:48:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 18:48:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 18:48:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-20 18:48:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-20 18:48:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-20 18:48:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 18:48:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 18:48:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 18:48:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 18:48:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-20 18:48:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-20 18:48:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-20 18:48:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-20 18:48:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-20 18:48:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:48:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 521 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-20 18:48:01,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:48:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250254951] [2024-11-20 18:48:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250254951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:48:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691055465] [2024-11-20 18:48:01,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 18:48:01,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:48:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:48:01,480 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:48:01,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 18:48:01,535 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 18:48:01,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 18:48:01,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 18:48:01,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:48:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 2426 trivial. 0 not checked. [2024-11-20 18:48:01,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 18:48:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691055465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:48:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 18:48:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-20 18:48:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045599517] [2024-11-20 18:48:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:48:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 18:48:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:48:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 18:48:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2024-11-20 18:48:01,607 INFO L87 Difference]: Start difference. First operand 356 states and 423 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 18:48:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:48:01,671 INFO L93 Difference]: Finished difference Result 364 states and 431 transitions. [2024-11-20 18:48:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 18:48:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 263 [2024-11-20 18:48:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:48:01,672 INFO L225 Difference]: With dead ends: 364 [2024-11-20 18:48:01,672 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 18:48:01,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2024-11-20 18:48:01,674 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:48:01,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:48:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 18:48:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 18:48:01,676 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-11-20 18:48:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 18:48:01,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2024-11-20 18:48:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:48:01,677 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 18:48:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 18:48:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 18:48:01,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 18:48:01,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-20 18:48:01,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-20 18:48:01,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-20 18:48:01,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-20 18:48:01,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 18:48:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:48:01,883 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:48:01,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 18:48:02,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 18:48:02,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:48:02 BoogieIcfgContainer [2024-11-20 18:48:02,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 18:48:02,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 18:48:02,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 18:48:02,676 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 18:48:02,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:50" (3/4) ... [2024-11-20 18:48:02,678 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 18:48:02,680 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-20 18:48:02,684 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-20 18:48:02,684 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 18:48:02,684 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 18:48:02,684 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 18:48:02,747 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 18:48:02,747 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 18:48:02,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 18:48:02,748 INFO L158 Benchmark]: Toolchain (without parser) took 12938.29ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 113.9MB in the beginning and 206.5MB in the end (delta: -92.6MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,749 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 18:48:02,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.18ms. Allocated memory is still 163.6MB. Free memory was 113.9MB in the beginning and 101.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.59ms. Allocated memory is still 163.6MB. Free memory was 101.3MB in the beginning and 99.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,749 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 163.6MB. Free memory was 99.9MB in the beginning and 97.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,749 INFO L158 Benchmark]: RCFGBuilder took 368.42ms. Allocated memory is still 163.6MB. Free memory was 97.9MB in the beginning and 128.1MB in the end (delta: -30.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,749 INFO L158 Benchmark]: TraceAbstraction took 12210.63ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 127.1MB in the beginning and 211.7MB in the end (delta: -84.7MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,750 INFO L158 Benchmark]: Witness Printer took 72.43ms. Allocated memory is still 356.5MB. Free memory was 211.7MB in the beginning and 206.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 18:48:02,751 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.18ms. Allocated memory is still 163.6MB. Free memory was 113.9MB in the beginning and 101.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.59ms. Allocated memory is still 163.6MB. Free memory was 101.3MB in the beginning and 99.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 163.6MB. Free memory was 99.9MB in the beginning and 97.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.42ms. Allocated memory is still 163.6MB. Free memory was 97.9MB in the beginning and 128.1MB in the end (delta: -30.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12210.63ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 127.1MB in the beginning and 211.7MB in the end (delta: -84.7MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. * Witness Printer took 72.43ms. Allocated memory is still 356.5MB. Free memory was 211.7MB in the beginning and 206.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 1810 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1484 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 326 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1404 SyntacticMatches, 0 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=11, InterpolantAutomatonStates: 258, 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, 583 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4471 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1387 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 9890/14155 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 100)) || (counter == 0)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483637)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-20 18:48:02,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE