./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound2.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 603eeec29f0f7a499f451ec7fa1906f0a8c90a729e0fc96740e12a91ea711946 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:20:45,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:20:45,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:20:45,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:20:45,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:20:45,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:20:45,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:20:45,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:20:45,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:20:45,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:20:45,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:20:45,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:20:45,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:20:45,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:20:45,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:20:45,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:20:45,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:20:45,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:20:45,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:20:45,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:20:45,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:20:45,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:20:45,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:20:45,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:20:45,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:20:45,767 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:20:45,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:20:45,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:20:45,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:20:45,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:20:45,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:20:45,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:20:45,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:20:45,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:20:45,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:20:45,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:20:45,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:20:45,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:20:45,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:20:45,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:20:45,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:20:45,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:20:45,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:20:45,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:20:45,772 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 -> 603eeec29f0f7a499f451ec7fa1906f0a8c90a729e0fc96740e12a91ea711946 [2024-11-10 19:20:45,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:20:45,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:20:45,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:20:45,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:20:45,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:20:45,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound2.c [2024-11-10 19:20:47,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:20:47,437 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:20:47,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound2.c [2024-11-10 19:20:47,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e58754d7/b72dc95302204215b1cb635a0f94ba47/FLAG26a6c4b3c [2024-11-10 19:20:47,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e58754d7/b72dc95302204215b1cb635a0f94ba47 [2024-11-10 19:20:47,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:20:47,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:20:47,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:20:47,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:20:47,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:20:47,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:20:47" (1/1) ... [2024-11-10 19:20:47,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cbc4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:47, skipping insertion in model container [2024-11-10 19:20:47,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:20:47" (1/1) ... [2024-11-10 19:20:47,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:20:48,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:20:48,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:20:48,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:20:48,096 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:20:48,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48 WrapperNode [2024-11-10 19:20:48,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:20:48,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:20:48,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:20:48,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:20:48,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,122 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-10 19:20:48,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:20:48,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:20:48,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:20:48,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:20:48,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,141 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-10 19:20:48,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:20:48,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:20:48,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:20:48,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:20:48,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (1/1) ... [2024-11-10 19:20:48,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:20:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:48,187 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-10 19:20:48,192 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-10 19:20:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:20:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:20:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:20:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:20:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:20:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:20:48,297 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:20:48,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:20:48,498 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 19:20:48,498 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:20:48,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:20:48,513 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:20:48,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:20:48 BoogieIcfgContainer [2024-11-10 19:20:48,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:20:48,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:20:48,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:20:48,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:20:48,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:20:47" (1/3) ... [2024-11-10 19:20:48,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b30b251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:20:48, skipping insertion in model container [2024-11-10 19:20:48,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:48" (2/3) ... [2024-11-10 19:20:48,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b30b251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:20:48, skipping insertion in model container [2024-11-10 19:20:48,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:20:48" (3/3) ... [2024-11-10 19:20:48,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound2.c [2024-11-10 19:20:48,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:20:48,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 19:20:48,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:20:48,593 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;@2a0d9348, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:20:48,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 19:20:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.52) internal successors, (38), 29 states have internal predecessors, (38), 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-10 19:20:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:20:48,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:48,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:20:48,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:48,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:48,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2128991902, now seen corresponding path program 1 times [2024-11-10 19:20:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:48,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5306194] [2024-11-10 19:20:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:48,779 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-10 19:20:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5306194] [2024-11-10 19:20:48,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5306194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:20:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:20:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634557271] [2024-11-10 19:20:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:48,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:20:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:48,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:20:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:20:48,812 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.52) internal successors, (38), 29 states have internal predecessors, (38), 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-10 19:20:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:48,832 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2024-11-10 19:20:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:20:48,834 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-10 19:20:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:48,838 INFO L225 Difference]: With dead ends: 72 [2024-11-10 19:20:48,838 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 19:20:48,841 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-10 19:20:48,844 INFO L432 NwaCegarLoop]: 47 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, 47 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-10 19:20:48,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:20:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 19:20:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 19:20:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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-10 19:20:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-10 19:20:48,876 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 6 [2024-11-10 19:20:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:48,876 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-10 19:20:48,877 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-10 19:20:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-10 19:20:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:20:48,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:48,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:20:48,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:20:48,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:48,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2129021693, now seen corresponding path program 1 times [2024-11-10 19:20:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926864994] [2024-11-10 19:20:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:48,980 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-10 19:20:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926864994] [2024-11-10 19:20:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926864994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:20:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:20:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879313729] [2024-11-10 19:20:48,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:48,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:20:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:20:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:20:48,986 INFO L87 Difference]: Start difference. First operand 30 states and 37 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-10 19:20:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:49,030 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-10 19:20:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:20:49,031 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-10 19:20:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:49,032 INFO L225 Difference]: With dead ends: 40 [2024-11-10 19:20:49,032 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 19:20:49,032 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-10 19:20:49,033 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:49,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:20:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 19:20:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-11-10 19:20:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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-10 19:20:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-10 19:20:49,039 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 6 [2024-11-10 19:20:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:49,040 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-10 19:20:49,040 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-10 19:20:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-10 19:20:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 19:20:49,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:49,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:49,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:20:49,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:49,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1575163045, now seen corresponding path program 1 times [2024-11-10 19:20:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866088453] [2024-11-10 19:20:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,139 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-10 19:20:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866088453] [2024-11-10 19:20:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866088453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:49,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:20:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:20:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102096376] [2024-11-10 19:20:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:49,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:20:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:20:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:20:49,141 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-10 19:20:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:49,177 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-10 19:20:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:20:49,177 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-10 19:20:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:49,178 INFO L225 Difference]: With dead ends: 54 [2024-11-10 19:20:49,178 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 19:20:49,179 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-10 19:20:49,180 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:49,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:20:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 19:20:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 19:20:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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-10 19:20:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-10 19:20:49,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2024-11-10 19:20:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:49,191 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-10 19:20:49,192 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-10 19:20:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-10 19:20:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 19:20:49,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:49,192 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-10 19:20:49,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:20:49,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:49,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 859308786, now seen corresponding path program 1 times [2024-11-10 19:20:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468931980] [2024-11-10 19:20:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,347 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-10 19:20:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468931980] [2024-11-10 19:20:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468931980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:20:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:20:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332472809] [2024-11-10 19:20:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:20:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:20:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:20:49,351 INFO L87 Difference]: Start difference. First operand 38 states and 44 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-10 19:20:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:49,438 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-10 19:20:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:20:49,439 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-10 19:20:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:49,439 INFO L225 Difference]: With dead ends: 38 [2024-11-10 19:20:49,441 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 19:20:49,441 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-10 19:20:49,442 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:49,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 67 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:20:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 19:20:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 19:20:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 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-10 19:20:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-10 19:20:49,451 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2024-11-10 19:20:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-10 19:20:49,452 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-10 19:20:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-10 19:20:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 19:20:49,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:49,453 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:49,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:20:49,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:49,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 868768576, now seen corresponding path program 1 times [2024-11-10 19:20:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512277441] [2024-11-10 19:20:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,591 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-10 19:20:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512277441] [2024-11-10 19:20:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512277441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:49,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:20:49,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:20:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717017645] [2024-11-10 19:20:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:20:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:49,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:20:49,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:20:49,594 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:20:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:49,697 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-10 19:20:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:20:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-10 19:20:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:49,698 INFO L225 Difference]: With dead ends: 56 [2024-11-10 19:20:49,698 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 19:20:49,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:20:49,699 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:49,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:20:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 19:20:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-11-10 19:20:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 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-10 19:20:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-11-10 19:20:49,706 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 28 [2024-11-10 19:20:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:49,707 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-11-10 19:20:49,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:20:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-11-10 19:20:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 19:20:49,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:49,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:49,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:20:49,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 868844046, now seen corresponding path program 1 times [2024-11-10 19:20:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575921327] [2024-11-10 19:20:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,781 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-10 19:20:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575921327] [2024-11-10 19:20:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575921327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:20:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031081763] [2024-11-10 19:20:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:20:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:49,786 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-10 19:20:49,792 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-10 19:20:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:49,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:20:49,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:20:49,914 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-10 19:20:49,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:20:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031081763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:20:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-10 19:20:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070651257] [2024-11-10 19:20:49,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:49,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:20:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:49,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:20:49,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:20:49,917 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:20:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:49,958 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-10 19:20:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:20:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-10 19:20:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:49,960 INFO L225 Difference]: With dead ends: 53 [2024-11-10 19:20:49,960 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 19:20:49,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 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-10 19:20:49,961 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:49,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:20:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 19:20:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-10 19:20:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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-10 19:20:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-10 19:20:49,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 28 [2024-11-10 19:20:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:49,975 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-10 19:20:49,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:20:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-10 19:20:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 19:20:49,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:49,976 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:49,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 19:20:50,177 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-10 19:20:50,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1345776952, now seen corresponding path program 1 times [2024-11-10 19:20:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:50,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898214077] [2024-11-10 19:20:50,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:20:50,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:50,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898214077] [2024-11-10 19:20:50,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898214077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:20:50,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146527006] [2024-11-10 19:20:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:20:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:50,308 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-10 19:20:50,309 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-10 19:20:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:20:50,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:20:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:20:50,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:20:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:20:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146527006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:20:50,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:20:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2024-11-10 19:20:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219477094] [2024-11-10 19:20:50,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:20:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:20:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:20:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:20:50,438 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 19:20:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:50,505 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-11-10 19:20:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:20:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 33 [2024-11-10 19:20:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:50,506 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:20:50,506 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 19:20:50,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:20:50,507 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:50,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 112 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:20:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 19:20:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-10 19:20:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 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-10 19:20:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-11-10 19:20:50,517 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 33 [2024-11-10 19:20:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:50,518 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-10 19:20:50,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-10 19:20:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-10 19:20:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 19:20:50,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:50,519 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, 1, 1] [2024-11-10 19:20:50,532 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-10 19:20:50,723 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-10 19:20:50,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1898105406, now seen corresponding path program 1 times [2024-11-10 19:20:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444967069] [2024-11-10 19:20:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 19:20:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 19:20:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,882 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-10 19:20:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444967069] [2024-11-10 19:20:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444967069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:20:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614972833] [2024-11-10 19:20:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:50,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:20:50,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:50,889 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-10 19:20:50,897 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-10 19:20:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:50,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:20:50,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:20:50,996 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-10 19:20:50,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:20:51,079 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-10 19:20:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614972833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:20:51,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:20:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-11-10 19:20:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735728965] [2024-11-10 19:20:51,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:20:51,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 19:20:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 19:20:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-10 19:20:51,081 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-10 19:20:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:51,301 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2024-11-10 19:20:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 19:20:51,302 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 45 [2024-11-10 19:20:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:51,303 INFO L225 Difference]: With dead ends: 106 [2024-11-10 19:20:51,305 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 19:20:51,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2024-11-10 19:20:51,306 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 89 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:51,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 154 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:20:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 19:20:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-10 19:20:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.1125) internal successors, (89), 80 states have internal predecessors, (89), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 19:20:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2024-11-10 19:20:51,315 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 45 [2024-11-10 19:20:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2024-11-10 19:20:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-10 19:20:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2024-11-10 19:20:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 19:20:51,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:51,316 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:51,333 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-10 19:20:51,517 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-10 19:20:51,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:51,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1485905649, now seen corresponding path program 2 times [2024-11-10 19:20:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599794450] [2024-11-10 19:20:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 19:20:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 19:20:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 19:20:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 19:20:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:51,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599794450] [2024-11-10 19:20:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599794450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:20:51,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61491401] [2024-11-10 19:20:51,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:20:51,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:20:51,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:51,647 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-10 19:20:51,651 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-10 19:20:51,693 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:20:51,693 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:20:51,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:20:51,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:20:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:20:51,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:20:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 19:20:51,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61491401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:20:51,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:20:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-11-10 19:20:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084511552] [2024-11-10 19:20:51,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:20:51,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 19:20:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:51,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 19:20:51,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-10 19:20:51,908 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-10 19:20:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:52,153 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2024-11-10 19:20:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 19:20:52,153 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 54 [2024-11-10 19:20:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:52,155 INFO L225 Difference]: With dead ends: 165 [2024-11-10 19:20:52,156 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 19:20:52,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 19:20:52,157 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 106 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:52,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 224 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:20:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 19:20:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2024-11-10 19:20:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.1125) internal successors, (89), 80 states have internal predecessors, (89), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 19:20:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2024-11-10 19:20:52,181 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 54 [2024-11-10 19:20:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:52,185 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2024-11-10 19:20:52,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-10 19:20:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2024-11-10 19:20:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 19:20:52,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:52,187 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:52,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:20:52,388 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-10 19:20:52,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:52,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1171177261, now seen corresponding path program 1 times [2024-11-10 19:20:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:52,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301768329] [2024-11-10 19:20:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 19:20:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 19:20:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 19:20:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 19:20:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 19:20:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 19:20:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 19:20:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 19:20:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 19:20:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-10 19:20:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301768329] [2024-11-10 19:20:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301768329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:20:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530227546] [2024-11-10 19:20:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:52,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:20:52,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:52,568 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-10 19:20:52,569 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-10 19:20:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:20:52,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:20:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-10 19:20:52,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:20:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530227546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:20:52,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:20:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-10 19:20:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972087031] [2024-11-10 19:20:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:20:52,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:20:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:20:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:20:52,646 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:20:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:52,679 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2024-11-10 19:20:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:20:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 105 [2024-11-10 19:20:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:52,681 INFO L225 Difference]: With dead ends: 147 [2024-11-10 19:20:52,681 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 19:20:52,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:20:52,682 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:52,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:20:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 19:20:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-11-10 19:20:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 75 states have internal predecessors, (83), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 19:20:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2024-11-10 19:20:52,696 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 105 [2024-11-10 19:20:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:52,697 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2024-11-10 19:20:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:20:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2024-11-10 19:20:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 19:20:52,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:20:52,699 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:52,714 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-10 19:20:52,899 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-10 19:20:52,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:20:52,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:20:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1043238210, now seen corresponding path program 2 times [2024-11-10 19:20:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:20:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726082689] [2024-11-10 19:20:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:20:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:20:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:20:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 19:20:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:20:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 19:20:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 19:20:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 19:20:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 19:20:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 19:20:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 19:20:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 19:20:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 19:20:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 19:20:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 19:20:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:20:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2024-11-10 19:20:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:20:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726082689] [2024-11-10 19:20:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726082689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:20:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054763583] [2024-11-10 19:20:53,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:20:53,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:20:53,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:20:53,013 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-10 19:20:53,013 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-10 19:20:53,066 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:20:53,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:20:53,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:20:53,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:20:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 240 proven. 1 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-10 19:20:53,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:20:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-10 19:20:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054763583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:20:53,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:20:53,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2024-11-10 19:20:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741906933] [2024-11-10 19:20:53,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:20:53,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 19:20:53,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:20:53,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 19:20:53,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:20:53,244 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 6 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-10 19:20:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:20:53,367 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2024-11-10 19:20:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:20:53,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 6 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 113 [2024-11-10 19:20:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:20:53,368 INFO L225 Difference]: With dead ends: 117 [2024-11-10 19:20:53,368 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:20:53,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 241 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-11-10 19:20:53,369 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:20:53,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 147 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:20:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:20:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:20:53,370 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-10 19:20:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:20:53,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-11-10 19:20:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:20:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:20:53,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 6 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-10 19:20:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:20:53,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:20:53,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 19:20:53,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 19:20:53,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 19:20:53,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 19:20:53,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 19:20:53,573 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-10 19:20:53,576 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:20:53,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:20:53,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:20:53,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:20:53 BoogieIcfgContainer [2024-11-10 19:20:53,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:20:53,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:20:53,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:20:53,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:20:53,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:20:48" (3/4) ... [2024-11-10 19:20:53,652 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:20:53,654 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:20:53,656 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-10 19:20:53,657 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 19:20:53,657 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:20:53,657 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:20:53,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:20:53,732 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:20:53,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:20:53,732 INFO L158 Benchmark]: Toolchain (without parser) took 5862.49ms. Allocated memory was 146.8MB in the beginning and 281.0MB in the end (delta: 134.2MB). Free memory was 77.5MB in the beginning and 200.7MB in the end (delta: -123.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-10 19:20:53,732 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:20:53,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.95ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 64.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:20:53,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.37ms. Allocated memory is still 146.8MB. Free memory was 64.9MB in the beginning and 63.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:20:53,733 INFO L158 Benchmark]: Boogie Preprocessor took 23.68ms. Allocated memory is still 146.8MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:20:53,733 INFO L158 Benchmark]: IcfgBuilder took 366.13ms. Allocated memory is still 146.8MB. Free memory was 61.5MB in the beginning and 48.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:20:53,733 INFO L158 Benchmark]: TraceAbstraction took 5134.37ms. Allocated memory was 146.8MB in the beginning and 281.0MB in the end (delta: 134.2MB). Free memory was 48.2MB in the beginning and 204.9MB in the end (delta: -156.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:20:53,733 INFO L158 Benchmark]: Witness Printer took 82.12ms. Allocated memory is still 281.0MB. Free memory was 204.9MB in the beginning and 200.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:20:53,734 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.16ms. Allocated memory is still 146.8MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.95ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 64.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.37ms. Allocated memory is still 146.8MB. Free memory was 64.9MB in the beginning and 63.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.68ms. Allocated memory is still 146.8MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 366.13ms. Allocated memory is still 146.8MB. Free memory was 61.5MB in the beginning and 48.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5134.37ms. Allocated memory was 146.8MB in the beginning and 281.0MB in the end (delta: 134.2MB). Free memory was 48.2MB in the beginning and 204.9MB in the end (delta: -156.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 82.12ms. Allocated memory is still 281.0MB. Free memory was 204.9MB in the beginning and 200.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 358 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 1207 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 895 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 312 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 679 SyntacticMatches, 9 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=8, InterpolantAutomatonStates: 100, 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, 11 MinimizatonAttempts, 85 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 830 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1054 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920 SizeOfPredicates, 18 NumberOfNonLiveVariables, 880 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 2221/2360 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: 23]: Location Invariant Derived location invariant: (((counter == 3) || (counter == 1)) || (counter == 2)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: null - 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-10 19:20:53,753 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