./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound100.c -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 fee025173b123742b5b08bb8895dc7c9911cdbb928d94cbe9fdb074ddb7a3572 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:50:43,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:50:43,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:50:43,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:50:43,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:50:43,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:50:43,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:50:43,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:50:43,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:50:43,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:50:43,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:50:43,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:50:43,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:50:43,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:50:43,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:50:43,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:50:43,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:50:43,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:50:43,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:50:43,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:50:43,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:50:43,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:50:43,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:50:43,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:50:43,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:50:43,583 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:50:43,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:50:43,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:50:43,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:50:43,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:50:43,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:50:43,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:50:43,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:50:43,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:50:43,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:50:43,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:50:43,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:50:43,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:50:43,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:50:43,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:50:43,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:50:43,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:50:43,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:50:43,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:50:43,587 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 -> fee025173b123742b5b08bb8895dc7c9911cdbb928d94cbe9fdb074ddb7a3572 [2024-11-09 11:50:43,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:50:43,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:50:43,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:50:43,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:50:43,811 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:50:43,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound100.c [2024-11-09 11:50:45,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:50:45,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:50:45,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound100.c [2024-11-09 11:50:45,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8052e1/7c8807583a844f6da5ad5590e21d914e/FLAG945d56a39 [2024-11-09 11:50:45,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8052e1/7c8807583a844f6da5ad5590e21d914e [2024-11-09 11:50:45,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:50:45,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:50:45,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:50:45,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:50:45,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:50:45,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372c799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45, skipping insertion in model container [2024-11-09 11:50:45,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:50:45,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:50:45,800 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:50:45,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:50:45,824 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:50:45,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45 WrapperNode [2024-11-09 11:50:45,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:50:45,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:50:45,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:50:45,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:50:45,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,856 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-11-09 11:50:45,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:50:45,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:50:45,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:50:45,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:50:45,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,882 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-11-09 11:50:45,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:50:45,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:50:45,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:50:45,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:50:45,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (1/1) ... [2024-11-09 11:50:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:50:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:50:45,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:50:45,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:50:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:50:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:50:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:50:45,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:50:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:50:45,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:50:46,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:50:46,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:50:46,221 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-09 11:50:46,221 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:50:46,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:50:46,233 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:50:46,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:50:46 BoogieIcfgContainer [2024-11-09 11:50:46,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:50:46,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:50:46,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:50:46,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:50:46,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:50:45" (1/3) ... [2024-11-09 11:50:46,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b85e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:50:46, skipping insertion in model container [2024-11-09 11:50:46,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:50:45" (2/3) ... [2024-11-09 11:50:46,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b85e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:50:46, skipping insertion in model container [2024-11-09 11:50:46,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:50:46" (3/3) ... [2024-11-09 11:50:46,241 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-u2_unwindbound100.c [2024-11-09 11:50:46,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:50:46,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-09 11:50:46,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:50:46,305 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;@6a9837cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:50:46,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-09 11:50:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:50:46,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:46,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:50:46,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:46,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 925668, now seen corresponding path program 1 times [2024-11-09 11:50:46,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250599341] [2024-11-09 11:50:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:46,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:46,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250599341] [2024-11-09 11:50:46,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250599341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:46,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:50:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988115758] [2024-11-09 11:50:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:50:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:46,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:50:46,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:50:46,518 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:46,583 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2024-11-09 11:50:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:50:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 11:50:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:46,591 INFO L225 Difference]: With dead ends: 126 [2024-11-09 11:50:46,591 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 11:50:46,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:50:46,597 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:46,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 116 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:50:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 11:50:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 11:50:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.75) internal successors, (56), 54 states have internal predecessors, (56), 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-11-09 11:50:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-09 11:50:46,630 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2024-11-09 11:50:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:46,630 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-09 11:50:46,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-09 11:50:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 11:50:46,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:46,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 11:50:46,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:50:46,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:46,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2024-11-09 11:50:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833413875] [2024-11-09 11:50:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833413875] [2024-11-09 11:50:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833413875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:46,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:46,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:50:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865639179] [2024-11-09 11:50:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:46,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:50:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:50:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:50:46,681 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:46,714 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-09 11:50:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:50:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 11:50:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:46,716 INFO L225 Difference]: With dead ends: 74 [2024-11-09 11:50:46,716 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:50:46,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:50:46,717 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:46,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:50:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:50:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 11:50:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 58 states have internal predecessors, (60), 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-11-09 11:50:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2024-11-09 11:50:46,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 5 [2024-11-09 11:50:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:46,727 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2024-11-09 11:50:46,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2024-11-09 11:50:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:50:46,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:46,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:50:46,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:50:46,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:46,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1806812487, now seen corresponding path program 1 times [2024-11-09 11:50:46,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:46,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013940319] [2024-11-09 11:50:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:50:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885277899] [2024-11-09 11:50:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:46,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:50:46,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:50:46,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:50:46,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:50:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:46,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:50:46,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:50:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:46,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:50:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:46,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013940319] [2024-11-09 11:50:46,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:50:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885277899] [2024-11-09 11:50:46,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885277899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:46,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:46,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:50:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206820828] [2024-11-09 11:50:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:50:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:50:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:50:46,811 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:46,894 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-09 11:50:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:50:46,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:50:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:46,896 INFO L225 Difference]: With dead ends: 91 [2024-11-09 11:50:46,896 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 11:50:46,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:50:46,897 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:46,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 62 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:50:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 11:50:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-09 11:50:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-09 11:50:46,907 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 7 [2024-11-09 11:50:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-09 11:50:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-09 11:50:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:50:46,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:46,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:50:46,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:50:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:50:47,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 122113611, now seen corresponding path program 1 times [2024-11-09 11:50:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672121607] [2024-11-09 11:50:47,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:50:47,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665763775] [2024-11-09 11:50:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:47,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:50:47,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:50:47,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:50:47,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:50:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:47,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:50:47,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:50:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:47,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:50:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672121607] [2024-11-09 11:50:47,270 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:50:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665763775] [2024-11-09 11:50:47,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665763775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:47,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:47,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:50:47,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332011040] [2024-11-09 11:50:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:50:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:50:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:50:47,272 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:47,362 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-09 11:50:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:50:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 11:50:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:47,364 INFO L225 Difference]: With dead ends: 83 [2024-11-09 11:50:47,365 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 11:50:47,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:50:47,366 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:47,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:50:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 11:50:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-09 11:50:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-09 11:50:47,379 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 11 [2024-11-09 11:50:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:47,379 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-09 11:50:47,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:50:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-09 11:50:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 11:50:47,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:47,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:50:47,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:50:47,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 11:50:47,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -509445297, now seen corresponding path program 1 times [2024-11-09 11:50:47,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238892502] [2024-11-09 11:50:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238892502] [2024-11-09 11:50:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238892502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:50:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863621255] [2024-11-09 11:50:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:50:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:47,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:50:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:50:47,698 INFO L87 Difference]: Start difference. First operand 79 states and 86 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-11-09 11:50:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:47,773 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-09 11:50:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:50:47,774 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-11-09 11:50:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:47,775 INFO L225 Difference]: With dead ends: 83 [2024-11-09 11:50:47,776 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 11:50:47,776 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-11-09 11:50:47,777 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:47,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:50:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 11:50:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-09 11:50:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.509433962264151) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-09 11:50:47,786 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 12 [2024-11-09 11:50:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:47,787 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-09 11:50:47,787 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-11-09 11:50:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-09 11:50:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:50:47,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:47,788 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] [2024-11-09 11:50:47,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:50:47,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:47,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:47,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1343722417, now seen corresponding path program 1 times [2024-11-09 11:50:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:47,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110947358] [2024-11-09 11:50:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 11:50:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:47,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110947358] [2024-11-09 11:50:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110947358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:50:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240968420] [2024-11-09 11:50:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:47,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:50:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:50:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:50:47,860 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-11-09 11:50:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:47,871 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-09 11:50:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:50:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2024-11-09 11:50:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:47,874 INFO L225 Difference]: With dead ends: 81 [2024-11-09 11:50:47,874 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 11:50:47,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:50:47,875 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:47,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:50:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 11:50:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 11:50:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-09 11:50:47,881 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 21 [2024-11-09 11:50:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:47,882 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-09 11:50:47,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-11-09 11:50:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-09 11:50:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:50:47,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:47,883 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-11-09 11:50:47,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:50:47,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1467951768, now seen corresponding path program 1 times [2024-11-09 11:50:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777028598] [2024-11-09 11:50:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:47,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 11:50:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:47,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777028598] [2024-11-09 11:50:47,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777028598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:47,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:50:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708248713] [2024-11-09 11:50:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:47,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:50:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:50:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:50:47,962 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:50:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:48,468 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-09 11:50:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:50:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 11:50:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:48,469 INFO L225 Difference]: With dead ends: 79 [2024-11-09 11:50:48,469 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 11:50:48,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:50:48,470 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:48,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 76 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:50:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 11:50:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 11:50:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-09 11:50:48,475 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 23 [2024-11-09 11:50:48,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:48,475 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-09 11:50:48,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:50:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-09 11:50:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:50:48,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:48,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:50:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:50:48,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:48,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1738135543, now seen corresponding path program 1 times [2024-11-09 11:50:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845913057] [2024-11-09 11:50:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:50:48,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694836073] [2024-11-09 11:50:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:48,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:50:48,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:50:48,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:50:48,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:50:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:48,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:50:48,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:50:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:50:48,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:50:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:50:48,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845913057] [2024-11-09 11:50:48,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:50:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694836073] [2024-11-09 11:50:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694836073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:50:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:50:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:50:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164973235] [2024-11-09 11:50:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:50:48,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:50:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:50:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:50:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:50:48,635 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (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-11-09 11:50:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:50:48,748 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-09 11:50:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:50:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (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 24 [2024-11-09 11:50:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:50:48,749 INFO L225 Difference]: With dead ends: 83 [2024-11-09 11:50:48,749 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 11:50:48,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-11-09 11:50:48,749 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:50:48,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:50:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 11:50:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-09 11:50:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:50:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-09 11:50:48,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 24 [2024-11-09 11:50:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:50:48,755 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-09 11:50:48,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (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-11-09 11:50:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-09 11:50:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:50:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:50:48,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:50:48,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:50:48,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:50:48,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:50:48,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:50:48,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1952372918, now seen corresponding path program 1 times [2024-11-09 11:50:48,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:50:48,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415521006] [2024-11-09 11:50:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:50:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:50:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:50:57,116 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 11:51:05,136 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 11:51:13,181 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 11:51:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 11:51:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:51:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:51:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:51:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415521006] [2024-11-09 11:51:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415521006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:51:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:51:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:51:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500597731] [2024-11-09 11:51:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:51:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:51:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:51:21,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:51:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2024-11-09 11:51:21,800 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-11-09 11:51:25,807 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| (div |c_ULTIMATE.start_main_~z~0#1| 4294967296)))) (and (<= (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1| (* 4294967296 .cse0)) (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) 1)) (<= |c_ULTIMATE.start_main_~y~0#1| (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775809)) (<= (* |c_ULTIMATE.start_main_~x~0#1| (div (+ 4294967295 |c_ULTIMATE.start_main_~z~0#1|) 4294967296)) (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648 .cse0)))) is different from true [2024-11-09 11:51:29,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:31,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:35,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:39,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:43,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:48,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:52,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:51:56,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:01,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:05,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:09,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:11,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:15,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:17,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:22,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:26,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:28,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:30,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:52:33,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []