./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-crafted/xor4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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/array-crafted/xor4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 90b7e6947bda838aad0c5e01877b9a712c46c1a2dc1a2af9f1fb1c6266593b6a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:40:06,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:40:06,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 16:40:06,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:40:06,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:40:06,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:40:06,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:40:06,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:40:06,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:40:06,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:40:06,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:40:06,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:40:06,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:40:06,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:40:06,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:40:06,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:40:06,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:40:06,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:40:06,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:40:06,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:40:06,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:40:06,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:40:06,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:40:06,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:40:06,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:40:06,977 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:40:06,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:40:06,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:40:06,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:40:06,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:40:06,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:40:06,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:40:06,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:40:06,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:40:06,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:40:06,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:40:06,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:40:06,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:40:06,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:40:06,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:40:06,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:40:06,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:40:06,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:40:06,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:40:06,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90b7e6947bda838aad0c5e01877b9a712c46c1a2dc1a2af9f1fb1c6266593b6a [2024-11-12 16:40:07,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:40:07,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:40:07,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:40:07,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:40:07,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:40:07,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor4.i [2024-11-12 16:40:08,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:40:08,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:40:08,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor4.i [2024-11-12 16:40:08,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a15d8df/de8574745d8446128a7161f7cde41604/FLAGeddf0bc8d [2024-11-12 16:40:08,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a15d8df/de8574745d8446128a7161f7cde41604 [2024-11-12 16:40:08,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:40:08,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:40:08,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:40:08,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:40:08,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:40:08,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:08" (1/1) ... [2024-11-12 16:40:08,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d45c9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:08, skipping insertion in model container [2024-11-12 16:40:08,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:08" (1/1) ... [2024-11-12 16:40:08,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:40:09,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:40:09,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:40:09,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:40:09,073 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:40:09,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09 WrapperNode [2024-11-12 16:40:09,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:40:09,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:40:09,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:40:09,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:40:09,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,104 INFO L138 Inliner]: procedures = 16, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-11-12 16:40:09,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:40:09,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:40:09,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:40:09,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:40:09,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,127 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-12 16:40:09,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:40:09,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:40:09,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:40:09,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:40:09,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (1/1) ... [2024-11-12 16:40:09,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:40:09,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:09,168 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-12 16:40:09,170 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-12 16:40:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:40:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:40:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:40:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 16:40:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 16:40:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:40:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:40:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 16:40:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:40:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:40:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:40:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 16:40:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 16:40:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2024-11-12 16:40:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2024-11-12 16:40:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:40:09,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:40:09,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:40:09,669 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-12 16:40:09,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:40:09,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:40:09,688 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 16:40:09,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:09 BoogieIcfgContainer [2024-11-12 16:40:09,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:40:09,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:40:09,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:40:09,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:40:09,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:40:08" (1/3) ... [2024-11-12 16:40:09,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3578dfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:09, skipping insertion in model container [2024-11-12 16:40:09,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:09" (2/3) ... [2024-11-12 16:40:09,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3578dfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:09, skipping insertion in model container [2024-11-12 16:40:09,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:09" (3/3) ... [2024-11-12 16:40:09,708 INFO L112 eAbstractionObserver]: Analyzing ICFG xor4.i [2024-11-12 16:40:09,734 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:40:09,736 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 16:40:09,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:40:09,825 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;@6c242c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:40:09,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 16:40:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 35 states have (on average 1.542857142857143) internal successors, (54), 43 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 16:40:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 16:40:09,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:09,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:40:09,849 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-12 16:40:09,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2024-11-12 16:40:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67232245] [2024-11-12 16:40:09,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:10,122 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-12 16:40:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67232245] [2024-11-12 16:40:10,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67232245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:10,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:10,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647248659] [2024-11-12 16:40:10,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:10,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:10,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:10,154 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.542857142857143) internal successors, (54), 43 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:10,207 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2024-11-12 16:40:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 16:40:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:10,217 INFO L225 Difference]: With dead ends: 93 [2024-11-12 16:40:10,218 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 16:40:10,221 INFO L434 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-12 16:40:10,224 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:10,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 16:40:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-12 16:40:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.4375) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-12 16:40:10,260 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 5 [2024-11-12 16:40:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:10,261 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-12 16:40:10,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-12 16:40:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:40:10,261 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:10,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-12 16:40:10,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:40:10,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2024-11-12 16:40:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214412548] [2024-11-12 16:40:10,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:40:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214412548] [2024-11-12 16:40:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214412548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747745672] [2024-11-12 16:40:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:10,395 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-12 16:40:10,399 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-12 16:40:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:10,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:40:10,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:40:10,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:40:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747745672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:40:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 16:40:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502896093] [2024-11-12 16:40:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:40:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:40:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:40:10,515 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-12 16:40:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:10,546 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-12 16:40:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:40:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-12 16:40:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:10,548 INFO L225 Difference]: With dead ends: 44 [2024-11-12 16:40:10,548 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 16:40:10,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:40:10,549 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:10,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 156 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 16:40:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 16:40:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.40625) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-11-12 16:40:10,554 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 9 [2024-11-12 16:40:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-11-12 16:40:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-12 16:40:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-12 16:40:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 16:40:10,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:10,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-12 16:40:10,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 16:40:10,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:10,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:10,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2024-11-12 16:40:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:10,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372815755] [2024-11-12 16:40:10,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:10,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:40:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:10,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372815755] [2024-11-12 16:40:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372815755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:10,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582106337] [2024-11-12 16:40:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:10,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:10,806 INFO L87 Difference]: Start difference. First operand 43 states and 50 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-12 16:40:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:10,820 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-12 16:40:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:10,821 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-12 16:40:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:10,822 INFO L225 Difference]: With dead ends: 43 [2024-11-12 16:40:10,822 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 16:40:10,822 INFO L434 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-12 16:40:10,823 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:10,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 16:40:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-12 16:40:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-12 16:40:10,828 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 10 [2024-11-12 16:40:10,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:10,828 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-12 16:40:10,829 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-12 16:40:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-12 16:40:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:40:10,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:10,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:40:10,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:10,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1844601069, now seen corresponding path program 1 times [2024-11-12 16:40:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088058044] [2024-11-12 16:40:10,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:40:10,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:10,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088058044] [2024-11-12 16:40:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088058044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927463696] [2024-11-12 16:40:10,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:10,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:10,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:10,884 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-12 16:40:10,885 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-12 16:40:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:10,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:40:10,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:40:10,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:40:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:40:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927463696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:40:11,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:40:11,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-12 16:40:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869897289] [2024-11-12 16:40:11,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:40:11,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:40:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:11,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:40:11,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:40:11,008 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:11,047 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2024-11-12 16:40:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:40:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:40:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:11,048 INFO L225 Difference]: With dead ends: 79 [2024-11-12 16:40:11,048 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 16:40:11,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:40:11,049 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:11,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 159 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 16:40:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-12 16:40:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-11-12 16:40:11,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 15 [2024-11-12 16:40:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:11,059 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-11-12 16:40:11,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-12 16:40:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 16:40:11,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:11,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:11,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 16:40:11,264 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,SelfDestructingSolverStorable3 [2024-11-12 16:40:11,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1963363813, now seen corresponding path program 2 times [2024-11-12 16:40:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:11,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153504758] [2024-11-12 16:40:11,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:40:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153504758] [2024-11-12 16:40:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153504758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072181500] [2024-11-12 16:40:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:11,357 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:11,394 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2024-11-12 16:40:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-12 16:40:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:11,395 INFO L225 Difference]: With dead ends: 86 [2024-11-12 16:40:11,396 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 16:40:11,396 INFO L434 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-12 16:40:11,397 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:11,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 16:40:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 16:40:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-12 16:40:11,409 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 23 [2024-11-12 16:40:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-12 16:40:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-12 16:40:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 16:40:11,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:11,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:40:11,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash 427042622, now seen corresponding path program 1 times [2024-11-12 16:40:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372614411] [2024-11-12 16:40:11,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:11,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:11,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372614411] [2024-11-12 16:40:11,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372614411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:11,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306852626] [2024-11-12 16:40:11,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:11,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:11,574 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-12 16:40:11,578 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-12 16:40:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:11,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:40:11,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:11,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:40:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306852626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:40:11,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:40:11,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-12 16:40:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731037285] [2024-11-12 16:40:11,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:40:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 16:40:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 16:40:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-12 16:40:11,745 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:11,786 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2024-11-12 16:40:11,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 16:40:11,787 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-12 16:40:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:11,788 INFO L225 Difference]: With dead ends: 113 [2024-11-12 16:40:11,788 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 16:40:11,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-12 16:40:11,791 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 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-12 16:40:11,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 16:40:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 16:40:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 68 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-11-12 16:40:11,800 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 29 [2024-11-12 16:40:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:11,802 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-11-12 16:40:11,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-11-12 16:40:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 16:40:11,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:11,803 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:11,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 16:40:12,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:12,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash 382854446, now seen corresponding path program 2 times [2024-11-12 16:40:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060284741] [2024-11-12 16:40:12,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060284741] [2024-11-12 16:40:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060284741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031285727] [2024-11-12 16:40:12,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:40:12,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:12,328 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-12 16:40:12,329 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-12 16:40:12,403 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:40:12,403 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:40:12,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:40:12,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:12,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:40:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031285727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:40:12,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:40:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-12 16:40:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020181159] [2024-11-12 16:40:12,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:40:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 16:40:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 16:40:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 16:40:12,764 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:12,866 INFO L93 Difference]: Finished difference Result 145 states and 172 transitions. [2024-11-12 16:40:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-12 16:40:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-12 16:40:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:12,867 INFO L225 Difference]: With dead ends: 145 [2024-11-12 16:40:12,867 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 16:40:12,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 16:40:12,869 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:12,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 197 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:40:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 16:40:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 16:40:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 100 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-12 16:40:12,876 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 45 [2024-11-12 16:40:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:12,876 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-12 16:40:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-12 16:40:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 16:40:12,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:12,878 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:12,892 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-12 16:40:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:13,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1270857998, now seen corresponding path program 3 times [2024-11-12 16:40:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591351606] [2024-11-12 16:40:13,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:40:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591351606] [2024-11-12 16:40:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591351606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712479390] [2024-11-12 16:40:13,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:40:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:13,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:13,697 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-12 16:40:13,699 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-12 16:40:13,755 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 16:40:13,755 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:40:13,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:40:13,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-12 16:40:13,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:40:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712479390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:40:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [33] total 37 [2024-11-12 16:40:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010498843] [2024-11-12 16:40:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:13,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:40:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:40:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-11-12 16:40:13,843 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:13,863 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-12 16:40:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:40:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-12 16:40:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:13,865 INFO L225 Difference]: With dead ends: 104 [2024-11-12 16:40:13,866 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 16:40:13,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-11-12 16:40:13,867 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:13,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 158 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 16:40:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 16:40:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.148936170212766) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-12 16:40:13,873 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 77 [2024-11-12 16:40:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-12 16:40:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-12 16:40:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 16:40:13,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:13,875 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:13,889 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-12 16:40:14,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:14,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:14,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash 741892402, now seen corresponding path program 1 times [2024-11-12 16:40:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:14,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540537825] [2024-11-12 16:40:14,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 16:40:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540537825] [2024-11-12 16:40:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540537825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:14,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543714560] [2024-11-12 16:40:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:14,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:14,151 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:14,159 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-12 16:40:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-12 16:40:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:14,160 INFO L225 Difference]: With dead ends: 103 [2024-11-12 16:40:14,160 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 16:40:14,160 INFO L434 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-12 16:40:14,161 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:14,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 16:40:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2024-11-12 16:40:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 88 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-11-12 16:40:14,166 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 78 [2024-11-12 16:40:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:14,166 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-11-12 16:40:14,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:40:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-11-12 16:40:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 16:40:14,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:14,167 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:14,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:40:14,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:14,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash -469779794, now seen corresponding path program 1 times [2024-11-12 16:40:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:14,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387805965] [2024-11-12 16:40:14,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:14,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 16:40:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 16:40:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-12 16:40:14,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387805965] [2024-11-12 16:40:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387805965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374458868] [2024-11-12 16:40:14,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:14,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:14,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:40:14,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 16:40:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:40:14,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-12 16:40:14,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:40:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374458868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:14,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:40:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 16:40:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086384225] [2024-11-12 16:40:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:40:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:40:14,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:40:14,375 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:14,391 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2024-11-12 16:40:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:40:14,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-12 16:40:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:14,392 INFO L225 Difference]: With dead ends: 97 [2024-11-12 16:40:14,392 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 16:40:14,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:40:14,393 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:14,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 16:40:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-12 16:40:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 87 states have (on average 1.103448275862069) internal successors, (96), 90 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-12 16:40:14,397 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 92 [2024-11-12 16:40:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-12 16:40:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-12 16:40:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 16:40:14,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:14,399 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:14,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 16:40:14,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:14,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:14,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1678271660, now seen corresponding path program 1 times [2024-11-12 16:40:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:14,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929915292] [2024-11-12 16:40:14,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 16:40:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 16:40:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-12 16:40:14,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929915292] [2024-11-12 16:40:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929915292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626652895] [2024-11-12 16:40:14,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:14,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:14,703 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:40:14,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 16:40:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:14,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:40:14,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-12 16:40:14,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:40:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626652895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:40:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 16:40:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303243553] [2024-11-12 16:40:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:14,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:40:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:40:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:40:14,799 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:14,811 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-12 16:40:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:40:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-12 16:40:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:14,813 INFO L225 Difference]: With dead ends: 97 [2024-11-12 16:40:14,813 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 16:40:14,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:40:14,814 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:14,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 16:40:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-12 16:40:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-12 16:40:14,825 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 93 [2024-11-12 16:40:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:14,825 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-12 16:40:14,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-12 16:40:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 16:40:14,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:14,826 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:14,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 16:40:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:15,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2088640214, now seen corresponding path program 1 times [2024-11-12 16:40:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600720471] [2024-11-12 16:40:15,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 16:40:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 16:40:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-12 16:40:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600720471] [2024-11-12 16:40:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600720471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211539011] [2024-11-12 16:40:15,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:15,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:40:15,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 16:40:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:15,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 16:40:15,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:40:15,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:40:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:40:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211539011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:40:16,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:40:16,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2024-11-12 16:40:16,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017817545] [2024-11-12 16:40:16,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:40:16,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-12 16:40:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-12 16:40:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-11-12 16:40:16,617 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 67 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 67 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 16:40:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:16,794 INFO L93 Difference]: Finished difference Result 206 states and 242 transitions. [2024-11-12 16:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-12 16:40:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 67 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 95 [2024-11-12 16:40:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:16,796 INFO L225 Difference]: With dead ends: 206 [2024-11-12 16:40:16,796 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 16:40:16,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-11-12 16:40:16,798 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:16,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 395 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:40:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 16:40:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2024-11-12 16:40:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 161 states have (on average 1.0745341614906831) internal successors, (173), 164 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2024-11-12 16:40:16,808 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 95 [2024-11-12 16:40:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:16,809 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2024-11-12 16:40:16,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 67 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 16:40:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2024-11-12 16:40:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 16:40:16,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:16,812 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:16,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 16:40:17,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-12 16:40:17,013 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-12 16:40:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -191370890, now seen corresponding path program 2 times [2024-11-12 16:40:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889796037] [2024-11-12 16:40:17,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 16:40:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 16:40:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2024-11-12 16:40:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889796037] [2024-11-12 16:40:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889796037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938269188] [2024-11-12 16:40:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:17,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:17,125 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:17,142 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2024-11-12 16:40:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-12 16:40:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:17,144 INFO L225 Difference]: With dead ends: 173 [2024-11-12 16:40:17,144 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 16:40:17,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-12 16:40:17,144 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:17,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 16:40:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-12 16:40:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 164 states have (on average 1.0731707317073171) internal successors, (176), 167 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 180 transitions. [2024-11-12 16:40:17,148 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 180 transitions. Word has length 171 [2024-11-12 16:40:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:17,149 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 180 transitions. [2024-11-12 16:40:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 180 transitions. [2024-11-12 16:40:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 16:40:17,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:17,150 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:17,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:40:17,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1708511020, now seen corresponding path program 1 times [2024-11-12 16:40:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082842153] [2024-11-12 16:40:17,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 16:40:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 16:40:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2024-11-12 16:40:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082842153] [2024-11-12 16:40:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082842153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:40:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865719772] [2024-11-12 16:40:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:40:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:40:17,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:40:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 16:40:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:17,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-12 16:40:17,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:40:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-12 16:40:18,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:40:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-12 16:40:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865719772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:40:21,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:40:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 65, 65] total 131 [2024-11-12 16:40:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153093310] [2024-11-12 16:40:21,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:40:21,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2024-11-12 16:40:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2024-11-12 16:40:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4166, Invalid=12864, Unknown=0, NotChecked=0, Total=17030 [2024-11-12 16:40:21,590 INFO L87 Difference]: Start difference. First operand 171 states and 180 transitions. Second operand has 131 states, 131 states have (on average 2.2900763358778624) internal successors, (300), 131 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 16:40:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:21,947 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2024-11-12 16:40:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-11-12 16:40:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 2.2900763358778624) internal successors, (300), 131 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 174 [2024-11-12 16:40:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:21,949 INFO L225 Difference]: With dead ends: 347 [2024-11-12 16:40:21,949 INFO L226 Difference]: Without dead ends: 303 [2024-11-12 16:40:21,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4166, Invalid=12864, Unknown=0, NotChecked=0, Total=17030 [2024-11-12 16:40:21,952 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:21,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 325 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 16:40:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-12 16:40:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-12 16:40:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 294 states have (on average 1.0408163265306123) internal successors, (306), 297 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 310 transitions. [2024-11-12 16:40:21,958 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 310 transitions. Word has length 174 [2024-11-12 16:40:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:21,959 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 310 transitions. [2024-11-12 16:40:21,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 2.2900763358778624) internal successors, (300), 131 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 16:40:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 310 transitions. [2024-11-12 16:40:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-12 16:40:21,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:21,961 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:21,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 16:40:22,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 16:40:22,162 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-12 16:40:22,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash -586122898, now seen corresponding path program 1 times [2024-11-12 16:40:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102582125] [2024-11-12 16:40:22,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-12 16:40:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-12 16:40:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7927 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7925 trivial. 0 not checked. [2024-11-12 16:40:22,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:22,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102582125] [2024-11-12 16:40:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102582125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:22,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:22,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:40:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112398582] [2024-11-12 16:40:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:22,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:40:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:22,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:40:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:40:22,349 INFO L87 Difference]: Start difference. First operand 301 states and 310 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:22,365 INFO L93 Difference]: Finished difference Result 301 states and 310 transitions. [2024-11-12 16:40:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:40:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 303 [2024-11-12 16:40:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:22,367 INFO L225 Difference]: With dead ends: 301 [2024-11-12 16:40:22,368 INFO L226 Difference]: Without dead ends: 300 [2024-11-12 16:40:22,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:40:22,369 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:22,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-12 16:40:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-12 16:40:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 294 states have (on average 1.0374149659863945) internal successors, (305), 296 states have internal predecessors, (305), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 309 transitions. [2024-11-12 16:40:22,379 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 309 transitions. Word has length 303 [2024-11-12 16:40:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:22,380 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 309 transitions. [2024-11-12 16:40:22,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 309 transitions. [2024-11-12 16:40:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-12 16:40:22,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:22,385 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:22,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 16:40:22,385 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:22,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash -623387024, now seen corresponding path program 1 times [2024-11-12 16:40:22,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:22,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323119819] [2024-11-12 16:40:22,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-12 16:40:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-12 16:40:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7929 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7926 trivial. 0 not checked. [2024-11-12 16:40:22,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323119819] [2024-11-12 16:40:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323119819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75760412] [2024-11-12 16:40:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:22,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:22,577 INFO L87 Difference]: Start difference. First operand 300 states and 309 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:22,592 INFO L93 Difference]: Finished difference Result 300 states and 309 transitions. [2024-11-12 16:40:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:22,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2024-11-12 16:40:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:22,594 INFO L225 Difference]: With dead ends: 300 [2024-11-12 16:40:22,594 INFO L226 Difference]: Without dead ends: 298 [2024-11-12 16:40:22,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-12 16:40:22,595 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:22,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-12 16:40:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2024-11-12 16:40:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 292 states have (on average 1.0308219178082192) internal successors, (301), 292 states have internal predecessors, (301), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:40:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 305 transitions. [2024-11-12 16:40:22,602 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 305 transitions. Word has length 305 [2024-11-12 16:40:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:22,602 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 305 transitions. [2024-11-12 16:40:22,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 305 transitions. [2024-11-12 16:40:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-12 16:40:22,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:40:22,604 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:22,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 16:40:22,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:40:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:40:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2145128488, now seen corresponding path program 1 times [2024-11-12 16:40:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:40:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252802825] [2024-11-12 16:40:22,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:40:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:40:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-12 16:40:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-12 16:40:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:40:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7930 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7925 trivial. 0 not checked. [2024-11-12 16:40:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:40:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252802825] [2024-11-12 16:40:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252802825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:40:22,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:40:22,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:40:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056146013] [2024-11-12 16:40:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:40:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:40:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:40:22,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:40:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:40:22,882 INFO L87 Difference]: Start difference. First operand 296 states and 305 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:40:22,895 INFO L93 Difference]: Finished difference Result 296 states and 305 transitions. [2024-11-12 16:40:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:40:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 306 [2024-11-12 16:40:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:40:22,896 INFO L225 Difference]: With dead ends: 296 [2024-11-12 16:40:22,896 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 16:40:22,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-12 16:40:22,897 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:40:22,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:40:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 16:40:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 16:40:22,897 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-12 16:40:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 16:40:22,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2024-11-12 16:40:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:40:22,898 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 16:40:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:40:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 16:40:22,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 16:40:22,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-12 16:40:22,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-12 16:40:22,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-12 16:40:22,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-12 16:40:22,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-12 16:40:22,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-12 16:40:22,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-12 16:40:22,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-12 16:40:22,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 16:40:22,904 INFO L421 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:40:22,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 16:40:22,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:40:22,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:40:22 BoogieIcfgContainer [2024-11-12 16:40:22,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:40:22,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:40:22,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:40:22,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:40:22,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:09" (3/4) ... [2024-11-12 16:40:22,992 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 16:40:22,995 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure xor [2024-11-12 16:40:22,999 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-12 16:40:22,999 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-12 16:40:22,999 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 16:40:22,999 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 16:40:23,000 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 16:40:23,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:40:23,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 16:40:23,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:40:23,082 INFO L158 Benchmark]: Toolchain (without parser) took 14253.91ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 94.0MB in the beginning and 256.0MB in the end (delta: -162.1MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-12 16:40:23,082 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory was 121.5MB in the beginning and 121.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:40:23,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.85ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 133.8MB in the end (delta: -40.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-12 16:40:23,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.70ms. Allocated memory is still 163.6MB. Free memory was 133.0MB in the beginning and 131.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:40:23,082 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 163.6MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:40:23,082 INFO L158 Benchmark]: RCFGBuilder took 549.99ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 114.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 16:40:23,083 INFO L158 Benchmark]: TraceAbstraction took 13293.65ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 114.2MB in the beginning and 262.2MB in the end (delta: -148.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-12 16:40:23,083 INFO L158 Benchmark]: Witness Printer took 91.38ms. Allocated memory is still 356.5MB. Free memory was 262.2MB in the beginning and 256.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 16:40:23,084 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.15ms. Allocated memory is still 163.6MB. Free memory was 121.5MB in the beginning and 121.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.85ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 133.8MB in the end (delta: -40.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.70ms. Allocated memory is still 163.6MB. Free memory was 133.0MB in the beginning and 131.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 163.6MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 549.99ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 114.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13293.65ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 114.2MB in the beginning and 262.2MB in the end (delta: -148.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 91.38ms. Allocated memory is still 356.5MB. Free memory was 262.2MB in the beginning and 256.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 17, TraceHistogramMax: 63, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 2501 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1861 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 640 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1116 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6704 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=14, InterpolantAutomatonStates: 298, 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, 17 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2459 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2786 ConstructedInterpolants, 0 QuantifiedInterpolants, 4120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2157 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 31 InterpolantComputations, 12 PerfectInterpolantSequences, 30947/36399 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: 37]: Loop Invariant Derived loop invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((i == 1) || (1 < i)) RESULT: Ultimate proved your program to be correct! [2024-11-12 16:40:23,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE