./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 91dfff3356c8586e4ab54260d22ce3d78ead2ec4d531619c6564036666f10187 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:56:30,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:56:30,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:56:30,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:56:30,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:56:30,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:56:30,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:56:30,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:56:30,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:56:30,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:56:30,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:56:30,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:56:30,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:56:30,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:56:30,488 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:56:30,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:56:30,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:56:30,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:56:30,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:56:30,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:56:30,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:56:30,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:56:30,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:56:30,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:56:30,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:56:30,492 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:56:30,492 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:56:30,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:56:30,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:56:30,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:56:30,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:56:30,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:56:30,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:56:30,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:56:30,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:56:30,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:56:30,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:56:30,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:56:30,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:56:30,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:56:30,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:56:30,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:56:30,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:56:30,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:56:30,496 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-clean/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-clean/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 -> 91dfff3356c8586e4ab54260d22ce3d78ead2ec4d531619c6564036666f10187 [2024-10-11 20:56:30,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:56:30,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:56:30,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:56:30,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:56:30,730 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:56:30,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c [2024-10-11 20:56:31,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:56:32,112 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:56:32,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c [2024-10-11 20:56:32,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91b434c24/1a77a2b5530446209edb4801d8b3bc62/FLAGa7830b067 [2024-10-11 20:56:32,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91b434c24/1a77a2b5530446209edb4801d8b3bc62 [2024-10-11 20:56:32,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:56:32,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:56:32,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:56:32,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:56:32,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:56:32,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f5958d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32, skipping insertion in model container [2024-10-11 20:56:32,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:56:32,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:56:32,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:56:32,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:56:32,751 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:56:32,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32 WrapperNode [2024-10-11 20:56:32,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:56:32,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:56:32,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:56:32,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:56:32,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,778 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-10-11 20:56:32,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:56:32,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:56:32,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:56:32,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:56:32,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,825 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:56:32,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:56:32,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:56:32,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:56:32,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:56:32,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (1/1) ... [2024-10-11 20:56:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:56:32,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:32,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:56:32,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:56:32,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:56:32,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:56:32,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:56:32,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:56:32,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:56:32,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:56:32,985 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:56:32,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:56:33,132 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 20:56:33,133 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:56:33,164 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:56:33,164 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:56:33,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:33 BoogieIcfgContainer [2024-10-11 20:56:33,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:56:33,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:56:33,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:56:33,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:56:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:56:32" (1/3) ... [2024-10-11 20:56:33,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c0cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:56:33, skipping insertion in model container [2024-10-11 20:56:33,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:32" (2/3) ... [2024-10-11 20:56:33,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c0cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:56:33, skipping insertion in model container [2024-10-11 20:56:33,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:33" (3/3) ... [2024-10-11 20:56:33,173 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound10.c [2024-10-11 20:56:33,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:56:33,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:56:33,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:56:33,251 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;@4e1ba1e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:56:33,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:56:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:56:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:56:33,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:33,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:56:33,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:33,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash 118368741, now seen corresponding path program 1 times [2024-10-11 20:56:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906672655] [2024-10-11 20:56:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:56:33,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906672655] [2024-10-11 20:56:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906672655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:56:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773420444] [2024-10-11 20:56:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:56:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:56:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:56:33,414 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:33,433 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2024-10-11 20:56:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:56:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-10-11 20:56:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:33,440 INFO L225 Difference]: With dead ends: 60 [2024-10-11 20:56:33,440 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:56:33,442 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-10-11 20:56:33,445 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:33,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:56:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:56:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:56:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-11 20:56:33,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 5 [2024-10-11 20:56:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-11 20:56:33,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-11 20:56:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:56:33,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:33,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:56:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:56:33,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:33,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash 118428323, now seen corresponding path program 1 times [2024-10-11 20:56:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511105702] [2024-10-11 20:56:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:56:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511105702] [2024-10-11 20:56:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511105702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:33,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:56:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869089186] [2024-10-11 20:56:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:33,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:56:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:56:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:56:33,575 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:33,618 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-10-11 20:56:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:56:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-11 20:56:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:33,619 INFO L225 Difference]: With dead ends: 47 [2024-10-11 20:56:33,619 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:56:33,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:56:33,620 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:33,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:56:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 20:56:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:56:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 20:56:33,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 5 [2024-10-11 20:56:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:33,626 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 20:56:33,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 20:56:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:56:33,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:33,628 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:33,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:56:33,628 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-10-11 20:56:33,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:33,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1994096058, now seen corresponding path program 1 times [2024-10-11 20:56:33,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:33,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606253768] [2024-10-11 20:56:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:33,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606253768] [2024-10-11 20:56:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606253768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:56:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716518506] [2024-10-11 20:56:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:56:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:56:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:56:33,830 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:33,933 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-10-11 20:56:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-11 20:56:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:33,938 INFO L225 Difference]: With dead ends: 54 [2024-10-11 20:56:33,938 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 20:56:33,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:33,940 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:33,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 113 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 20:56:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-10-11 20:56:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:56:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-11 20:56:33,955 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 25 [2024-10-11 20:56:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:33,956 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-11 20:56:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-11 20:56:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:56:33,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:33,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:33,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:56:33,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:33,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1994094904, now seen corresponding path program 1 times [2024-10-11 20:56:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975064070] [2024-10-11 20:56:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975064070] [2024-10-11 20:56:34,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975064070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772831090] [2024-10-11 20:56:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:34,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:34,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:34,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:34,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:56:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:56:34,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:34,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772831090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-10-11 20:56:34,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425474604] [2024-10-11 20:56:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:34,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:56:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:56:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:34,237 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:34,297 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-10-11 20:56:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-11 20:56:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:34,298 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:56:34,298 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:56:34,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:56:34,299 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:34,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:56:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-10-11 20:56:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:56:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-10-11 20:56:34,315 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 25 [2024-10-11 20:56:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:34,316 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-10-11 20:56:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-10-11 20:56:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:56:34,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:34,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:34,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:34,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:34,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:34,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435582, now seen corresponding path program 1 times [2024-10-11 20:56:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:34,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730305308] [2024-10-11 20:56:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730305308] [2024-10-11 20:56:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730305308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:34,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:56:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:56:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910353730] [2024-10-11 20:56:34,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:34,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:56:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:34,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:56:34,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:56:34,625 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:34,682 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-10-11 20:56:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:56:34,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-11 20:56:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:34,683 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:56:34,683 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:56:34,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:34,684 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:34,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:56:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2024-10-11 20:56:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:56:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-10-11 20:56:34,691 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 26 [2024-10-11 20:56:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:34,691 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-10-11 20:56:34,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:56:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-10-11 20:56:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:56:34,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:34,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:34,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:56:34,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:34,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1687399832, now seen corresponding path program 1 times [2024-10-11 20:56:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298143959] [2024-10-11 20:56:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298143959] [2024-10-11 20:56:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298143959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456549575] [2024-10-11 20:56:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:34,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:34,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:56:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:34,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:56:34,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:34,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:56:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456549575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:34,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:34,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 12 [2024-10-11 20:56:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670005348] [2024-10-11 20:56:34,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:34,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:56:34,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:56:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:56:34,921 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 20:56:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:35,055 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2024-10-11 20:56:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:56:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 26 [2024-10-11 20:56:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:35,056 INFO L225 Difference]: With dead ends: 109 [2024-10-11 20:56:35,056 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 20:56:35,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:56:35,057 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:35,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 161 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 20:56:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-10-11 20:56:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 20:56:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-10-11 20:56:35,075 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 26 [2024-10-11 20:56:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:35,076 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-10-11 20:56:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 20:56:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2024-10-11 20:56:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:56:35,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:35,078 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] [2024-10-11 20:56:35,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:35,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash -339875692, now seen corresponding path program 1 times [2024-10-11 20:56:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309683439] [2024-10-11 20:56:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:56:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309683439] [2024-10-11 20:56:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309683439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227206487] [2024-10-11 20:56:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:35,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:35,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:56:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:35,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:56:35,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:56:35,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:56:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227206487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:35,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-10-11 20:56:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122855841] [2024-10-11 20:56:35,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:35,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:56:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:56:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:56:35,687 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 20:56:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:35,902 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-10-11 20:56:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 20:56:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 42 [2024-10-11 20:56:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:35,904 INFO L225 Difference]: With dead ends: 138 [2024-10-11 20:56:35,904 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 20:56:35,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:56:35,905 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:35,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 201 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 20:56:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-10-11 20:56:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.183673469387755) internal successors, (116), 100 states have internal predecessors, (116), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:56:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2024-10-11 20:56:35,926 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 42 [2024-10-11 20:56:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:35,926 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2024-10-11 20:56:35,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 20:56:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2024-10-11 20:56:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:56:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:35,928 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:35,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:56:36,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:36,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:36,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1343451627, now seen corresponding path program 1 times [2024-10-11 20:56:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:36,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552713536] [2024-10-11 20:56:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:56:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552713536] [2024-10-11 20:56:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552713536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574014984] [2024-10-11 20:56:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:36,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:36,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:36,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:36,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:56:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:56:36,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:56:36,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574014984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-10-11 20:56:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704772147] [2024-10-11 20:56:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:36,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:56:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:56:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:56:36,367 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:36,463 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2024-10-11 20:56:36,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:56:36,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-10-11 20:56:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:36,464 INFO L225 Difference]: With dead ends: 136 [2024-10-11 20:56:36,464 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 20:56:36,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:56:36,466 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:36,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 20:56:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2024-10-11 20:56:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.155844155844156) internal successors, (89), 78 states have internal predecessors, (89), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:56:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2024-10-11 20:56:36,482 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 45 [2024-10-11 20:56:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:36,485 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2024-10-11 20:56:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2024-10-11 20:56:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 20:56:36,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:36,486 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:36,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:56:36,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:56:36,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:36,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -597482282, now seen corresponding path program 1 times [2024-10-11 20:56:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533297786] [2024-10-11 20:56:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:56:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533297786] [2024-10-11 20:56:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533297786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639852612] [2024-10-11 20:56:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:36,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:36,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:56:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:36,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:56:36,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:56:36,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:56:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639852612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:36,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:36,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 17 [2024-10-11 20:56:36,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394673932] [2024-10-11 20:56:36,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:36,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:56:36,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:56:36,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:56:36,959 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 20:56:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:37,161 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2024-10-11 20:56:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 20:56:37,162 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 50 [2024-10-11 20:56:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:37,166 INFO L225 Difference]: With dead ends: 161 [2024-10-11 20:56:37,166 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 20:56:37,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:56:37,167 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:37,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 196 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 20:56:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2024-10-11 20:56:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 95 states have internal predecessors, (107), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 20:56:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2024-10-11 20:56:37,181 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 159 transitions. Word has length 50 [2024-10-11 20:56:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:37,182 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 159 transitions. [2024-10-11 20:56:37,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 20:56:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2024-10-11 20:56:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 20:56:37,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:37,183 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:37,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:56:37,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:37,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:37,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1181186760, now seen corresponding path program 1 times [2024-10-11 20:56:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127660058] [2024-10-11 20:56:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:56:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127660058] [2024-10-11 20:56:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127660058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41273825] [2024-10-11 20:56:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:37,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:37,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:56:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:37,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:56:37,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:56:37,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:56:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41273825] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:37,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2024-10-11 20:56:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565671752] [2024-10-11 20:56:37,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:37,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 20:56:37,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 20:56:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:56:37,788 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2024-10-11 20:56:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:38,102 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2024-10-11 20:56:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 20:56:38,102 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 66 [2024-10-11 20:56:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:38,104 INFO L225 Difference]: With dead ends: 184 [2024-10-11 20:56:38,104 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 20:56:38,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 20:56:38,105 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 112 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:38,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 265 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:56:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 20:56:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 140. [2024-10-11 20:56:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 99 states have internal predecessors, (112), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:56:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2024-10-11 20:56:38,121 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 66 [2024-10-11 20:56:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:38,122 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2024-10-11 20:56:38,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2024-10-11 20:56:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2024-10-11 20:56:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 20:56:38,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:38,126 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:38,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:38,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:56:38,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -982876319, now seen corresponding path program 1 times [2024-10-11 20:56:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136678364] [2024-10-11 20:56:38,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:56:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:56:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:56:38,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136678364] [2024-10-11 20:56:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136678364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190856233] [2024-10-11 20:56:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:38,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:38,553 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:38,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:56:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:38,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:56:38,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 20:56:38,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 20:56:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190856233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:38,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 24 [2024-10-11 20:56:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467184283] [2024-10-11 20:56:38,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:38,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:56:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:56:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:56:38,876 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 8 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-11 20:56:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:39,233 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2024-10-11 20:56:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 20:56:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 8 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 78 [2024-10-11 20:56:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:39,236 INFO L225 Difference]: With dead ends: 225 [2024-10-11 20:56:39,236 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 20:56:39,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=485, Invalid=1585, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 20:56:39,237 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 129 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:39,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 180 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:56:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 20:56:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 164. [2024-10-11 20:56:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 117 states have internal predecessors, (132), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:56:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2024-10-11 20:56:39,253 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 78 [2024-10-11 20:56:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:39,254 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2024-10-11 20:56:39,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 8 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-10-11 20:56:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2024-10-11 20:56:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 20:56:39,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:39,256 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 20:56:39,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:56:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:39,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:39,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2071083694, now seen corresponding path program 2 times [2024-10-11 20:56:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:39,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512998896] [2024-10-11 20:56:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 20:56:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 20:56:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:56:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:56:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:56:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512998896] [2024-10-11 20:56:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512998896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65906268] [2024-10-11 20:56:39,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:39,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:39,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:39,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:39,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:56:39,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:56:39,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:39,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:56:39,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:56:39,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:56:40,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65906268] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:40,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 32 [2024-10-11 20:56:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168966106] [2024-10-11 20:56:40,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:40,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 20:56:40,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:40,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 20:56:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 20:56:40,227 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 12 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 12 states have call predecessors, (45), 12 states have call successors, (45) [2024-10-11 20:56:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:40,846 INFO L93 Difference]: Finished difference Result 292 states and 348 transitions. [2024-10-11 20:56:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 20:56:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 12 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 12 states have call predecessors, (45), 12 states have call successors, (45) Word has length 114 [2024-10-11 20:56:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:40,848 INFO L225 Difference]: With dead ends: 292 [2024-10-11 20:56:40,848 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 20:56:40,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=922, Invalid=3110, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 20:56:40,851 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 165 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:40,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:56:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 20:56:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 188. [2024-10-11 20:56:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.1343283582089552) internal successors, (152), 135 states have internal predecessors, (152), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 20:56:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 226 transitions. [2024-10-11 20:56:40,867 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 226 transitions. Word has length 114 [2024-10-11 20:56:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:40,868 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 226 transitions. [2024-10-11 20:56:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 33 states have internal predecessors, (106), 12 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 12 states have call predecessors, (45), 12 states have call successors, (45) [2024-10-11 20:56:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 226 transitions. [2024-10-11 20:56:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 20:56:40,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:40,871 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-10-11 20:56:40,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:56:41,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:56:41,073 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1254225999, now seen corresponding path program 2 times [2024-10-11 20:56:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687923274] [2024-10-11 20:56:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 20:56:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687923274] [2024-10-11 20:56:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687923274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022889918] [2024-10-11 20:56:41,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:41,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:41,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:41,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:41,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:56:41,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:56:41,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:41,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:56:41,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 20:56:41,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 20:56:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022889918] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:41,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 32 [2024-10-11 20:56:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154637116] [2024-10-11 20:56:41,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:41,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 20:56:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:41,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 20:56:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 20:56:41,765 INFO L87 Difference]: Start difference. First operand 188 states and 226 transitions. Second operand has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 12 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 12 states have call predecessors, (54), 12 states have call successors, (54) [2024-10-11 20:56:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:42,304 INFO L93 Difference]: Finished difference Result 332 states and 407 transitions. [2024-10-11 20:56:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 20:56:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 12 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 12 states have call predecessors, (54), 12 states have call successors, (54) Word has length 126 [2024-10-11 20:56:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:42,306 INFO L225 Difference]: With dead ends: 332 [2024-10-11 20:56:42,306 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 20:56:42,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1084, Invalid=2338, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 20:56:42,307 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 259 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:42,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 275 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:56:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 20:56:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 275. [2024-10-11 20:56:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.160621761658031) internal successors, (224), 194 states have internal predecessors, (224), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 20:56:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2024-10-11 20:56:42,321 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 126 [2024-10-11 20:56:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:42,321 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2024-10-11 20:56:42,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 12 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 12 states have call predecessors, (54), 12 states have call successors, (54) [2024-10-11 20:56:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2024-10-11 20:56:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 20:56:42,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:42,323 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:42,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:42,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1500608548, now seen corresponding path program 2 times [2024-10-11 20:56:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064953674] [2024-10-11 20:56:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:56:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:56:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:56:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:56:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:42,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064953674] [2024-10-11 20:56:42,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064953674] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:42,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524268303] [2024-10-11 20:56:42,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:42,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:42,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:56:42,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:56:42,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:42,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:56:42,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-10-11 20:56:42,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524268303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:42,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:42,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2024-10-11 20:56:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763485399] [2024-10-11 20:56:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:42,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:56:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:56:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:56:42,922 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:42,979 INFO L93 Difference]: Finished difference Result 284 states and 349 transitions. [2024-10-11 20:56:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:42,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 146 [2024-10-11 20:56:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:42,981 INFO L225 Difference]: With dead ends: 284 [2024-10-11 20:56:42,981 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 20:56:42,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:56:42,982 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:42,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 20:56:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-10-11 20:56:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.160621761658031) internal successors, (224), 194 states have internal predecessors, (224), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 20:56:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2024-10-11 20:56:42,999 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 146 [2024-10-11 20:56:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:42,999 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2024-10-11 20:56:42,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2024-10-11 20:56:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 20:56:43,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:43,001 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:43,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:56:43,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:56:43,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2047916611, now seen corresponding path program 2 times [2024-10-11 20:56:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328991488] [2024-10-11 20:56:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:56:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:56:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:56:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:56:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328991488] [2024-10-11 20:56:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328991488] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278685953] [2024-10-11 20:56:43,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:56:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:43,502 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:43,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:56:43,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:56:43,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:43,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 20:56:43,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 952 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 20:56:43,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:56:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278685953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:44,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 41 [2024-10-11 20:56:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634425145] [2024-10-11 20:56:44,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:44,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 20:56:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 20:56:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 20:56:44,067 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 14 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 14 states have call predecessors, (63), 14 states have call successors, (63) [2024-10-11 20:56:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:45,012 INFO L93 Difference]: Finished difference Result 419 states and 512 transitions. [2024-10-11 20:56:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 20:56:45,013 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 14 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 14 states have call predecessors, (63), 14 states have call successors, (63) Word has length 150 [2024-10-11 20:56:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:45,016 INFO L225 Difference]: With dead ends: 419 [2024-10-11 20:56:45,016 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 20:56:45,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1903, Invalid=6107, Unknown=0, NotChecked=0, Total=8010 [2024-10-11 20:56:45,021 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 347 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:45,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 289 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:56:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 20:56:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 300. [2024-10-11 20:56:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 210 states have (on average 1.1666666666666667) internal successors, (245), 211 states have internal predecessors, (245), 64 states have call successors, (64), 24 states have call predecessors, (64), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 20:56:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 373 transitions. [2024-10-11 20:56:45,043 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 373 transitions. Word has length 150 [2024-10-11 20:56:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:45,044 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 373 transitions. [2024-10-11 20:56:45,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 14 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 14 states have call predecessors, (63), 14 states have call successors, (63) [2024-10-11 20:56:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 373 transitions. [2024-10-11 20:56:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 20:56:45,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:45,046 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-11 20:56:45,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:45,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:56:45,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:45,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2087789957, now seen corresponding path program 3 times [2024-10-11 20:56:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:45,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813941054] [2024-10-11 20:56:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 20:56:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:56:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 20:56:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:56:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:56:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 20:56:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 20:56:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813941054] [2024-10-11 20:56:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813941054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133566496] [2024-10-11 20:56:45,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:56:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:45,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:45,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:56:45,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:56:45,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:45,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:56:45,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-10-11 20:56:45,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:45,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133566496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:45,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:45,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2024-10-11 20:56:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710545741] [2024-10-11 20:56:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:56:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:56:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:56:45,761 INFO L87 Difference]: Start difference. First operand 300 states and 373 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:56:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:45,815 INFO L93 Difference]: Finished difference Result 316 states and 389 transitions. [2024-10-11 20:56:45,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:56:45,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 150 [2024-10-11 20:56:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:45,817 INFO L225 Difference]: With dead ends: 316 [2024-10-11 20:56:45,817 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 20:56:45,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:56:45,821 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:45,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 20:56:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-11 20:56:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 139 states have internal predecessors, (140), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 20:56:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2024-10-11 20:56:45,832 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 150 [2024-10-11 20:56:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2024-10-11 20:56:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:56:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2024-10-11 20:56:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-11 20:56:45,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:45,835 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1] [2024-10-11 20:56:45,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 20:56:46,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:56:46,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:46,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:46,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1616045469, now seen corresponding path program 3 times [2024-10-11 20:56:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655464114] [2024-10-11 20:56:46,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:56:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:56:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:56:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 20:56:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:56:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:56:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 20:56:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 20:56:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 20:56:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 20:56:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:56:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:56:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:56:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:56:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 20:56:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:56:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:56:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:56:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 20:56:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:56:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 20:56:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 20:56:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 20:56:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 20:56:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-11 20:56:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-11 20:56:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 20:56:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-11 20:56:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 20:56:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 20:56:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5520 backedges. 230 proven. 8 refuted. 0 times theorem prover too weak. 5282 trivial. 0 not checked. [2024-10-11 20:56:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655464114] [2024-10-11 20:56:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655464114] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373955177] [2024-10-11 20:56:46,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:56:46,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:46,289 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:46,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:56:46,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:56:46,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:46,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:56:46,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5520 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 4857 trivial. 0 not checked. [2024-10-11 20:56:46,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:56:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373955177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:56:46,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:56:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-11 20:56:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049875366] [2024-10-11 20:56:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:56:46,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:56:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:56:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:56:46,390 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:46,430 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2024-10-11 20:56:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:56:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-10-11 20:56:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:46,434 INFO L225 Difference]: With dead ends: 204 [2024-10-11 20:56:46,434 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 20:56:46,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:56:46,436 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:46,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 20:56:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-11 20:56:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 138 states have (on average 1.0072463768115942) internal successors, (139), 138 states have internal predecessors, (139), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 20:56:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 235 transitions. [2024-10-11 20:56:46,473 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 235 transitions. Word has length 326 [2024-10-11 20:56:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 235 transitions. [2024-10-11 20:56:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:56:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 235 transitions. [2024-10-11 20:56:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-11 20:56:46,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:56:46,480 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:46,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 20:56:46,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:56:46,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:56:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:56:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1961556464, now seen corresponding path program 3 times [2024-10-11 20:56:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:56:46,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754353846] [2024-10-11 20:56:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:56:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:56:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:56:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:56:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:56:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:56:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:56:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:56:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:56:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:56:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:56:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:56:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:56:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:56:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:56:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:56:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:56:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:56:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:56:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:56:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:56:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:56:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:56:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 20:56:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:56:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:56:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 20:56:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 20:56:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 20:56:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 20:56:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 20:56:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:56:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:56:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:56:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 20:56:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:56:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:56:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:56:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 20:56:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:56:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 20:56:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 20:56:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 20:56:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 20:56:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-11 20:56:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-11 20:56:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 20:56:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-11 20:56:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-11 20:56:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 20:56:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:56:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5536 backedges. 138 proven. 1 refuted. 0 times theorem prover too weak. 5397 trivial. 0 not checked. [2024-10-11 20:56:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:56:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754353846] [2024-10-11 20:56:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754353846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:56:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675977930] [2024-10-11 20:56:46,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:56:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:56:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:56:46,938 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:56:46,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:56:46,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:56:46,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:56:46,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:56:46,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:56:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5536 backedges. 678 proven. 1 refuted. 0 times theorem prover too weak. 4857 trivial. 0 not checked. [2024-10-11 20:56:47,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:56:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5536 backedges. 138 proven. 1 refuted. 0 times theorem prover too weak. 5397 trivial. 0 not checked. [2024-10-11 20:56:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675977930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:56:47,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:56:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 20:56:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565216260] [2024-10-11 20:56:47,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:56:47,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:56:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:56:47,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:56:47,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:56:47,182 INFO L87 Difference]: Start difference. First operand 203 states and 235 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 20:56:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:56:47,247 INFO L93 Difference]: Finished difference Result 203 states and 235 transitions. [2024-10-11 20:56:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:56:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 330 [2024-10-11 20:56:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:56:47,248 INFO L225 Difference]: With dead ends: 203 [2024-10-11 20:56:47,248 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:56:47,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:56:47,249 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:56:47,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:56:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:56:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:56:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:56:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:56:47,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 330 [2024-10-11 20:56:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:56:47,250 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:56:47,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 20:56:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:56:47,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:56:47,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:56:47,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:56:47,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:56:47,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:56:47,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 20:56:47,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:56:47,459 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:56:47,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:56:50,114 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:56:50,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:56:50 BoogieIcfgContainer [2024-10-11 20:56:50,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:56:50,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:56:50,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:56:50,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:56:50,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:33" (3/4) ... [2024-10-11 20:56:50,128 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:56:50,131 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:56:50,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 20:56:50,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:56:50,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:56:50,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:56:50,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:56:50,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:56:50,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:56:50,203 INFO L158 Benchmark]: Toolchain (without parser) took 17679.02ms. Allocated memory was 159.4MB in the beginning and 450.9MB in the end (delta: 291.5MB). Free memory was 89.8MB in the beginning and 297.7MB in the end (delta: -208.0MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-10-11 20:56:50,203 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 159.4MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:56:50,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.59ms. Allocated memory is still 159.4MB. Free memory was 89.5MB in the beginning and 77.3MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:56:50,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.73ms. Allocated memory is still 159.4MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:56:50,204 INFO L158 Benchmark]: Boogie Preprocessor took 84.48ms. Allocated memory is still 159.4MB. Free memory was 75.6MB in the beginning and 129.8MB in the end (delta: -54.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-10-11 20:56:50,204 INFO L158 Benchmark]: RCFGBuilder took 299.66ms. Allocated memory is still 159.4MB. Free memory was 129.8MB in the beginning and 116.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:56:50,204 INFO L158 Benchmark]: TraceAbstraction took 16959.48ms. Allocated memory was 159.4MB in the beginning and 450.9MB in the end (delta: 291.5MB). Free memory was 115.5MB in the beginning and 301.9MB in the end (delta: -186.5MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. [2024-10-11 20:56:50,204 INFO L158 Benchmark]: Witness Printer took 76.11ms. Allocated memory is still 450.9MB. Free memory was 301.9MB in the beginning and 297.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:56:50,205 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.87ms. Allocated memory is still 159.4MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.59ms. Allocated memory is still 159.4MB. Free memory was 89.5MB in the beginning and 77.3MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.73ms. Allocated memory is still 159.4MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.48ms. Allocated memory is still 159.4MB. Free memory was 75.6MB in the beginning and 129.8MB in the end (delta: -54.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 299.66ms. Allocated memory is still 159.4MB. Free memory was 129.8MB in the beginning and 116.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16959.48ms. Allocated memory was 159.4MB in the beginning and 450.9MB in the end (delta: 291.5MB). Free memory was 115.5MB in the beginning and 301.9MB in the end (delta: -186.5MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. * Witness Printer took 76.11ms. Allocated memory is still 450.9MB. Free memory was 301.9MB in the beginning and 297.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: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 18, TraceHistogramMax: 48, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1352 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1352 mSDsluCounter, 2787 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2332 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2044 IncrementalHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 455 mSDtfsCounter, 2044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3468 GetRequests, 3004 SyntacticMatches, 0 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5620 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=15, InterpolantAutomatonStates: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 436 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 3409 NumberOfCodeBlocks, 2567 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4350 ConstructedInterpolants, 0 QuantifiedInterpolants, 7628 SizeOfPredicates, 86 NumberOfNonLiveVariables, 2004 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 41 InterpolantComputations, 9 PerfectInterpolantSequences, 36235/39889 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((2 <= counter) && (counter <= 10)) || (counter == 0)) || (counter == 1)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:56:50,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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