./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.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 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:53:57,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:53:57,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 19:53:57,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:53:57,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:53:57,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:53:57,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:53:57,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:53:57,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:53:57,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:53:57,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:53:57,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:53:57,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:53:57,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:53:57,707 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:53:57,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:53:57,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:53:57,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:53:57,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:53:57,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:53:57,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:53:57,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:53:57,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:53:57,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:53:57,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:53:57,711 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:53:57,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:53:57,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:53:57,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:53:57,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:53:57,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:53:57,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:53:57,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:53:57,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:53:57,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:53:57,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:53:57,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:53:57,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:53:57,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:53:57,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:53:57,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:53:57,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:53:57,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:53:57,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:53:57,715 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 -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2024-10-24 19:53:57,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:53:57,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:53:57,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:53:57,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:53:57,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:53:57,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-10-24 19:53:59,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:53:59,501 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:53:59,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-10-24 19:53:59,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a06b69e7/2b13849a59ef451492d8bff99127891e/FLAG875b542b2 [2024-10-24 19:53:59,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a06b69e7/2b13849a59ef451492d8bff99127891e [2024-10-24 19:53:59,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:53:59,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:53:59,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:53:59,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:53:59,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:53:59,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a015009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59, skipping insertion in model container [2024-10-24 19:53:59,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:53:59,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:53:59,720 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:53:59,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:53:59,757 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:53:59,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59 WrapperNode [2024-10-24 19:53:59,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:53:59,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:53:59,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:53:59,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:53:59,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,785 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-24 19:53:59,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:53:59,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:53:59,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:53:59,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:53:59,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,827 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 19:53:59,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:53:59,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:53:59,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:53:59,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:53:59,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (1/1) ... [2024-10-24 19:53:59,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:53:59,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:53:59,889 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-10-24 19:53:59,891 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-10-24 19:53:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:53:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:53:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:53:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:53:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 19:53:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 19:53:59,989 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:53:59,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:54:00,154 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-24 19:54:00,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:54:00,201 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:54:00,201 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 19:54:00,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:54:00 BoogieIcfgContainer [2024-10-24 19:54:00,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:54:00,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:54:00,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:54:00,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:54:00,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:53:59" (1/3) ... [2024-10-24 19:54:00,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654bf80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:54:00, skipping insertion in model container [2024-10-24 19:54:00,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:59" (2/3) ... [2024-10-24 19:54:00,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654bf80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:54:00, skipping insertion in model container [2024-10-24 19:54:00,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:54:00" (3/3) ... [2024-10-24 19:54:00,209 INFO L112 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2024-10-24 19:54:00,223 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:54:00,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-24 19:54:00,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:54:00,288 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;@1eed7f88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:54:00,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-24 19:54:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 40 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 19:54:00,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:00,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:00,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash -247214566, now seen corresponding path program 1 times [2024-10-24 19:54:00,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:00,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545714679] [2024-10-24 19:54:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545714679] [2024-10-24 19:54:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545714679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:54:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889464767] [2024-10-24 19:54:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:00,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:54:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:00,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:54:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:00,517 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 40 states have internal predecessors, (52), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:00,620 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-24 19:54:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:54:00,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 19:54:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:00,629 INFO L225 Difference]: With dead ends: 68 [2024-10-24 19:54:00,629 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 19:54:00,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:54:00,633 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:00,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:54:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 19:54:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-24 19:54:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-10-24 19:54:00,658 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 9 [2024-10-24 19:54:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:00,659 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-10-24 19:54:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-10-24 19:54:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 19:54:00,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:00,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:54:00,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 926283120, now seen corresponding path program 1 times [2024-10-24 19:54:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101877905] [2024-10-24 19:54:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101877905] [2024-10-24 19:54:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101877905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:54:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871240752] [2024-10-24 19:54:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:00,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:54:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:54:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:00,741 INFO L87 Difference]: Start difference. First operand 39 states and 40 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-10-24 19:54:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:00,817 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-24 19:54:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:54:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 19:54:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:00,818 INFO L225 Difference]: With dead ends: 39 [2024-10-24 19:54:00,819 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 19:54:00,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:54:00,820 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:00,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 58 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:54:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 19:54:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 19:54:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.4) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-24 19:54:00,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 10 [2024-10-24 19:54:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:00,833 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-24 19:54:00,834 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-10-24 19:54:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-24 19:54:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 19:54:00,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:00,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:54:00,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:00,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1349994276, now seen corresponding path program 1 times [2024-10-24 19:54:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425919868] [2024-10-24 19:54:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:00,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425919868] [2024-10-24 19:54:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425919868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:00,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:00,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:54:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814167960] [2024-10-24 19:54:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:54:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:00,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:54:00,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:00,935 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:00,952 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-10-24 19:54:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:54:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 19:54:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:00,954 INFO L225 Difference]: With dead ends: 38 [2024-10-24 19:54:00,954 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 19:54:00,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:00,955 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:00,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 19:54:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 19:54:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.36) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-10-24 19:54:00,960 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 11 [2024-10-24 19:54:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:00,960 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-10-24 19:54:00,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-10-24 19:54:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 19:54:00,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:00,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:00,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:54:00,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:00,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1099850482, now seen corresponding path program 1 times [2024-10-24 19:54:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562803306] [2024-10-24 19:54:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562803306] [2024-10-24 19:54:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562803306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:54:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138195124] [2024-10-24 19:54:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:54:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:54:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:01,088 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:01,105 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-10-24 19:54:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:54:01,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 19:54:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:01,106 INFO L225 Difference]: With dead ends: 37 [2024-10-24 19:54:01,106 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 19:54:01,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:01,108 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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-10-24 19:54:01,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 19:54:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-24 19:54:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-10-24 19:54:01,111 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 12 [2024-10-24 19:54:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:01,112 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-10-24 19:54:01,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-10-24 19:54:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 19:54:01,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:01,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:01,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:54:01,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:01,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash -264373346, now seen corresponding path program 1 times [2024-10-24 19:54:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866213391] [2024-10-24 19:54:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866213391] [2024-10-24 19:54:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866213391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:01,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:01,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:54:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470095828] [2024-10-24 19:54:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:01,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:54:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:54:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:54:01,141 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:01,152 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-24 19:54:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:54:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 19:54:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:01,153 INFO L225 Difference]: With dead ends: 36 [2024-10-24 19:54:01,154 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 19:54:01,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:54:01,155 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:01,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 19:54:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-24 19:54:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-24 19:54:01,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 13 [2024-10-24 19:54:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-24 19:54:01,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-24 19:54:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:54:01,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:01,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:01,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:54:01,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:01,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 394360948, now seen corresponding path program 1 times [2024-10-24 19:54:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:01,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961489093] [2024-10-24 19:54:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961489093] [2024-10-24 19:54:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961489093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:54:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105306901] [2024-10-24 19:54:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:54:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:54:01,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:54:01,187 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:01,204 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-24 19:54:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:54:01,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-10-24 19:54:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:01,205 INFO L225 Difference]: With dead ends: 35 [2024-10-24 19:54:01,205 INFO L226 Difference]: Without dead ends: 34 [2024-10-24 19:54:01,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:54:01,206 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:01,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-24 19:54:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-24 19:54:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-24 19:54:01,212 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 14 [2024-10-24 19:54:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:01,212 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-24 19:54:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-24 19:54:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 19:54:01,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:01,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:01,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:54:01,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:01,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 601469736, now seen corresponding path program 1 times [2024-10-24 19:54:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961179917] [2024-10-24 19:54:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:01,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961179917] [2024-10-24 19:54:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961179917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:54:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503306167] [2024-10-24 19:54:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:54:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:54:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:54:01,277 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:54:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:01,303 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-24 19:54:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:54:01,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-24 19:54:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:01,304 INFO L225 Difference]: With dead ends: 34 [2024-10-24 19:54:01,305 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 19:54:01,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:54:01,306 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:01,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 19:54:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 19:54:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 19:54:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-24 19:54:01,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2024-10-24 19:54:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:01,315 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-24 19:54:01,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:54:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-24 19:54:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 19:54:01,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:01,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:01,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:54:01,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:01,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1465692732, now seen corresponding path program 1 times [2024-10-24 19:54:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049521816] [2024-10-24 19:54:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:54:01,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049521816] [2024-10-24 19:54:01,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049521816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:01,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:01,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:54:01,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712200352] [2024-10-24 19:54:01,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:01,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:54:01,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:01,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:54:01,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:54:01,398 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:54:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:01,432 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-24 19:54:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:54:01,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 19:54:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:01,433 INFO L225 Difference]: With dead ends: 41 [2024-10-24 19:54:01,433 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 19:54:01,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:54:01,434 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:01,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 19:54:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-24 19:54:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 19:54:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-10-24 19:54:01,441 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 23 [2024-10-24 19:54:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:01,441 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-24 19:54:01,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:54:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-10-24 19:54:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 19:54:01,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:01,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:54:01,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:01,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash -729117782, now seen corresponding path program 1 times [2024-10-24 19:54:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:01,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140886969] [2024-10-24 19:54:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:54:01,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140886969] [2024-10-24 19:54:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140886969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:01,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:54:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:54:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020335954] [2024-10-24 19:54:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:01,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:54:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:54:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:54:01,519 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-24 19:54:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:01,540 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-24 19:54:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:54:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 31 [2024-10-24 19:54:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:01,541 INFO L225 Difference]: With dead ends: 43 [2024-10-24 19:54:01,542 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 19:54:01,542 INFO L431 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-10-24 19:54:01,542 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:01,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 19:54:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 19:54:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 19:54:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-10-24 19:54:01,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 31 [2024-10-24 19:54:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:01,547 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-10-24 19:54:01,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-24 19:54:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-10-24 19:54:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 19:54:01,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:01,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:01,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:54:01,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:01,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash 364987358, now seen corresponding path program 1 times [2024-10-24 19:54:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:01,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807731503] [2024-10-24 19:54:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:54:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807731503] [2024-10-24 19:54:01,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807731503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319691172] [2024-10-24 19:54:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:01,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:01,718 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-10-24 19:54:01,720 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-10-24 19:54:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:01,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:54:01,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:54:01,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:54:02,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319691172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:02,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:02,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2024-10-24 19:54:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340799361] [2024-10-24 19:54:02,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:02,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 19:54:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 19:54:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-24 19:54:02,056 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 19:54:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:02,188 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-10-24 19:54:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:54:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 40 [2024-10-24 19:54:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:02,189 INFO L225 Difference]: With dead ends: 80 [2024-10-24 19:54:02,189 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 19:54:02,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-10-24 19:54:02,190 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:02,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:54:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 19:54:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-24 19:54:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 19:54:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2024-10-24 19:54:02,196 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 40 [2024-10-24 19:54:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:02,196 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-10-24 19:54:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 19:54:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2024-10-24 19:54:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 19:54:02,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:02,197 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:02,213 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-10-24 19:54:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 19:54:02,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2061739188, now seen corresponding path program 1 times [2024-10-24 19:54:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617808784] [2024-10-24 19:54:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 19:54:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617808784] [2024-10-24 19:54:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617808784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469080864] [2024-10-24 19:54:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:02,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:02,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:02,492 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-10-24 19:54:02,493 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-10-24 19:54:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:54:02,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 19:54:02,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:54:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469080864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:54:02,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:54:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-24 19:54:02,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109749550] [2024-10-24 19:54:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:54:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:54:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:54:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:54:02,596 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 19:54:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:02,623 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-10-24 19:54:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:54:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-10-24 19:54:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:02,625 INFO L225 Difference]: With dead ends: 72 [2024-10-24 19:54:02,627 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 19:54:02,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 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-10-24 19:54:02,627 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:02,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 19:54:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 19:54:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 19:54:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2024-10-24 19:54:02,639 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 48 [2024-10-24 19:54:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2024-10-24 19:54:02,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 19:54:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2024-10-24 19:54:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 19:54:02,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:02,642 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2024-10-24 19:54:02,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 19:54:02,843 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,SelfDestructingSolverStorable10 [2024-10-24 19:54:02,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 510594723, now seen corresponding path program 1 times [2024-10-24 19:54:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514275315] [2024-10-24 19:54:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 19:54:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:02,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514275315] [2024-10-24 19:54:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514275315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750712534] [2024-10-24 19:54:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:02,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:02,913 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-10-24 19:54:02,915 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-10-24 19:54:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:02,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:54:02,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 19:54:02,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 19:54:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750712534] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:03,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-24 19:54:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674311359] [2024-10-24 19:54:03,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:54:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:54:03,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:54:03,033 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-24 19:54:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:03,078 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-24 19:54:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 19:54:03,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2024-10-24 19:54:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:03,080 INFO L225 Difference]: With dead ends: 72 [2024-10-24 19:54:03,080 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 19:54:03,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:54:03,080 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:03,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:54:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 19:54:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 19:54:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 58 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 19:54:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-10-24 19:54:03,087 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 49 [2024-10-24 19:54:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-10-24 19:54:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-24 19:54:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-10-24 19:54:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 19:54:03,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:03,088 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:03,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 19:54:03,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:03,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:03,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1774626944, now seen corresponding path program 1 times [2024-10-24 19:54:03,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:03,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329543967] [2024-10-24 19:54:03,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:03,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 19:54:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:54:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 19:54:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 19:54:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 19:54:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 19:54:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 19:54:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329543967] [2024-10-24 19:54:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329543967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594082793] [2024-10-24 19:54:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:03,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:03,454 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-10-24 19:54:03,458 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-10-24 19:54:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:03,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 19:54:03,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 19:54:03,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 19:54:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594082793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:03,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-10-24 19:54:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444513980] [2024-10-24 19:54:03,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:03,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 19:54:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:03,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 19:54:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2024-10-24 19:54:03,896 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 25 states, 24 states have (on average 6.041666666666667) internal successors, (145), 25 states have internal predecessors, (145), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-10-24 19:54:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:04,132 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2024-10-24 19:54:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 19:54:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.041666666666667) internal successors, (145), 25 states have internal predecessors, (145), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 98 [2024-10-24 19:54:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:04,134 INFO L225 Difference]: With dead ends: 136 [2024-10-24 19:54:04,134 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 19:54:04,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=576, Unknown=0, NotChecked=0, Total=870 [2024-10-24 19:54:04,136 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:04,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 179 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 19:54:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 19:54:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2024-10-24 19:54:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.09) internal successors, (109), 102 states have internal predecessors, (109), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 19:54:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2024-10-24 19:54:04,154 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 98 [2024-10-24 19:54:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2024-10-24 19:54:04,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.041666666666667) internal successors, (145), 25 states have internal predecessors, (145), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-10-24 19:54:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2024-10-24 19:54:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 19:54:04,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:04,155 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:04,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 19:54:04,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:04,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:04,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 314513797, now seen corresponding path program 2 times [2024-10-24 19:54:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679234264] [2024-10-24 19:54:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 19:54:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:54:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 19:54:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 19:54:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 19:54:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 19:54:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 19:54:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679234264] [2024-10-24 19:54:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679234264] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007203822] [2024-10-24 19:54:04,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:54:04,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:04,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:04,532 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-10-24 19:54:04,540 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-10-24 19:54:04,575 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:54:04,575 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:54:04,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:54:04,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-24 19:54:04,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-24 19:54:04,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007203822] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:04,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:04,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2024-10-24 19:54:04,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24601550] [2024-10-24 19:54:04,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:04,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 19:54:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 19:54:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-24 19:54:04,783 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 18 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-10-24 19:54:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:04,976 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2024-10-24 19:54:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 19:54:04,976 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 100 [2024-10-24 19:54:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:04,977 INFO L225 Difference]: With dead ends: 128 [2024-10-24 19:54:04,977 INFO L226 Difference]: Without dead ends: 127 [2024-10-24 19:54:04,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2024-10-24 19:54:04,978 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:04,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 173 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:54:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-24 19:54:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-24 19:54:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.02) internal successors, (102), 101 states have internal predecessors, (102), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 19:54:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2024-10-24 19:54:04,988 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 100 [2024-10-24 19:54:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:04,988 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2024-10-24 19:54:04,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-10-24 19:54:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2024-10-24 19:54:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 19:54:04,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:04,991 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:05,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 19:54:05,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 19:54:05,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:05,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1380283038, now seen corresponding path program 2 times [2024-10-24 19:54:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:05,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763264170] [2024-10-24 19:54:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 19:54:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:54:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 19:54:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 19:54:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 19:54:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 19:54:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 19:54:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 19:54:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 19:54:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 19:54:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 19:54:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 19:54:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 19:54:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 19:54:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 19:54:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 19:54:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 19:54:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 19:54:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-24 19:54:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 19:54:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763264170] [2024-10-24 19:54:05,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763264170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038144204] [2024-10-24 19:54:05,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:54:05,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:05,579 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-10-24 19:54:05,580 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-10-24 19:54:05,660 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:54:05,660 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:54:05,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 19:54:05,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 19:54:05,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 19:54:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038144204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:06,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:06,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2024-10-24 19:54:06,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89548160] [2024-10-24 19:54:06,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:06,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-24 19:54:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-24 19:54:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=1237, Unknown=0, NotChecked=0, Total=2070 [2024-10-24 19:54:06,340 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-10-24 19:54:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:06,618 INFO L93 Difference]: Finished difference Result 252 states and 327 transitions. [2024-10-24 19:54:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 19:54:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) Word has length 210 [2024-10-24 19:54:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:06,620 INFO L225 Difference]: With dead ends: 252 [2024-10-24 19:54:06,620 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 19:54:06,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1008, Invalid=1542, Unknown=0, NotChecked=0, Total=2550 [2024-10-24 19:54:06,622 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:06,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 183 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 19:54:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 19:54:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-24 19:54:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 196 states have (on average 1.010204081632653) internal successors, (198), 197 states have internal predecessors, (198), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 19:54:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2024-10-24 19:54:06,635 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 210 [2024-10-24 19:54:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:06,635 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2024-10-24 19:54:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-10-24 19:54:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2024-10-24 19:54:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-10-24 19:54:06,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:06,640 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:06,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 19:54:06,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 19:54:06,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:06,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash 189838848, now seen corresponding path program 2 times [2024-10-24 19:54:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:06,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004658169] [2024-10-24 19:54:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 19:54:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:54:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 19:54:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 19:54:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 19:54:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 19:54:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 19:54:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 19:54:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 19:54:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 19:54:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 19:54:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 19:54:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 19:54:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 19:54:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 19:54:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 19:54:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 19:54:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 19:54:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-24 19:54:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-24 19:54:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-24 19:54:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-24 19:54:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-24 19:54:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-24 19:54:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-24 19:54:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-24 19:54:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-24 19:54:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-24 19:54:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-10-24 19:54:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-24 19:54:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-10-24 19:54:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-24 19:54:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-10-24 19:54:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-24 19:54:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-24 19:54:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-24 19:54:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-24 19:54:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-10-24 19:54:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-24 19:54:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-24 19:54:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2024-10-24 19:54:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-10-24 19:54:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-10-24 19:54:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-10-24 19:54:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-10-24 19:54:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-10-24 19:54:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-24 19:54:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004658169] [2024-10-24 19:54:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004658169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023202439] [2024-10-24 19:54:07,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:54:07,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:07,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:07,848 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-10-24 19:54:07,850 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-10-24 19:54:07,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:54:07,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:54:07,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 19:54:07,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-24 19:54:08,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-24 19:54:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023202439] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:09,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2024-10-24 19:54:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661186469] [2024-10-24 19:54:09,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:09,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-10-24 19:54:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-10-24 19:54:09,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3173, Invalid=3967, Unknown=0, NotChecked=0, Total=7140 [2024-10-24 19:54:09,697 INFO L87 Difference]: Start difference. First operand 250 states and 300 transitions. Second operand has 85 states, 84 states have (on average 6.726190476190476) internal successors, (565), 85 states have internal predecessors, (565), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-10-24 19:54:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:10,251 INFO L93 Difference]: Finished difference Result 489 states and 643 transitions. [2024-10-24 19:54:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-24 19:54:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 6.726190476190476) internal successors, (565), 85 states have internal predecessors, (565), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) Word has length 438 [2024-10-24 19:54:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:10,255 INFO L225 Difference]: With dead ends: 489 [2024-10-24 19:54:10,255 INFO L226 Difference]: Without dead ends: 487 [2024-10-24 19:54:10,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3504, Invalid=4506, Unknown=0, NotChecked=0, Total=8010 [2024-10-24 19:54:10,257 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:10,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 19:54:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-24 19:54:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2024-10-24 19:54:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 381 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-24 19:54:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 590 transitions. [2024-10-24 19:54:10,275 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 590 transitions. Word has length 438 [2024-10-24 19:54:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:10,275 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 590 transitions. [2024-10-24 19:54:10,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 6.726190476190476) internal successors, (565), 85 states have internal predecessors, (565), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-10-24 19:54:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 590 transitions. [2024-10-24 19:54:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2024-10-24 19:54:10,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:54:10,288 INFO L215 NwaCegarLoop]: trace histogram [103, 103, 103, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:10,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 19:54:10,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:10,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-24 19:54:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:54:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 752209310, now seen corresponding path program 3 times [2024-10-24 19:54:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:54:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219725513] [2024-10-24 19:54:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:54:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:54:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 19:54:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 19:54:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 19:54:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 19:54:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 19:54:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 19:54:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 19:54:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 19:54:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 19:54:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 19:54:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 19:54:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 19:54:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 19:54:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 19:54:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 19:54:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 19:54:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 19:54:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 19:54:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 19:54:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 19:54:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 19:54:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 19:54:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-24 19:54:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-24 19:54:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-24 19:54:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-24 19:54:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-24 19:54:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-24 19:54:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-24 19:54:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-24 19:54:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-24 19:54:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-24 19:54:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-10-24 19:54:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-24 19:54:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-10-24 19:54:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-24 19:54:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-10-24 19:54:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-24 19:54:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-24 19:54:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-24 19:54:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-24 19:54:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-10-24 19:54:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-24 19:54:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-24 19:54:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2024-10-24 19:54:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-10-24 19:54:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-10-24 19:54:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-10-24 19:54:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-10-24 19:54:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-10-24 19:54:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-24 19:54:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2024-10-24 19:54:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-10-24 19:54:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2024-10-24 19:54:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2024-10-24 19:54:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2024-10-24 19:54:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2024-10-24 19:54:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 499 [2024-10-24 19:54:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-24 19:54:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516 [2024-10-24 19:54:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2024-10-24 19:54:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-10-24 19:54:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2024-10-24 19:54:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-10-24 19:54:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-10-24 19:54:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2024-10-24 19:54:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577 [2024-10-24 19:54:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2024-10-24 19:54:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 594 [2024-10-24 19:54:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2024-10-24 19:54:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611 [2024-10-24 19:54:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2024-10-24 19:54:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-10-24 19:54:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 635 [2024-10-24 19:54:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 645 [2024-10-24 19:54:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-10-24 19:54:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2024-10-24 19:54:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 669 [2024-10-24 19:54:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 679 [2024-10-24 19:54:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 686 [2024-10-24 19:54:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 696 [2024-10-24 19:54:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2024-10-24 19:54:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2024-10-24 19:54:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 720 [2024-10-24 19:54:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 730 [2024-10-24 19:54:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-10-24 19:54:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-10-24 19:54:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 754 [2024-10-24 19:54:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 764 [2024-10-24 19:54:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 771 [2024-10-24 19:54:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 781 [2024-10-24 19:54:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2024-10-24 19:54:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 798 [2024-10-24 19:54:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 805 [2024-10-24 19:54:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 815 [2024-10-24 19:54:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 822 [2024-10-24 19:54:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-10-24 19:54:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 839 [2024-10-24 19:54:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 849 [2024-10-24 19:54:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-10-24 19:54:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 866 [2024-10-24 19:54:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 873 [2024-10-24 19:54:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 883 [2024-10-24 19:54:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:54:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 32691 backedges. 0 proven. 11679 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2024-10-24 19:54:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:54:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219725513] [2024-10-24 19:54:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219725513] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:54:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806925802] [2024-10-24 19:54:13,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:54:13,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:54:13,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:54:13,463 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-10-24 19:54:13,469 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-10-24 19:54:13,541 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 19:54:13,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:54:13,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 19:54:13,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:54:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 32691 backedges. 303 proven. 407 refuted. 0 times theorem prover too weak. 31981 trivial. 0 not checked. [2024-10-24 19:54:14,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:54:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32691 backedges. 303 proven. 407 refuted. 0 times theorem prover too weak. 31981 trivial. 0 not checked. [2024-10-24 19:54:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806925802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:54:14,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:54:14,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 67 [2024-10-24 19:54:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246985471] [2024-10-24 19:54:14,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:54:14,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-24 19:54:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:54:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-24 19:54:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=2764, Unknown=0, NotChecked=0, Total=4556 [2024-10-24 19:54:14,926 INFO L87 Difference]: Start difference. First operand 487 states and 590 transitions. Second operand has 68 states, 67 states have (on average 6.447761194029851) internal successors, (432), 68 states have internal predecessors, (432), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-10-24 19:54:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:54:15,087 INFO L93 Difference]: Finished difference Result 487 states and 590 transitions. [2024-10-24 19:54:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 19:54:15,088 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 6.447761194029851) internal successors, (432), 68 states have internal predecessors, (432), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) Word has length 890 [2024-10-24 19:54:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:54:15,093 INFO L225 Difference]: With dead ends: 487 [2024-10-24 19:54:15,093 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 19:54:15,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2049 GetRequests, 1974 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2241, Invalid=3459, Unknown=0, NotChecked=0, Total=5700 [2024-10-24 19:54:15,102 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:54:15,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 102 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:54:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 19:54:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 19:54:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:54:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 19:54:15,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 890 [2024-10-24 19:54:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:54:15,103 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 19:54:15,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.447761194029851) internal successors, (432), 68 states have internal predecessors, (432), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-10-24 19:54:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 19:54:15,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 19:54:15,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-24 19:54:15,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-24 19:54:15,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-24 19:54:15,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-24 19:54:15,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-24 19:54:15,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 19:54:15,308 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,SelfDestructingSolverStorable16 [2024-10-24 19:54:15,312 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:54:15,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 19:54:15,933 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:54:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:54:15 BoogieIcfgContainer [2024-10-24 19:54:15,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:54:15,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:54:15,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:54:15,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:54:15,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:54:00" (3/4) ... [2024-10-24 19:54:15,951 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 19:54:15,954 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-24 19:54:15,957 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-24 19:54:15,957 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-24 19:54:15,957 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 19:54:15,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 19:54:16,026 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:54:16,026 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 19:54:16,026 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:54:16,027 INFO L158 Benchmark]: Toolchain (without parser) took 16495.40ms. Allocated memory was 151.0MB in the beginning and 576.7MB in the end (delta: 425.7MB). Free memory was 78.9MB in the beginning and 538.2MB in the end (delta: -459.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:54:16,027 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:54:16,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.40ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 66.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 19:54:16,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.03ms. Allocated memory is still 151.0MB. Free memory was 66.5MB in the beginning and 65.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:54:16,028 INFO L158 Benchmark]: Boogie Preprocessor took 60.81ms. Allocated memory is still 151.0MB. Free memory was 65.0MB in the beginning and 63.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:54:16,028 INFO L158 Benchmark]: RCFGBuilder took 354.48ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 63.1MB in the beginning and 187.0MB in the end (delta: -123.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 19:54:16,028 INFO L158 Benchmark]: TraceAbstraction took 15745.57ms. Allocated memory was 218.1MB in the beginning and 576.7MB in the end (delta: 358.6MB). Free memory was 186.0MB in the beginning and 543.4MB in the end (delta: -357.4MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. [2024-10-24 19:54:16,028 INFO L158 Benchmark]: Witness Printer took 77.00ms. Allocated memory is still 576.7MB. Free memory was 543.4MB in the beginning and 538.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:54:16,029 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.16ms. Allocated memory is still 151.0MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.40ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 66.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.03ms. Allocated memory is still 151.0MB. Free memory was 66.5MB in the beginning and 65.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.81ms. Allocated memory is still 151.0MB. Free memory was 65.0MB in the beginning and 63.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 354.48ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 63.1MB in the beginning and 187.0MB in the end (delta: -123.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15745.57ms. Allocated memory was 218.1MB in the beginning and 576.7MB in the end (delta: 358.6MB). Free memory was 186.0MB in the beginning and 543.4MB in the end (delta: -357.4MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. * Witness Printer took 77.00ms. Allocated memory is still 576.7MB. Free memory was 543.4MB in the beginning and 538.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - 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: 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: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: 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, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 17, TraceHistogramMax: 103, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 1898 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1476 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1568 IncrementalHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 422 mSDtfsCounter, 1568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4317 GetRequests, 3993 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=16, InterpolantAutomatonStates: 202, 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, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 3891 NumberOfCodeBlocks, 2976 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5684 ConstructedInterpolants, 0 QuantifiedInterpolants, 12121 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1938 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 104680/127193 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 12 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((1 <= p) && (i == 0)) && (((long long) p + bufsize) <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen)) || ((((((((1 <= p) && (1 <= i)) && (i <= 2147483646)) && (bufsize <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-24 19:54:16,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE