./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 24c04267f9f0764fe7131a06ba55ffdc9d502ad378fc3a3a7330afcaf1610954 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:34:30,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:34:30,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:34:30,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:34:30,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:34:30,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:34:30,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:34:30,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:34:30,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:34:30,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:34:30,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:34:30,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:34:30,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:34:30,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:34:30,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:34:30,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:34:30,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:34:30,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:34:30,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:34:30,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:34:30,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:34:30,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:34:30,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:34:30,333 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:34:30,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:34:30,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:34:30,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:34:30,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:34:30,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:34:30,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:34:30,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:34:30,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:34:30,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:34:30,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:34:30,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:34:30,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:34:30,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:34:30,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:34:30,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:34:30,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:34:30,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:34:30,341 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24c04267f9f0764fe7131a06ba55ffdc9d502ad378fc3a3a7330afcaf1610954 [2024-10-11 22:34:30,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:34:30,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:34:30,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:34:30,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:34:30,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:34:30,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_good.i [2024-10-11 22:34:32,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:34:32,311 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:34:32,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_good.i [2024-10-11 22:34:32,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6bd52a16/5234536a1e5b4ac4a859197a0c8f48b7/FLAG042128cfb [2024-10-11 22:34:32,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6bd52a16/5234536a1e5b4ac4a859197a0c8f48b7 [2024-10-11 22:34:32,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:34:32,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:34:32,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:34:32,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:34:32,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:34:32,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:34:32" (1/1) ... [2024-10-11 22:34:32,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58942bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:32, skipping insertion in model container [2024-10-11 22:34:32,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:34:32" (1/1) ... [2024-10-11 22:34:32,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:34:33,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:34:33,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:34:33,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:34:33,372 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:34:33,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33 WrapperNode [2024-10-11 22:34:33,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:34:33,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:34:33,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:34:33,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:34:33,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,439 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 249 [2024-10-11 22:34:33,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:34:33,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:34:33,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:34:33,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:34:33,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,485 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:34:33,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:34:33,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:34:33,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:34:33,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:34:33,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (1/1) ... [2024-10-11 22:34:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:34:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:33,571 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 22:34:33,574 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 22:34:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:34:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:34:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:34:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:34:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:34:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:34:33,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:34:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-11 22:34:33,633 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-11 22:34:33,633 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2024-10-11 22:34:33,633 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2024-10-11 22:34:33,805 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:34:33,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:34:34,200 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-11 22:34:34,200 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:34:34,239 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:34:34,239 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:34:34,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:34 BoogieIcfgContainer [2024-10-11 22:34:34,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:34:34,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:34:34,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:34:34,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:34:34,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:34:32" (1/3) ... [2024-10-11 22:34:34,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9465e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:34:34, skipping insertion in model container [2024-10-11 22:34:34,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:33" (2/3) ... [2024-10-11 22:34:34,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9465e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:34:34, skipping insertion in model container [2024-10-11 22:34:34,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:34" (3/3) ... [2024-10-11 22:34:34,251 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_08_good.i [2024-10-11 22:34:34,271 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:34:34,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:34:34,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:34:34,349 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;@45f7c3f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:34:34,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:34:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 99 states have internal predecessors, (136), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 22:34:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 22:34:34,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:34,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:34,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:34,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1336767886, now seen corresponding path program 1 times [2024-10-11 22:34:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:34,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567179995] [2024-10-11 22:34:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:34:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567179995] [2024-10-11 22:34:34,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567179995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:34,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:34,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:34:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674431165] [2024-10-11 22:34:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:34,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:34:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:34,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:34:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:34:34,839 INFO L87 Difference]: Start difference. First operand has 122 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 99 states have internal predecessors, (136), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:34:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:34,915 INFO L93 Difference]: Finished difference Result 216 states and 300 transitions. [2024-10-11 22:34:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:34:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 22:34:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:34,925 INFO L225 Difference]: With dead ends: 216 [2024-10-11 22:34:34,925 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 22:34:34,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 22:34:34,934 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:34,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 22:34:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 22:34:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 95 states have internal predecessors, (130), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-10-11 22:34:34,991 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 19 [2024-10-11 22:34:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:34,993 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-10-11 22:34:34,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:34:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-10-11 22:34:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 22:34:34,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:34,995 INFO L215 NwaCegarLoop]: trace histogram [1, 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 22:34:34,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:34:34,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:34,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 381343541, now seen corresponding path program 1 times [2024-10-11 22:34:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576780653] [2024-10-11 22:34:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:35,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576780653] [2024-10-11 22:34:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576780653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:34:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632565989] [2024-10-11 22:34:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:35,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:35,197 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:34:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:35,243 INFO L93 Difference]: Finished difference Result 117 states and 163 transitions. [2024-10-11 22:34:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-11 22:34:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:35,246 INFO L225 Difference]: With dead ends: 117 [2024-10-11 22:34:35,246 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 22:34:35,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 22:34:35,247 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:35,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 259 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 22:34:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 22:34:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 94 states have internal predecessors, (129), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-11 22:34:35,266 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 25 [2024-10-11 22:34:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-11 22:34:35,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:34:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-11 22:34:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 22:34:35,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:35,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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 22:34:35,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:34:35,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:35,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1063251968, now seen corresponding path program 1 times [2024-10-11 22:34:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264921602] [2024-10-11 22:34:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:35,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264921602] [2024-10-11 22:34:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264921602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:35,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:34:35,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771855316] [2024-10-11 22:34:35,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:35,350 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:34:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:35,384 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2024-10-11 22:34:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-11 22:34:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:35,388 INFO L225 Difference]: With dead ends: 115 [2024-10-11 22:34:35,390 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 22:34:35,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 22:34:35,391 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:35,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 266 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 22:34:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 22:34:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 93 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-10-11 22:34:35,407 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 26 [2024-10-11 22:34:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:35,408 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-10-11 22:34:35,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:34:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-10-11 22:34:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 22:34:35,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:35,410 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 22:34:35,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:34:35,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:35,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash -643721588, now seen corresponding path program 1 times [2024-10-11 22:34:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:35,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095344037] [2024-10-11 22:34:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 22:34:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:34:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 22:34:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 22:34:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095344037] [2024-10-11 22:34:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095344037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:34:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682366472] [2024-10-11 22:34:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:34:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:35,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:34:35,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:34:35,555 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:34:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:35,596 INFO L93 Difference]: Finished difference Result 188 states and 259 transitions. [2024-10-11 22:34:35,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:34:35,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-10-11 22:34:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:35,598 INFO L225 Difference]: With dead ends: 188 [2024-10-11 22:34:35,598 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 22:34:35,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 22:34:35,600 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:35,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 22:34:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 22:34:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 92 states have internal predecessors, (126), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 22:34:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2024-10-11 22:34:35,620 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 42 [2024-10-11 22:34:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:35,620 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2024-10-11 22:34:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:34:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2024-10-11 22:34:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 22:34:35,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:35,626 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:35,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:34:35,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:35,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1268274132, now seen corresponding path program 1 times [2024-10-11 22:34:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65909765] [2024-10-11 22:34:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:34:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65909765] [2024-10-11 22:34:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65909765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656955880] [2024-10-11 22:34:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:35,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:35,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:35,748 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 22:34:35,750 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 22:34:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:35,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:35,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:34:35,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:35,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656955880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:35,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:35,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:35,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298420506] [2024-10-11 22:34:35,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:35,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:35,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:35,922 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 22:34:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:35,959 INFO L93 Difference]: Finished difference Result 120 states and 168 transitions. [2024-10-11 22:34:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 43 [2024-10-11 22:34:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:35,962 INFO L225 Difference]: With dead ends: 120 [2024-10-11 22:34:35,962 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 22:34:35,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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 22:34:35,964 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 37 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:35,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 252 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 22:34:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-11 22:34:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 96 states have internal predecessors, (132), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2024-10-11 22:34:35,982 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 43 [2024-10-11 22:34:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:35,983 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2024-10-11 22:34:35,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 22:34:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2024-10-11 22:34:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 22:34:35,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:35,985 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:36,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 22:34:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:36,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash -661792172, now seen corresponding path program 1 times [2024-10-11 22:34:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642450386] [2024-10-11 22:34:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:34:36,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642450386] [2024-10-11 22:34:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642450386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613620237] [2024-10-11 22:34:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:36,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:36,267 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 22:34:36,269 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 22:34:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:36,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:34:36,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613620237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:36,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:36,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517384887] [2024-10-11 22:34:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:36,395 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 22:34:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:36,425 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2024-10-11 22:34:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:36,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 44 [2024-10-11 22:34:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:36,428 INFO L225 Difference]: With dead ends: 158 [2024-10-11 22:34:36,429 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 22:34:36,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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 22:34:36,431 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:36,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 22:34:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-11 22:34:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.434782608695652) internal successors, (132), 97 states have internal predecessors, (132), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-10-11 22:34:36,448 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 44 [2024-10-11 22:34:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:36,448 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-10-11 22:34:36,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 22:34:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-10-11 22:34:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 22:34:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:36,454 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:36,471 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 22:34:36,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:36,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:36,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash 68894543, now seen corresponding path program 1 times [2024-10-11 22:34:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071066885] [2024-10-11 22:34:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:34:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071066885] [2024-10-11 22:34:36,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071066885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:36,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:36,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:34:36,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585281262] [2024-10-11 22:34:36,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:36,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:34:36,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:34:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:34:36,876 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 22:34:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:36,993 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2024-10-11 22:34:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:34:36,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 49 [2024-10-11 22:34:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:36,997 INFO L225 Difference]: With dead ends: 128 [2024-10-11 22:34:36,997 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 22:34:36,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 22:34:36,998 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 43 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:36,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 652 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:34:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 22:34:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-11 22:34:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 103 states have internal predecessors, (140), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 22:34:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2024-10-11 22:34:37,010 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 174 transitions. Word has length 49 [2024-10-11 22:34:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 174 transitions. [2024-10-11 22:34:37,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 22:34:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2024-10-11 22:34:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 22:34:37,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:37,012 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:34:37,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash -286355467, now seen corresponding path program 1 times [2024-10-11 22:34:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664869890] [2024-10-11 22:34:37,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:34:37,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664869890] [2024-10-11 22:34:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664869890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:37,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:37,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:34:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037246971] [2024-10-11 22:34:37,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:37,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:37,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:37,129 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 22:34:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:37,149 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2024-10-11 22:34:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 49 [2024-10-11 22:34:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:37,152 INFO L225 Difference]: With dead ends: 126 [2024-10-11 22:34:37,153 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 22:34:37,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 22:34:37,154 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 39 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:37,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 247 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 22:34:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-10-11 22:34:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.423913043478261) internal successors, (131), 96 states have internal predecessors, (131), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-11 22:34:37,166 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 49 [2024-10-11 22:34:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-11 22:34:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 22:34:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-11 22:34:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 22:34:37,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:37,167 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:37,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:34:37,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2135731089, now seen corresponding path program 1 times [2024-10-11 22:34:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166751798] [2024-10-11 22:34:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:37,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:34:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166751798] [2024-10-11 22:34:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166751798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:34:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699294323] [2024-10-11 22:34:37,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:37,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:37,244 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 22:34:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:37,266 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2024-10-11 22:34:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-10-11 22:34:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:37,268 INFO L225 Difference]: With dead ends: 118 [2024-10-11 22:34:37,268 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 22:34:37,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 22:34:37,268 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 40 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:37,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 258 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 22:34:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-11 22:34:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 93 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-10-11 22:34:37,278 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 50 [2024-10-11 22:34:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:37,279 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-10-11 22:34:37,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 22:34:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-10-11 22:34:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 22:34:37,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:37,283 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-11 22:34:37,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 22:34:37,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1606880243, now seen corresponding path program 1 times [2024-10-11 22:34:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:37,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002902935] [2024-10-11 22:34:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 22:34:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 22:34:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002902935] [2024-10-11 22:34:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002902935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259614418] [2024-10-11 22:34:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:37,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:37,377 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 22:34:37,379 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 22:34:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:37,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 22:34:37,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:37,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259614418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:37,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:37,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:37,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361159625] [2024-10-11 22:34:37,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:37,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:37,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:37,481 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 22:34:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:37,501 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2024-10-11 22:34:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2024-10-11 22:34:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:37,505 INFO L225 Difference]: With dead ends: 121 [2024-10-11 22:34:37,506 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 22:34:37,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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 22:34:37,506 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:37,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 22:34:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-11 22:34:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 96 states have internal predecessors, (132), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 22:34:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-10-11 22:34:37,512 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 53 [2024-10-11 22:34:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:37,513 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-10-11 22:34:37,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 22:34:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-10-11 22:34:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 22:34:37,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:37,514 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-11 22:34:37,531 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 22:34:37,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:37,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1726320305, now seen corresponding path program 1 times [2024-10-11 22:34:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570662952] [2024-10-11 22:34:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 22:34:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 22:34:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570662952] [2024-10-11 22:34:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570662952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:37,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639378892] [2024-10-11 22:34:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:37,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:37,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:37,807 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 22:34:37,809 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 22:34:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:37,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:37,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 22:34:37,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639378892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:37,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917862071] [2024-10-11 22:34:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:37,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:37,930 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 22:34:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:37,949 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2024-10-11 22:34:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 22:34:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:37,951 INFO L225 Difference]: With dead ends: 119 [2024-10-11 22:34:37,951 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 22:34:37,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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 22:34:37,952 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 4 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:37,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 22:34:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 22:34:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 95 states have internal predecessors, (131), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 22:34:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-10-11 22:34:37,958 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 54 [2024-10-11 22:34:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:37,959 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-10-11 22:34:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 22:34:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-10-11 22:34:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 22:34:37,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:37,960 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 22:34:37,978 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 22:34:38,164 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,SelfDestructingSolverStorable10 [2024-10-11 22:34:38,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:38,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1672730438, now seen corresponding path program 1 times [2024-10-11 22:34:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:38,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136720501] [2024-10-11 22:34:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 22:34:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 22:34:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 22:34:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136720501] [2024-10-11 22:34:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136720501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381920987] [2024-10-11 22:34:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:38,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:38,269 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 22:34:38,270 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 22:34:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:38,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 22:34:38,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381920987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:38,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519374982] [2024-10-11 22:34:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:38,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:38,391 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 22:34:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:38,408 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2024-10-11 22:34:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2024-10-11 22:34:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:38,409 INFO L225 Difference]: With dead ends: 118 [2024-10-11 22:34:38,410 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 22:34:38,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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 22:34:38,410 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 2 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:38,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 280 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 22:34:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-10-11 22:34:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-10-11 22:34:38,417 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 59 [2024-10-11 22:34:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:38,417 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-10-11 22:34:38,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 22:34:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-10-11 22:34:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 22:34:38,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:38,419 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-11 22:34:38,435 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 22:34:38,619 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,SelfDestructingSolverStorable11 [2024-10-11 22:34:38,620 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1649591134, now seen corresponding path program 1 times [2024-10-11 22:34:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425982269] [2024-10-11 22:34:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 22:34:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 22:34:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 22:34:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 22:34:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:38,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425982269] [2024-10-11 22:34:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425982269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:38,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18514669] [2024-10-11 22:34:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:38,700 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 22:34:38,701 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 22:34:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:38,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:38,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 22:34:38,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18514669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:38,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41995455] [2024-10-11 22:34:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:38,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:38,811 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:34:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:38,830 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2024-10-11 22:34:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2024-10-11 22:34:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:38,832 INFO L225 Difference]: With dead ends: 118 [2024-10-11 22:34:38,832 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 22:34:38,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 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 22:34:38,833 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:38,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 294 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 22:34:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-11 22:34:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 22:34:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-10-11 22:34:38,842 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 64 [2024-10-11 22:34:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:38,843 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-10-11 22:34:38,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:34:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-10-11 22:34:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 22:34:38,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:38,845 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-11 22:34:38,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 22:34:39,046 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,SelfDestructingSolverStorable12 [2024-10-11 22:34:39,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:39,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 125416228, now seen corresponding path program 1 times [2024-10-11 22:34:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:39,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767771621] [2024-10-11 22:34:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 22:34:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 22:34:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 22:34:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 22:34:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767771621] [2024-10-11 22:34:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767771621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922229527] [2024-10-11 22:34:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:39,122 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 22:34:39,124 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 22:34:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:39,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 22:34:39,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:39,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922229527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:39,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:39,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691211198] [2024-10-11 22:34:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:39,232 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:34:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:39,251 INFO L93 Difference]: Finished difference Result 116 states and 163 transitions. [2024-10-11 22:34:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:39,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2024-10-11 22:34:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:39,253 INFO L225 Difference]: With dead ends: 116 [2024-10-11 22:34:39,253 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 22:34:39,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 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 22:34:39,254 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:39,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 22:34:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-10-11 22:34:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:34:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-10-11 22:34:39,263 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 64 [2024-10-11 22:34:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:39,263 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-10-11 22:34:39,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:34:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-10-11 22:34:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 22:34:39,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:39,265 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-11 22:34:39,284 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 22:34:39,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:39,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:34:39,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash 402282707, now seen corresponding path program 1 times [2024-10-11 22:34:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:39,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126478017] [2024-10-11 22:34:39,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:34:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 22:34:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 22:34:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:34:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:34:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:34:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 22:34:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 22:34:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 22:34:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 22:34:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126478017] [2024-10-11 22:34:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126478017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:34:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056263361] [2024-10-11 22:34:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:39,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:34:39,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:39,571 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 22:34:39,572 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 22:34:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:39,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:39,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 22:34:39,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056263361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:34:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 22:34:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713643800] [2024-10-11 22:34:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:39,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 22:34:39,693 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:34:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:39,709 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2024-10-11 22:34:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:39,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2024-10-11 22:34:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:39,710 INFO L225 Difference]: With dead ends: 111 [2024-10-11 22:34:39,710 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:34:39,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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 22:34:39,711 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:39,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:34:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:34:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:34:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:34:39,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2024-10-11 22:34:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:39,713 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:34:39,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:34:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:34:39,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:34:39,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:34:39,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:34:39,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:34:39,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:34:39,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:34:39,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:34:39,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:34:39,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:34:39,738 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 22:34:39,924 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 22:34:39,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:39,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:34:39,995 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:34:40,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:34:40 BoogieIcfgContainer [2024-10-11 22:34:40,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:34:40,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:34:40,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:34:40,015 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:34:40,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:34" (3/4) ... [2024-10-11 22:34:40,021 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:34:40,027 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:34:40,028 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2024-10-11 22:34:40,028 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:34:40,028 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2024-10-11 22:34:40,037 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 22:34:40,038 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 22:34:40,038 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:34:40,039 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:34:40,150 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:34:40,150 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:34:40,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:34:40,151 INFO L158 Benchmark]: Toolchain (without parser) took 7794.22ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 118.2MB in the beginning and 193.3MB in the end (delta: -75.1MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,151 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:34:40,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1012.43ms. Allocated memory is still 176.2MB. Free memory was 118.2MB in the beginning and 52.5MB in the end (delta: 65.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.34ms. Allocated memory is still 176.2MB. Free memory was 52.5MB in the beginning and 49.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,151 INFO L158 Benchmark]: Boogie Preprocessor took 67.31ms. Allocated memory is still 176.2MB. Free memory was 49.0MB in the beginning and 141.3MB in the end (delta: -92.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,152 INFO L158 Benchmark]: RCFGBuilder took 711.99ms. Allocated memory is still 234.9MB. Free memory was 202.5MB in the beginning and 174.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,152 INFO L158 Benchmark]: TraceAbstraction took 5772.09ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 173.1MB in the beginning and 201.7MB in the end (delta: -28.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,152 INFO L158 Benchmark]: Witness Printer took 135.06ms. Allocated memory is still 283.1MB. Free memory was 201.7MB in the beginning and 193.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:34:40,153 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1012.43ms. Allocated memory is still 176.2MB. Free memory was 118.2MB in the beginning and 52.5MB in the end (delta: 65.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.34ms. Allocated memory is still 176.2MB. Free memory was 52.5MB in the beginning and 49.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.31ms. Allocated memory is still 176.2MB. Free memory was 49.0MB in the beginning and 141.3MB in the end (delta: -92.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * RCFGBuilder took 711.99ms. Allocated memory is still 234.9MB. Free memory was 202.5MB in the beginning and 174.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5772.09ms. Allocated memory was 234.9MB in the beginning and 283.1MB in the end (delta: 48.2MB). Free memory was 173.1MB in the beginning and 201.7MB in the end (delta: -28.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 135.06ms. Allocated memory is still 283.1MB. Free memory was 201.7MB in the beginning and 193.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 4829 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2595 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2234 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 30 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1152 NumberOfCodeBlocks, 1152 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 1369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 316/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ProcedureContractResult [Line: 1552]: Procedure Contract for staticReturnsFalse Derived contract for procedure staticReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1548]: Procedure Contract for staticReturnsTrue Derived contract for procedure staticReturnsTrue. Ensures: (\result == 1) RESULT: Ultimate proved your program to be correct! [2024-10-11 22:34:40,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE