./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/fermat1-ll_valuebound10.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/fermat1-ll_valuebound10.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 c6b05ef27bc57afa4e7776361d8c320f2c4d1efbfc422ad92c7a9c3c2e549e04 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:45:21,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:45:21,788 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:45:21,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:45:21,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:45:21,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:45:21,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:45:21,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:45:21,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:45:21,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:45:21,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:45:21,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:45:21,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:45:21,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:45:21,827 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:45:21,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:45:21,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:45:21,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:45:21,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:45:21,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:45:21,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:45:21,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:45:21,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:45:21,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:45:21,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:45:21,832 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:45:21,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:45:21,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:45:21,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:45:21,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:45:21,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:45:21,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:45:21,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:45:21,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:45:21,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:45:21,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:45:21,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:45:21,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:45:21,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:45:21,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:45:21,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:45:21,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:45:21,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:45:21,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:45:21,836 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 -> c6b05ef27bc57afa4e7776361d8c320f2c4d1efbfc422ad92c7a9c3c2e549e04 [2024-10-11 20:45:22,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:45:22,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:45:22,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:45:22,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:45:22,100 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:45:22,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound10.c [2024-10-11 20:45:23,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:45:23,700 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:45:23,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound10.c [2024-10-11 20:45:23,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed72f496c/a8c63091e68e4f83ac20e082ceae2f4b/FLAGcad215c1f [2024-10-11 20:45:24,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed72f496c/a8c63091e68e4f83ac20e082ceae2f4b [2024-10-11 20:45:24,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:45:24,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:45:24,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:45:24,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:45:24,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:45:24,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddb5880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24, skipping insertion in model container [2024-10-11 20:45:24,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:45:24,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:45:24,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:45:24,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:45:24,411 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:45:24,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24 WrapperNode [2024-10-11 20:45:24,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:45:24,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:45:24,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:45:24,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:45:24,420 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:45:24" (1/1) ... [2024-10-11 20:45:24,432 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:45:24" (1/1) ... [2024-10-11 20:45:24,465 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-10-11 20:45:24,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:45:24,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:45:24,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:45:24,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:45:24,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,500 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:45:24,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:45:24,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:45:24,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:45:24,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:45:24,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (1/1) ... [2024-10-11 20:45:24,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:45:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:24,554 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:45:24,557 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:45:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:45:24,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:45:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:45:24,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:45:24,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:45:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:45:24,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:45:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:45:24,672 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:45:24,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:45:25,255 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-11 20:45:25,256 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:45:25,301 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:45:25,301 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:45:25,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:25 BoogieIcfgContainer [2024-10-11 20:45:25,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:45:25,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:45:25,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:45:25,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:45:25,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:45:24" (1/3) ... [2024-10-11 20:45:25,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713af8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:25, skipping insertion in model container [2024-10-11 20:45:25,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:24" (2/3) ... [2024-10-11 20:45:25,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713af8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:25, skipping insertion in model container [2024-10-11 20:45:25,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:25" (3/3) ... [2024-10-11 20:45:25,313 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound10.c [2024-10-11 20:45:25,331 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:45:25,331 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-10-11 20:45:25,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:45:25,400 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;@54c1fd03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:45:25,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-10-11 20:45:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 107 states have (on average 1.9626168224299065) internal successors, (210), 199 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:45:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:45:25,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:25,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1466449209, now seen corresponding path program 1 times [2024-10-11 20:45:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5657999] [2024-10-11 20:45:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5657999] [2024-10-11 20:45:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5657999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037209697] [2024-10-11 20:45:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:45:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:45:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:45:25,652 INFO L87 Difference]: Start difference. First operand has 210 states, 107 states have (on average 1.9626168224299065) internal successors, (210), 199 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:25,701 INFO L93 Difference]: Finished difference Result 408 states and 457 transitions. [2024-10-11 20:45:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:45:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:45:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:25,711 INFO L225 Difference]: With dead ends: 408 [2024-10-11 20:45:25,711 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 20:45:25,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:45:25,718 INFO L432 NwaCegarLoop]: 206 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, 206 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:45:25,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 20:45:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 20:45:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 187 states have internal predecessors, (190), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 204 transitions. [2024-10-11 20:45:25,763 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 204 transitions. Word has length 13 [2024-10-11 20:45:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:25,763 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 204 transitions. [2024-10-11 20:45:25,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 204 transitions. [2024-10-11 20:45:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:45:25,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:45:25,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1859416637, now seen corresponding path program 1 times [2024-10-11 20:45:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556136480] [2024-10-11 20:45:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556136480] [2024-10-11 20:45:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556136480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:25,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:25,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:25,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582321132] [2024-10-11 20:45:25,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:25,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:25,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:25,873 INFO L87 Difference]: Start difference. First operand 197 states and 204 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:25,950 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2024-10-11 20:45:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:45:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:25,953 INFO L225 Difference]: With dead ends: 197 [2024-10-11 20:45:25,953 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 20:45:25,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:25,955 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 13 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:25,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 350 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 20:45:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-11 20:45:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 106 states have (on average 1.7547169811320755) internal successors, (186), 183 states have internal predecessors, (186), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2024-10-11 20:45:25,970 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 13 [2024-10-11 20:45:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:25,971 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2024-10-11 20:45:25,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2024-10-11 20:45:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:45:25,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,973 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:45:25,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1807340860, now seen corresponding path program 1 times [2024-10-11 20:45:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153064326] [2024-10-11 20:45:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:26,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153064326] [2024-10-11 20:45:26,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153064326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:26,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:26,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220198298] [2024-10-11 20:45:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:26,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:26,030 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:26,078 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2024-10-11 20:45:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:45:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:26,086 INFO L225 Difference]: With dead ends: 193 [2024-10-11 20:45:26,088 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 20:45:26,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:26,090 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 12 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:26,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 350 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 20:45:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-10-11 20:45:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 106 states have (on average 1.7169811320754718) internal successors, (182), 179 states have internal predecessors, (182), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2024-10-11 20:45:26,106 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 14 [2024-10-11 20:45:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:26,107 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2024-10-11 20:45:26,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2024-10-11 20:45:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:45:26,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:26,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:26,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:45:26,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:26,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1543402248, now seen corresponding path program 1 times [2024-10-11 20:45:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20571238] [2024-10-11 20:45:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:26,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213768960] [2024-10-11 20:45:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:26,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:26,140 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:45:26,141 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:45:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:45:26,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:26,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:26,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:26,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20571238] [2024-10-11 20:45:26,260 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:26,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213768960] [2024-10-11 20:45:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213768960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:26,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:45:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628697547] [2024-10-11 20:45:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:26,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:26,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:26,264 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:26,348 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2024-10-11 20:45:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 20:45:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:26,350 INFO L225 Difference]: With dead ends: 189 [2024-10-11 20:45:26,350 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 20:45:26,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:26,351 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 8 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:26,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 676 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 20:45:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-11 20:45:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 177 states have internal predecessors, (180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2024-10-11 20:45:26,361 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 18 [2024-10-11 20:45:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:26,361 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2024-10-11 20:45:26,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2024-10-11 20:45:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:45:26,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:26,362 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:26,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:45:26,563 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:45:26,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:26,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1365491731, now seen corresponding path program 1 times [2024-10-11 20:45:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813049852] [2024-10-11 20:45:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732697020] [2024-10-11 20:45:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:26,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:26,606 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:45:26,608 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:45:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:45:26,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:26,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813049852] [2024-10-11 20:45:26,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732697020] [2024-10-11 20:45:26,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732697020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:26,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:45:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:45:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855396355] [2024-10-11 20:45:26,839 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:26,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:26,842 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:26,955 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2024-10-11 20:45:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-11 20:45:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:26,958 INFO L225 Difference]: With dead ends: 187 [2024-10-11 20:45:26,958 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 20:45:26,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:26,959 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 144 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:26,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 469 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 20:45:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-11 20:45:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 106 states have (on average 1.669811320754717) internal successors, (177), 174 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2024-10-11 20:45:26,976 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 35 [2024-10-11 20:45:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:26,976 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2024-10-11 20:45:26,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2024-10-11 20:45:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:45:26,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:26,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:26,996 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:45:27,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:27,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:27,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 619429364, now seen corresponding path program 1 times [2024-10-11 20:45:27,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900380328] [2024-10-11 20:45:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:27,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900380328] [2024-10-11 20:45:27,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900380328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:27,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452894943] [2024-10-11 20:45:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:27,437 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:45:27,438 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:45:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:45:27,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:27,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452894943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:45:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:45:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905998265] [2024-10-11 20:45:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:27,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:45:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:45:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:45:27,580 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:27,745 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2024-10-11 20:45:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:45:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-11 20:45:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:27,747 INFO L225 Difference]: With dead ends: 184 [2024-10-11 20:45:27,747 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 20:45:27,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:45:27,749 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 143 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:27,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 616 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 20:45:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 20:45:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.6603773584905661) internal successors, (176), 173 states have internal predecessors, (176), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 190 transitions. [2024-10-11 20:45:27,757 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 190 transitions. Word has length 36 [2024-10-11 20:45:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:27,757 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 190 transitions. [2024-10-11 20:45:27,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 190 transitions. [2024-10-11 20:45:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:45:27,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:27,758 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:27,777 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:45:27,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:27,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1728832970, now seen corresponding path program 1 times [2024-10-11 20:45:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053659327] [2024-10-11 20:45:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053659327] [2024-10-11 20:45:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053659327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256017285] [2024-10-11 20:45:28,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:28,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:28,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:28,042 INFO L87 Difference]: Start difference. First operand 183 states and 190 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:28,110 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2024-10-11 20:45:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-10-11 20:45:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:28,112 INFO L225 Difference]: With dead ends: 189 [2024-10-11 20:45:28,112 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 20:45:28,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:28,113 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:28,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 218 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 20:45:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-11 20:45:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 110 states have (on average 1.6272727272727272) internal successors, (179), 176 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 193 transitions. [2024-10-11 20:45:28,126 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 193 transitions. Word has length 38 [2024-10-11 20:45:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:28,127 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 193 transitions. [2024-10-11 20:45:28,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2024-10-11 20:45:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:45:28,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:28,131 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:28,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:45:28,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:28,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2054214440, now seen corresponding path program 1 times [2024-10-11 20:45:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:28,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840788617] [2024-10-11 20:45:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:28,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840788617] [2024-10-11 20:45:28,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840788617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:28,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847262957] [2024-10-11 20:45:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:28,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:28,206 INFO L87 Difference]: Start difference. First operand 186 states and 193 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:28,319 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2024-10-11 20:45:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-11 20:45:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:28,321 INFO L225 Difference]: With dead ends: 190 [2024-10-11 20:45:28,322 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 20:45:28,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:28,324 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 109 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:28,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 331 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 20:45:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-11 20:45:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 112 states have (on average 1.6071428571428572) internal successors, (180), 177 states have internal predecessors, (180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2024-10-11 20:45:28,336 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 39 [2024-10-11 20:45:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2024-10-11 20:45:28,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2024-10-11 20:45:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:45:28,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:28,337 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:28,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:45:28,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:28,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash 743861880, now seen corresponding path program 1 times [2024-10-11 20:45:28,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:28,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706289036] [2024-10-11 20:45:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307306484] [2024-10-11 20:45:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:28,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:28,359 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:45:28,362 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:45:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:45:28,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:28,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706289036] [2024-10-11 20:45:28,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307306484] [2024-10-11 20:45:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307306484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:28,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:28,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:28,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323111917] [2024-10-11 20:45:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:28,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:28,440 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:28,543 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2024-10-11 20:45:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:28,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 20:45:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:28,545 INFO L225 Difference]: With dead ends: 293 [2024-10-11 20:45:28,545 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 20:45:28,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:28,546 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:28,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 305 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 20:45:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 250. [2024-10-11 20:45:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 172 states have (on average 1.6395348837209303) internal successors, (282), 237 states have internal predecessors, (282), 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:45:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 302 transitions. [2024-10-11 20:45:28,561 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 302 transitions. Word has length 40 [2024-10-11 20:45:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:28,562 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 302 transitions. [2024-10-11 20:45:28,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2024-10-11 20:45:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:45:28,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:28,564 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:28,581 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:45:28,765 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,SelfDestructingSolverStorable8 [2024-10-11 20:45:28,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1584881882, now seen corresponding path program 1 times [2024-10-11 20:45:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:28,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417965229] [2024-10-11 20:45:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:29,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:45:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417965229] [2024-10-11 20:45:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417965229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969146626] [2024-10-11 20:45:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:29,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:29,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:29,028 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:45:29,030 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:45:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:29,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:45:29,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:29,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969146626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:29,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:45:29,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-11 20:45:29,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909992254] [2024-10-11 20:45:29,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:29,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:45:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:45:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:45:29,571 INFO L87 Difference]: Start difference. First operand 250 states and 302 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:45:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:30,004 INFO L93 Difference]: Finished difference Result 391 states and 422 transitions. [2024-10-11 20:45:30,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:45:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2024-10-11 20:45:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:30,007 INFO L225 Difference]: With dead ends: 391 [2024-10-11 20:45:30,008 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 20:45:30,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:45:30,009 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 934 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:30,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 968 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:45:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 20:45:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 294. [2024-10-11 20:45:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 214 states have (on average 1.6355140186915889) internal successors, (350), 279 states have internal predecessors, (350), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:45:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 374 transitions. [2024-10-11 20:45:30,029 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 374 transitions. Word has length 41 [2024-10-11 20:45:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:30,029 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 374 transitions. [2024-10-11 20:45:30,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:45:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 374 transitions. [2024-10-11 20:45:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:45:30,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:30,030 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:30,047 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:45:30,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:45:30,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:30,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1641898788, now seen corresponding path program 1 times [2024-10-11 20:45:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:30,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422202804] [2024-10-11 20:45:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801285323] [2024-10-11 20:45:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:30,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:30,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:30,251 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:45:30,253 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:45:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:45:30,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:30,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:45:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422202804] [2024-10-11 20:45:30,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801285323] [2024-10-11 20:45:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801285323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:30,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:45:30,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 20:45:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107374691] [2024-10-11 20:45:30,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:30,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:45:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:45:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:45:30,624 INFO L87 Difference]: Start difference. First operand 294 states and 374 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:45:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:32,055 INFO L93 Difference]: Finished difference Result 428 states and 546 transitions. [2024-10-11 20:45:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:45:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-10-11 20:45:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:32,058 INFO L225 Difference]: With dead ends: 428 [2024-10-11 20:45:32,059 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 20:45:32,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:45:32,060 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 214 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:32,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 436 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 20:45:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 20:45:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 375. [2024-10-11 20:45:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 309 states have (on average 1.4401294498381878) internal successors, (445), 357 states have internal predecessors, (445), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:45:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 475 transitions. [2024-10-11 20:45:32,081 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 475 transitions. Word has length 43 [2024-10-11 20:45:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:32,081 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 475 transitions. [2024-10-11 20:45:32,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:45:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 475 transitions. [2024-10-11 20:45:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:45:32,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:32,084 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:32,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:45:32,284 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,SelfDestructingSolverStorable10 [2024-10-11 20:45:32,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:32,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:32,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1611734818, now seen corresponding path program 1 times [2024-10-11 20:45:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:32,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192014503] [2024-10-11 20:45:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:32,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555274928] [2024-10-11 20:45:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:32,308 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:45:32,309 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:45:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:45:32,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:45:32,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:32,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:32,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192014503] [2024-10-11 20:45:32,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:32,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555274928] [2024-10-11 20:45:32,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555274928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:32,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792547044] [2024-10-11 20:45:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:32,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:32,376 INFO L87 Difference]: Start difference. First operand 375 states and 475 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:32,566 INFO L93 Difference]: Finished difference Result 576 states and 729 transitions. [2024-10-11 20:45:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-11 20:45:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:32,569 INFO L225 Difference]: With dead ends: 576 [2024-10-11 20:45:32,569 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 20:45:32,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:32,571 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 88 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:32,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 206 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 20:45:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2024-10-11 20:45:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.3473451327433628) internal successors, (609), 500 states have internal predecessors, (609), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:45:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2024-10-11 20:45:32,597 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 45 [2024-10-11 20:45:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:32,597 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2024-10-11 20:45:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2024-10-11 20:45:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 20:45:32,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:32,599 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:32,617 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:45:32,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:32,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -707959789, now seen corresponding path program 1 times [2024-10-11 20:45:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116790321] [2024-10-11 20:45:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116790321] [2024-10-11 20:45:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116790321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:32,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522100403] [2024-10-11 20:45:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:32,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:32,892 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:33,129 INFO L93 Difference]: Finished difference Result 536 states and 650 transitions. [2024-10-11 20:45:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2024-10-11 20:45:33,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:33,131 INFO L225 Difference]: With dead ends: 536 [2024-10-11 20:45:33,132 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 20:45:33,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:33,132 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 57 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:33,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 235 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 20:45:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2024-10-11 20:45:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.342920353982301) internal successors, (607), 500 states have internal predecessors, (607), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:45:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 647 transitions. [2024-10-11 20:45:33,154 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 647 transitions. Word has length 87 [2024-10-11 20:45:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 647 transitions. [2024-10-11 20:45:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 647 transitions. [2024-10-11 20:45:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:45:33,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:33,155 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:45:33,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:33,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash -471916808, now seen corresponding path program 1 times [2024-10-11 20:45:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:33,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471286206] [2024-10-11 20:45:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471286206] [2024-10-11 20:45:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471286206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:33,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:45:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885152026] [2024-10-11 20:45:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:33,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:33,274 INFO L87 Difference]: Start difference. First operand 523 states and 647 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:33,626 INFO L93 Difference]: Finished difference Result 533 states and 653 transitions. [2024-10-11 20:45:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2024-10-11 20:45:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:33,629 INFO L225 Difference]: With dead ends: 533 [2024-10-11 20:45:33,629 INFO L226 Difference]: Without dead ends: 532 [2024-10-11 20:45:33,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:33,630 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 252 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:33,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 207 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:45:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-11 20:45:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 523. [2024-10-11 20:45:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.3384955752212389) internal successors, (605), 500 states have internal predecessors, (605), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:45:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 645 transitions. [2024-10-11 20:45:33,656 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 645 transitions. Word has length 88 [2024-10-11 20:45:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:33,657 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 645 transitions. [2024-10-11 20:45:33,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:45:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 645 transitions. [2024-10-11 20:45:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 20:45:33,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:33,658 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:33,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:45:33,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:33,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1860687940, now seen corresponding path program 1 times [2024-10-11 20:45:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496910087] [2024-10-11 20:45:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496910087] [2024-10-11 20:45:33,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496910087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678834697] [2024-10-11 20:45:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:33,851 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:45:33,853 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:45:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:45:33,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:34,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:34,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678834697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:34,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:34,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-10-11 20:45:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516642935] [2024-10-11 20:45:34,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:34,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:45:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:45:34,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:45:34,296 INFO L87 Difference]: Start difference. First operand 523 states and 645 transitions. Second operand has 14 states, 13 states have (on average 13.923076923076923) internal successors, (181), 14 states have internal predecessors, (181), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 20:45:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:35,336 INFO L93 Difference]: Finished difference Result 1137 states and 1403 transitions. [2024-10-11 20:45:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:45:35,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.923076923076923) internal successors, (181), 14 states have internal predecessors, (181), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 92 [2024-10-11 20:45:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:35,339 INFO L225 Difference]: With dead ends: 1137 [2024-10-11 20:45:35,339 INFO L226 Difference]: Without dead ends: 638 [2024-10-11 20:45:35,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:45:35,341 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1096 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:35,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 468 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:45:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-11 20:45:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 600. [2024-10-11 20:45:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 573 states have internal predecessors, (695), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:45:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 743 transitions. [2024-10-11 20:45:35,389 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 743 transitions. Word has length 92 [2024-10-11 20:45:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:35,390 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 743 transitions. [2024-10-11 20:45:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.923076923076923) internal successors, (181), 14 states have internal predecessors, (181), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 20:45:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 743 transitions. [2024-10-11 20:45:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 20:45:35,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:35,392 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:35,409 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:45:35,593 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,SelfDestructingSolverStorable14 [2024-10-11 20:45:35,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-10-11 20:45:35,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1846751163, now seen corresponding path program 1 times [2024-10-11 20:45:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21188046] [2024-10-11 20:45:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:45:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:45:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:45:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:45:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:45:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21188046] [2024-10-11 20:45:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21188046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:35,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486409951] [2024-10-11 20:45:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:35,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:35,699 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:45:35,700 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:45:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:35,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:45:35,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:46,001 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_51| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_51| |v_ULTIMATE.start_main_~R~0#1_51|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2024-10-11 20:45:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2024-10-11 20:45:46,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:45:46,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486409951] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:46,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 20:45:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556356220] [2024-10-11 20:45:46,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:45:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:46,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:45:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=4, NotChecked=22, Total=182 [2024-10-11 20:45:46,202 INFO L87 Difference]: Start difference. First operand 600 states and 743 transitions. Second operand has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:46:07,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:12,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:14,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:18,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:22,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:26,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:28,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:32,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:36,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:40,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:44,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:48,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:52,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:54,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:46:58,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:02,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]