./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_24.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_24.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6c60292dde23ab55828ef032d9fe2f87b2621bfa03c7b2d7ca1f8181db5f622f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:16:18,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:16:18,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 11:16:18,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:16:18,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:16:18,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:16:18,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:16:18,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:16:18,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:16:18,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:16:18,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:16:18,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:16:18,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:16:18,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:16:18,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:16:18,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:16:18,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:16:18,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:16:18,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:16:18,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:16:18,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:16:18,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:16:18,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:16:18,485 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:16:18,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:16:18,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:16:18,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:16:18,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:16:18,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:16:18,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:16:18,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:16:18,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:16:18,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:16:18,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:16:18,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:16:18,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:16:18,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:16:18,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:16:18,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:16:18,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:16:18,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:16:18,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c60292dde23ab55828ef032d9fe2f87b2621bfa03c7b2d7ca1f8181db5f622f [2024-11-09 11:16:18,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:16:18,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:16:18,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:16:18,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:16:18,723 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:16:18,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_24.c [2024-11-09 11:16:19,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:16:20,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:16:20,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_24.c [2024-11-09 11:16:20,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0177fbfdd/c80ffca1dd2b4f17b06514328ffc4400/FLAGcf45adef9 [2024-11-09 11:16:20,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0177fbfdd/c80ffca1dd2b4f17b06514328ffc4400 [2024-11-09 11:16:20,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:16:20,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:16:20,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:16:20,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:16:20,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:16:20,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd1a7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20, skipping insertion in model container [2024-11-09 11:16:20,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:16:20,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:16:20,663 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:16:20,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:16:20,686 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:16:20,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20 WrapperNode [2024-11-09 11:16:20,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:16:20,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:16:20,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:16:20,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:16:20,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,707 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-09 11:16:20,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:16:20,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:16:20,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:16:20,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:16:20,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,721 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 11:16:20,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:16:20,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:16:20,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:16:20,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:16:20,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (1/1) ... [2024-11-09 11:16:20,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:16:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:16:20,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:16:20,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:16:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:16:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:16:20,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:16:20,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:16:20,970 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 11:16:20,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:16:20,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:16:20,991 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:16:20,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:16:20 BoogieIcfgContainer [2024-11-09 11:16:20,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:16:20,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:16:20,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:16:20,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:16:20,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:16:20" (1/3) ... [2024-11-09 11:16:21,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22656c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:16:21, skipping insertion in model container [2024-11-09 11:16:21,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:20" (2/3) ... [2024-11-09 11:16:21,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22656c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:16:21, skipping insertion in model container [2024-11-09 11:16:21,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:16:20" (3/3) ... [2024-11-09 11:16:21,004 INFO L112 eAbstractionObserver]: Analyzing ICFG NO_24.c [2024-11-09 11:16:21,018 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:16:21,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 11:16:21,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:16:21,074 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;@418c05fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:16:21,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 11:16:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 11:16:21,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 11:16:21,084 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-11-09 11:16:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 11:16:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126572325] [2024-11-09 11:16:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126572325] [2024-11-09 11:16:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126572325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:16:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461964124] [2024-11-09 11:16:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:16:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:16:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:16:21,237 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,282 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-09 11:16:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:16:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 11:16:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,290 INFO L225 Difference]: With dead ends: 33 [2024-11-09 11:16:21,290 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 11:16:21,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-09 11:16:21,295 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 11:16:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-11-09 11:16:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-09 11:16:21,318 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 3 [2024-11-09 11:16:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,318 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-09 11:16:21,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-09 11:16:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:16:21,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:16:21,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:16:21,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2024-11-09 11:16:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253986866] [2024-11-09 11:16:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253986866] [2024-11-09 11:16:21,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253986866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:16:21,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424196411] [2024-11-09 11:16:21,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:16:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:16:21,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:16:21,345 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,380 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-09 11:16:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:16:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 11:16:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,381 INFO L225 Difference]: With dead ends: 25 [2024-11-09 11:16:21,381 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 11:16:21,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-09 11:16:21,382 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 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-11-09 11:16:21,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 11:16:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-11-09 11:16:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-09 11:16:21,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 4 [2024-11-09 11:16:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,386 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-09 11:16:21,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-09 11:16:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:16:21,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:16:21,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash 889599142, now seen corresponding path program 1 times [2024-11-09 11:16:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008100348] [2024-11-09 11:16:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008100348] [2024-11-09 11:16:21,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008100348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:16:21,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078661734] [2024-11-09 11:16:21,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:16:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:16:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:16:21,441 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,470 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-09 11:16:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:16:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 11:16:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,471 INFO L225 Difference]: With dead ends: 25 [2024-11-09 11:16:21,484 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 11:16:21,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-09 11:16:21,485 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 11:16:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-09 11:16:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-09 11:16:21,489 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 6 [2024-11-09 11:16:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,490 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-09 11:16:21,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-09 11:16:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:16:21,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:16:21,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1807769675, now seen corresponding path program 1 times [2024-11-09 11:16:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817132784] [2024-11-09 11:16:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817132784] [2024-11-09 11:16:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817132784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:16:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986569581] [2024-11-09 11:16:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:16:21,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:16:21,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:16:21,534 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,560 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-09 11:16:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:16:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:16:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,561 INFO L225 Difference]: With dead ends: 25 [2024-11-09 11:16:21,561 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 11:16:21,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-09 11:16:21,563 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 11:16:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 11:16:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-09 11:16:21,567 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 7 [2024-11-09 11:16:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,567 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-09 11:16:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-09 11:16:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:16:21,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:16:21,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash 206285128, now seen corresponding path program 1 times [2024-11-09 11:16:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613403929] [2024-11-09 11:16:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613403929] [2024-11-09 11:16:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613403929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:16:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345870728] [2024-11-09 11:16:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:16:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:16:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:16:21,603 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,659 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-09 11:16:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:16:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 11:16:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,661 INFO L225 Difference]: With dead ends: 27 [2024-11-09 11:16:21,661 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 11:16:21,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:16:21,662 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 11:16:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-09 11:16:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-09 11:16:21,666 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 8 [2024-11-09 11:16:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,666 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-09 11:16:21,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-09 11:16:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:16:21,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:16:21,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2099871725, now seen corresponding path program 1 times [2024-11-09 11:16:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113574991] [2024-11-09 11:16:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113574991] [2024-11-09 11:16:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113574991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:16:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28756203] [2024-11-09 11:16:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:16:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:16:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:16:21,707 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,738 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-09 11:16:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:16:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 11:16:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,739 INFO L225 Difference]: With dead ends: 27 [2024-11-09 11:16:21,739 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 11:16:21,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-09 11:16:21,740 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 11:16:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 11:16:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-09 11:16:21,744 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 9 [2024-11-09 11:16:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,744 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-09 11:16:21,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-09 11:16:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 11:16:21,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:16:21,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash 671514090, now seen corresponding path program 1 times [2024-11-09 11:16:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559985014] [2024-11-09 11:16:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559985014] [2024-11-09 11:16:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559985014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:16:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962876940] [2024-11-09 11:16:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:16:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:16:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:16:21,780 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,818 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-11-09 11:16:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:16:21,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 11:16:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,819 INFO L225 Difference]: With dead ends: 29 [2024-11-09 11:16:21,819 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 11:16:21,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-09 11:16:21,820 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 11:16:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 11:16:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-09 11:16:21,823 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 10 [2024-11-09 11:16:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,823 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-09 11:16:21,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-09 11:16:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:16:21,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:16:21,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash -657899633, now seen corresponding path program 1 times [2024-11-09 11:16:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892757104] [2024-11-09 11:16:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:21,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892757104] [2024-11-09 11:16:21,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892757104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:16:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116075746] [2024-11-09 11:16:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:16:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:16:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:16:21,884 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:21,922 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-11-09 11:16:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:16:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 11:16:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:21,923 INFO L225 Difference]: With dead ends: 29 [2024-11-09 11:16:21,923 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 11:16:21,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:16:21,925 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:21,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 11:16:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 11:16:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.4) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-09 11:16:21,931 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 11 [2024-11-09 11:16:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:21,931 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-09 11:16:21,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-09 11:16:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 11:16:21,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:21,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:21,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:16:21,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1079947895, now seen corresponding path program 1 times [2024-11-09 11:16:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:21,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746466854] [2024-11-09 11:16:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:16:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746466854] [2024-11-09 11:16:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746466854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:22,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:22,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:16:22,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022802470] [2024-11-09 11:16:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:16:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:16:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:16:22,020 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:22,083 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2024-11-09 11:16:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:16:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 11:16:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:22,086 INFO L225 Difference]: With dead ends: 28 [2024-11-09 11:16:22,086 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 11:16:22,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:16:22,087 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:22,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 11:16:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 11:16:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-09 11:16:22,090 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 12 [2024-11-09 11:16:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:22,091 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-09 11:16:22,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-09 11:16:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:16:22,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:22,092 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:22,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:16:22,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:22,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash -881353583, now seen corresponding path program 1 times [2024-11-09 11:16:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032949275] [2024-11-09 11:16:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:16:22,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:22,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032949275] [2024-11-09 11:16:22,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032949275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:16:22,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:16:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:16:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282597136] [2024-11-09 11:16:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:16:22,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:16:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:16:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:16:22,141 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:22,180 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-09 11:16:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:16:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 11:16:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:22,182 INFO L225 Difference]: With dead ends: 27 [2024-11-09 11:16:22,182 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 11:16:22,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:16:22,183 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:22,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 11:16:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 11:16:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.3) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-09 11:16:22,188 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-11-09 11:16:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:22,188 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-09 11:16:22,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-09 11:16:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:16:22,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:22,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:22,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:16:22,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:22,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -872234509, now seen corresponding path program 1 times [2024-11-09 11:16:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:22,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407409806] [2024-11-09 11:16:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407409806] [2024-11-09 11:16:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407409806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:16:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247475385] [2024-11-09 11:16:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:16:22,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:16:22,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:16:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:22,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:16:22,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:16:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:22,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:16:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:22,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247475385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:16:22,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:16:22,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 11:16:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078966464] [2024-11-09 11:16:22,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:16:22,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:16:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:16:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:16:22,395 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:22,515 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-09 11:16:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:16:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:16:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:22,516 INFO L225 Difference]: With dead ends: 35 [2024-11-09 11:16:22,516 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 11:16:22,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:16:22,517 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:22,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:16:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 11:16:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2024-11-09 11:16:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-09 11:16:22,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2024-11-09 11:16:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:22,522 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-09 11:16:22,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-09 11:16:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:16:22,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:22,523 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:22,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:16:22,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 11:16:22,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:22,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1269465954, now seen corresponding path program 1 times [2024-11-09 11:16:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677157014] [2024-11-09 11:16:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677157014] [2024-11-09 11:16:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677157014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:16:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506379871] [2024-11-09 11:16:22,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:22,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:22,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:16:22,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:16:22,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:16:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:22,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:16:22,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:16:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:22,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:16:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506379871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:16:22,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:16:22,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 11:16:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944239787] [2024-11-09 11:16:22,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:16:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:16:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:16:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:16:22,929 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:23,000 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2024-11-09 11:16:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:16:23,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 11:16:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:23,001 INFO L225 Difference]: With dead ends: 31 [2024-11-09 11:16:23,001 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 11:16:23,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:16:23,001 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:23,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 11:16:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 11:16:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-09 11:16:23,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 16 [2024-11-09 11:16:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:23,008 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-09 11:16:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-09 11:16:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:16:23,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:23,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:23,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:16:23,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 11:16:23,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:23,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash -698738859, now seen corresponding path program 1 times [2024-11-09 11:16:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333838549] [2024-11-09 11:16:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333838549] [2024-11-09 11:16:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333838549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:16:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329152713] [2024-11-09 11:16:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:23,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:16:23,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:16:23,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:16:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:23,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:16:23,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:16:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:23,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:16:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329152713] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:16:23,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:16:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 11:16:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122808839] [2024-11-09 11:16:23,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:16:23,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:16:23,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:16:23,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:16:23,338 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:23,478 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 11:16:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:16:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 11:16:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:23,479 INFO L225 Difference]: With dead ends: 39 [2024-11-09 11:16:23,479 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 11:16:23,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:16:23,479 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:23,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:16:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 11:16:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2024-11-09 11:16:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-09 11:16:23,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 17 [2024-11-09 11:16:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:23,485 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-09 11:16:23,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-09 11:16:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 11:16:23,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:23,486 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:23,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:16:23,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:23,690 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:23,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -186068096, now seen corresponding path program 1 times [2024-11-09 11:16:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108826568] [2024-11-09 11:16:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108826568] [2024-11-09 11:16:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108826568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:16:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510323508] [2024-11-09 11:16:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:23,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:16:23,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:16:23,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:16:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:23,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:16:23,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:16:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:23,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:16:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:16:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510323508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:16:23,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:16:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 11:16:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223878613] [2024-11-09 11:16:23,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:16:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:16:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:16:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:16:23,837 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:23,901 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2024-11-09 11:16:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:16:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 11:16:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:23,902 INFO L225 Difference]: With dead ends: 28 [2024-11-09 11:16:23,902 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 11:16:23,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:16:23,902 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:23,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:16:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 11:16:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 11:16:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-09 11:16:23,905 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2024-11-09 11:16:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-09 11:16:23,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-09 11:16:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:16:23,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:16:23,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2024-11-09 11:16:23,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:16:24,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:24,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:16:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:16:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2140114347, now seen corresponding path program 2 times [2024-11-09 11:16:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:16:24,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180225832] [2024-11-09 11:16:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:16:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:16:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:16:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:16:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:16:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180225832] [2024-11-09 11:16:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180225832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:16:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882882030] [2024-11-09 11:16:24,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:16:24,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:16:24,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:16:24,173 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:16:24,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:16:24,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:16:24,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:16:24,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:16:24,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:16:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:16:24,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:16:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:16:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882882030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:16:24,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:16:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-09 11:16:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104381794] [2024-11-09 11:16:24,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:16:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 11:16:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:16:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 11:16:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:16:24,349 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:16:24,567 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-09 11:16:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:16:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 11:16:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:16:24,567 INFO L225 Difference]: With dead ends: 37 [2024-11-09 11:16:24,567 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:16:24,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2024-11-09 11:16:24,568 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:16:24,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 11 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:16:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:16:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:16:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:16:24,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-09 11:16:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:16:24,569 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:16:24,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:16:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:16:24,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-09 11:16:24,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-09 11:16:24,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-09 11:16:24,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:16:24,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 11:16:24,779 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:16:24,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:16:24,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:16:24,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:16:24 BoogieIcfgContainer [2024-11-09 11:16:24,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:16:24,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:16:24,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:16:24,814 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:16:24,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:16:20" (3/4) ... [2024-11-09 11:16:24,816 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:16:24,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 11:16:24,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:16:24,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 11:16:24,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:16:24,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:16:24,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:16:24,879 INFO L158 Benchmark]: Toolchain (without parser) took 4367.14ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 95.7MB in the beginning and 134.4MB in the end (delta: -38.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-09 11:16:24,879 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 153.1MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:16:24,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.04ms. Allocated memory is still 153.1MB. Free memory was 95.7MB in the beginning and 84.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:16:24,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.77ms. Allocated memory is still 153.1MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:16:24,880 INFO L158 Benchmark]: Boogie Preprocessor took 19.04ms. Allocated memory is still 153.1MB. Free memory was 83.2MB in the beginning and 81.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:16:24,880 INFO L158 Benchmark]: RCFGBuilder took 265.85ms. Allocated memory is still 153.1MB. Free memory was 81.7MB in the beginning and 71.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 11:16:24,880 INFO L158 Benchmark]: TraceAbstraction took 3818.22ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 71.2MB in the beginning and 138.7MB in the end (delta: -67.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:16:24,880 INFO L158 Benchmark]: Witness Printer took 65.09ms. Allocated memory is still 195.0MB. Free memory was 138.7MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:16:24,881 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.23ms. Allocated memory is still 153.1MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.04ms. Allocated memory is still 153.1MB. Free memory was 95.7MB in the beginning and 84.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.77ms. Allocated memory is still 153.1MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.04ms. Allocated memory is still 153.1MB. Free memory was 83.2MB in the beginning and 81.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 265.85ms. Allocated memory is still 153.1MB. Free memory was 81.7MB in the beginning and 71.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3818.22ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 71.2MB in the beginning and 138.7MB in the end (delta: -67.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.09ms. Allocated memory is still 195.0MB. Free memory was 138.7MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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 1 procedures, 23 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 114 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=12, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 1384 SizeOfPredicates, 3 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 16/126 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 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((b == 1) && (2 == a)) || ((a == 1) && (2 == b))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:16:24,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE