./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/MultCommutative-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/MultCommutative-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f58e1f128e4dbefcdb138e1f7ef5e4260326da20e0bd376d80fe12a55b55920 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:11:34,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:11:34,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:11:34,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:11:34,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:11:34,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:11:34,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:11:34,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:11:34,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:11:34,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:11:34,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:11:34,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:11:34,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:11:34,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:11:34,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:11:34,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:11:34,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:11:34,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:11:34,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:11:34,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:11:34,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:11:34,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:11:34,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:11:34,337 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:11:34,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:11:34,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:11:34,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:11:34,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:11:34,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:11:34,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:11:34,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:11:34,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:11:34,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:11:34,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:11:34,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:11:34,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:11:34,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:11:34,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:11:34,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:11:34,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:11:34,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:11:34,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f58e1f128e4dbefcdb138e1f7ef5e4260326da20e0bd376d80fe12a55b55920 [2024-11-19 10:11:34,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:11:34,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:11:34,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:11:34,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:11:34,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:11:34,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/MultCommutative-1.c [2024-11-19 10:11:36,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:11:36,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:11:36,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/MultCommutative-1.c [2024-11-19 10:11:36,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c69f96b8/6dda089fa3384870ab461ec11e1dbb8c/FLAG9efeefa2b [2024-11-19 10:11:36,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c69f96b8/6dda089fa3384870ab461ec11e1dbb8c [2024-11-19 10:11:36,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:11:36,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:11:36,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:11:36,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:11:36,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:11:36,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd715c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36, skipping insertion in model container [2024-11-19 10:11:36,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:11:36,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:11:36,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:11:36,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:11:36,492 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:11:36,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36 WrapperNode [2024-11-19 10:11:36,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:11:36,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:11:36,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:11:36,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:11:36,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,514 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-11-19 10:11:36,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:11:36,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:11:36,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:11:36,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:11:36,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,539 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-19 10:11:36,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:11:36,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:11:36,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:11:36,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:11:36,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (1/1) ... [2024-11-19 10:11:36,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:11:36,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:36,581 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-19 10:11:36,582 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-19 10:11:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:11:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-11-19 10:11:36,614 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-11-19 10:11:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:11:36,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:11:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:11:36,664 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:11:36,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:11:36,775 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-19 10:11:36,775 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:11:36,786 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:11:36,787 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 10:11:36,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:36 BoogieIcfgContainer [2024-11-19 10:11:36,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:11:36,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:11:36,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:11:36,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:11:36,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:11:36" (1/3) ... [2024-11-19 10:11:36,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76003dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:36, skipping insertion in model container [2024-11-19 10:11:36,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:36" (2/3) ... [2024-11-19 10:11:36,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76003dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:36, skipping insertion in model container [2024-11-19 10:11:36,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:36" (3/3) ... [2024-11-19 10:11:36,794 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative-1.c [2024-11-19 10:11:36,807 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:11:36,807 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 10:11:36,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:11:36,849 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;@29b9a20d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:11:36,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 10:11:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:11:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:11:36,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:36,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:36,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 617854126, now seen corresponding path program 1 times [2024-11-19 10:11:36,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511002220] [2024-11-19 10:11:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:36,990 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-19 10:11:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:36,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511002220] [2024-11-19 10:11:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511002220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:11:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052220804] [2024-11-19 10:11:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:11:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:11:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:11:37,048 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,101 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-19 10:11:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:11:37,104 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 10:11:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,111 INFO L225 Difference]: With dead ends: 40 [2024-11-19 10:11:37,111 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 10:11:37,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:11:37,116 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 10:11:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-19 10:11:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:11:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-19 10:11:37,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2024-11-19 10:11:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,154 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-19 10:11:37,154 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-19 10:11:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:11:37,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:11:37,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1973608759, now seen corresponding path program 1 times [2024-11-19 10:11:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645347914] [2024-11-19 10:11:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,266 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-19 10:11:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645347914] [2024-11-19 10:11:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645347914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:37,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722395298] [2024-11-19 10:11:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:37,269 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,425 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-11-19 10:11:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 10:11:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,429 INFO L225 Difference]: With dead ends: 66 [2024-11-19 10:11:37,429 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 10:11:37,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:37,431 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 10:11:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-11-19 10:11:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:11:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-19 10:11:37,444 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 9 [2024-11-19 10:11:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-19 10:11:37,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-19 10:11:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:11:37,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:11:37,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1052546898, now seen corresponding path program 1 times [2024-11-19 10:11:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749691227] [2024-11-19 10:11:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,530 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-19 10:11:37,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749691227] [2024-11-19 10:11:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749691227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:37,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190575652] [2024-11-19 10:11:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:37,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:37,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:37,533 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,613 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-11-19 10:11:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:37,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 10:11:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,615 INFO L225 Difference]: With dead ends: 62 [2024-11-19 10:11:37,615 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 10:11:37,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:37,616 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 78 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 10:11:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2024-11-19 10:11:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:11:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2024-11-19 10:11:37,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 10 [2024-11-19 10:11:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,632 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2024-11-19 10:11:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2024-11-19 10:11:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:11:37,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,632 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:37,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:11:37,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash -749777878, now seen corresponding path program 1 times [2024-11-19 10:11:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601562521] [2024-11-19 10:11:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:37,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601562521] [2024-11-19 10:11:37,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601562521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:37,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:37,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344268692] [2024-11-19 10:11:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:37,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:37,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:37,688 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,750 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2024-11-19 10:11:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:37,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:11:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,752 INFO L225 Difference]: With dead ends: 83 [2024-11-19 10:11:37,752 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 10:11:37,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:11:37,753 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 10:11:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2024-11-19 10:11:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:11:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2024-11-19 10:11:37,764 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 15 [2024-11-19 10:11:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,764 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2024-11-19 10:11:37,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2024-11-19 10:11:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:11:37,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,765 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:37,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:11:37,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:37,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1029564684, now seen corresponding path program 1 times [2024-11-19 10:11:37,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292632351] [2024-11-19 10:11:37,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:37,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292632351] [2024-11-19 10:11:37,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292632351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:37,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113250678] [2024-11-19 10:11:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:37,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:37,808 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:11:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,851 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2024-11-19 10:11:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:37,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 10:11:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,853 INFO L225 Difference]: With dead ends: 125 [2024-11-19 10:11:37,853 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 10:11:37,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:37,855 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 10:11:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2024-11-19 10:11:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 10:11:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-11-19 10:11:37,864 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 16 [2024-11-19 10:11:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,865 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-11-19 10:11:37,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:11:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-19 10:11:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:11:37,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,866 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:37,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:11:37,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:37,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1851951645, now seen corresponding path program 1 times [2024-11-19 10:11:37,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794535841] [2024-11-19 10:11:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:37,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:37,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794535841] [2024-11-19 10:11:37,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794535841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:37,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:37,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979675848] [2024-11-19 10:11:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:37,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:37,906 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:11:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,971 INFO L93 Difference]: Finished difference Result 102 states and 132 transitions. [2024-11-19 10:11:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:37,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 10:11:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,973 INFO L225 Difference]: With dead ends: 102 [2024-11-19 10:11:37,973 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 10:11:37,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:37,974 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 118 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 10:11:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-11-19 10:11:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 10:11:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2024-11-19 10:11:37,989 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 17 [2024-11-19 10:11:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,989 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2024-11-19 10:11:37,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:11:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2024-11-19 10:11:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:11:37,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:37,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:11:37,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:37,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1700557631, now seen corresponding path program 1 times [2024-11-19 10:11:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080001864] [2024-11-19 10:11:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:38,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:38,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080001864] [2024-11-19 10:11:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080001864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:38,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251248447] [2024-11-19 10:11:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:38,093 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-19 10:11:38,094 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-19 10:11:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:38,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:11:38,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:38,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:38,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251248447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:38,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:38,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-19 10:11:38,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176526335] [2024-11-19 10:11:38,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:38,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:11:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:11:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:11:38,287 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:11:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:38,404 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2024-11-19 10:11:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:11:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-19 10:11:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:38,406 INFO L225 Difference]: With dead ends: 157 [2024-11-19 10:11:38,406 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 10:11:38,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:11:38,407 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:38,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 121 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 10:11:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2024-11-19 10:11:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 97 states have internal predecessors, (124), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 10:11:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2024-11-19 10:11:38,443 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 18 [2024-11-19 10:11:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:38,443 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2024-11-19 10:11:38,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:11:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2024-11-19 10:11:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:11:38,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:38,445 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:38,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:11:38,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:38,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:38,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash -490229936, now seen corresponding path program 1 times [2024-11-19 10:11:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495379513] [2024-11-19 10:11:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:11:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:38,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495379513] [2024-11-19 10:11:38,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495379513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:38,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:38,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:11:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808637924] [2024-11-19 10:11:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:38,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:38,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:38,726 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:38,773 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2024-11-19 10:11:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 10:11:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:38,774 INFO L225 Difference]: With dead ends: 163 [2024-11-19 10:11:38,774 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 10:11:38,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:11:38,775 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:38,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 10:11:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2024-11-19 10:11:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:11:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-19 10:11:38,785 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2024-11-19 10:11:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:38,785 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-19 10:11:38,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:11:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-19 10:11:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:11:38,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:38,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:38,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:11:38,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:38,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1177679063, now seen corresponding path program 1 times [2024-11-19 10:11:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747774923] [2024-11-19 10:11:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747774923] [2024-11-19 10:11:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747774923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842194015] [2024-11-19 10:11:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:38,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:38,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:38,839 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-19 10:11:38,840 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-19 10:11:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:38,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:11:38,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:38,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842194015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:39,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-19 10:11:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054020107] [2024-11-19 10:11:39,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:39,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:11:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:11:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:11:39,001 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:11:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:39,121 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-11-19 10:11:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:11:39,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-19 10:11:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:39,122 INFO L225 Difference]: With dead ends: 65 [2024-11-19 10:11:39,122 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 10:11:39,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:11:39,122 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:39,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 119 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 10:11:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-19 10:11:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 10:11:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-11-19 10:11:39,140 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 19 [2024-11-19 10:11:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:39,140 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-11-19 10:11:39,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:11:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-19 10:11:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 10:11:39,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:39,141 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:39,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:11:39,341 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,SelfDestructingSolverStorable8 [2024-11-19 10:11:39,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:39,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1664379658, now seen corresponding path program 1 times [2024-11-19 10:11:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201097093] [2024-11-19 10:11:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:11:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201097093] [2024-11-19 10:11:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201097093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69416595] [2024-11-19 10:11:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:39,431 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-19 10:11:39,432 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-19 10:11:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:39,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:11:39,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:11:39,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:11:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69416595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:39,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-19 10:11:39,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321825276] [2024-11-19 10:11:39,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:39,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:11:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:11:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:11:39,565 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:11:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:39,641 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2024-11-19 10:11:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:11:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-19 10:11:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:39,642 INFO L225 Difference]: With dead ends: 70 [2024-11-19 10:11:39,642 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 10:11:39,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:11:39,643 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:39,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 10:11:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2024-11-19 10:11:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.127659574468085) internal successors, (53), 46 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 10:11:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-19 10:11:39,650 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 25 [2024-11-19 10:11:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:39,650 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-19 10:11:39,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:11:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-11-19 10:11:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:11:39,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:39,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:39,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 10:11:39,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:39,856 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 56161900, now seen corresponding path program 1 times [2024-11-19 10:11:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902621630] [2024-11-19 10:11:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:11:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902621630] [2024-11-19 10:11:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902621630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193713472] [2024-11-19 10:11:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:39,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:11:39,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:11:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:39,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:11:39,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:11:40,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:11:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193713472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:40,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:40,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2024-11-19 10:11:40,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857203168] [2024-11-19 10:11:40,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:40,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:11:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:11:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:11:40,144 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:11:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:40,303 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-19 10:11:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:11:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-19 10:11:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:40,304 INFO L225 Difference]: With dead ends: 93 [2024-11-19 10:11:40,304 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 10:11:40,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:11:40,305 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:40,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 10:11:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-19 10:11:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 10:11:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-19 10:11:40,311 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 26 [2024-11-19 10:11:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:40,311 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-19 10:11:40,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:11:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-11-19 10:11:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 10:11:40,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:40,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:40,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:11:40,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:40,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:11:40,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1495284169, now seen corresponding path program 1 times [2024-11-19 10:11:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014244847] [2024-11-19 10:11:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:11:40,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:11:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:11:40,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:11:40,543 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:11:40,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 10:11:40,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 10:11:40,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 10:11:40,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 10:11:40,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 10:11:40,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 10:11:40,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:11:40,553 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:40,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:11:40,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:11:40 BoogieIcfgContainer [2024-11-19 10:11:40,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:11:40,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:11:40,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:11:40,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:11:40,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:36" (3/4) ... [2024-11-19 10:11:40,598 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:11:40,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:11:40,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:11:40,628 INFO L158 Benchmark]: Toolchain (without parser) took 4340.66ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 160.0MB in the beginning and 162.7MB in the end (delta: -2.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-11-19 10:11:40,628 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:11:40,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.56ms. Allocated memory is still 190.8MB. Free memory was 159.8MB in the beginning and 151.7MB in the end (delta: 8.1MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-19 10:11:40,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.78ms. Allocated memory is still 190.8MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:11:40,629 INFO L158 Benchmark]: Boogie Preprocessor took 37.38ms. Allocated memory is still 190.8MB. Free memory was 149.6MB in the beginning and 148.7MB in the end (delta: 872.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:11:40,629 INFO L158 Benchmark]: RCFGBuilder took 235.74ms. Allocated memory is still 190.8MB. Free memory was 148.7MB in the beginning and 136.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:11:40,629 INFO L158 Benchmark]: TraceAbstraction took 3802.22ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 135.8MB in the beginning and 165.9MB in the end (delta: -30.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-19 10:11:40,629 INFO L158 Benchmark]: Witness Printer took 35.19ms. Allocated memory is still 230.7MB. Free memory was 164.8MB in the beginning and 162.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:11:40,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.56ms. Allocated memory is still 190.8MB. Free memory was 159.8MB in the beginning and 151.7MB in the end (delta: 8.1MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.78ms. Allocated memory is still 190.8MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.38ms. Allocated memory is still 190.8MB. Free memory was 149.6MB in the beginning and 148.7MB in the end (delta: 872.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 235.74ms. Allocated memory is still 190.8MB. Free memory was 148.7MB in the beginning and 136.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3802.22ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 135.8MB in the beginning and 165.9MB in the end (delta: -30.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 35.19ms. Allocated memory is still 230.7MB. Free memory was 164.8MB in the beginning and 162.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L28] int m = __VERIFIER_nondet_int(); [L29] COND FALSE !(m < 0) [L32] int n = __VERIFIER_nondet_int(); [L33] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L36] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L18] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L21] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L24] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L24] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L18] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L21] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L24] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L24] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L18] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L21] COND TRUE m == 0 [L22] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, n=1073741824] [L24] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L24] EXPR n + mult(n, m - 1) [L24] return n + mult(n, m - 1); [L24] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L24] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2] - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 1050 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 740 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 649 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 310 mSDtfsCounter, 649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 165 SyntacticMatches, 15 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=7, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 115 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 852 SizeOfPredicates, 7 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 45/99 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 10:11:40,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)